Scheduling method and scheduling system for assigning application to processor

• US 9,588,817 B2
• Filed: 07/19/2013
• Issued: 03/07/2017
• Est. Priority Date: 01/21/2011
• Status: Expired due to Fees

• Current Assignee: Fujitsu Limited
• Original Assignee: Fujitsu Limited
• Inventors: Yamauchi, Hiromasa, Yamashita, Koichiro, Hiraki, Tetsuo, Kurihara, Koji, Otomo, Toshiya
• Primary Examiner(s): Lee, Tammy
• Application Number:
  US13/946,361
• Publication Number:
  US 20130312002A1
• Time in Patent Office: 1,327 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 9/4881 Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals
• CPC Class Codes: G06F 9/5083 Techniques for rebalancing the load in a distributed system

Abstract

A scheduling method executed by a scheduler that manages multiple processors, includes detecting based on an application information table when a first application is started up, a processor that executes a second application that is not executed concurrently with the first application; and assigning the first application to the processor.

Claims

1. A scheduling method executed by a scheduler that manages a plurality of processors, the scheduling method comprising:

calculating, for each of the processors, based on an application information table and upon receiving start-up notification for a first application,

a total of a switching cost for switching each of a plurality of second applications assigned to the respective processor to the first application, the switching cost for each of the second applications being based on a time period for switching of context of the respective second application and an expected number of switches between the respective second application and the first application; and

selecting, based on the totals calculated for each of the processors, a first processor, from among the processors, to execute the first application.

2. The scheduling method according to claim 1, wherein

each of the second applications is an application other than a concurrently executed application that is registered in the application information table as having a potential of being executed concurrently with the first application.

3. The scheduling method according to claim 2, wherein

the application information table includes, for the first application and each of the second applications, context information of the application.

4. The scheduling method according to claim 1, further comprising:

calculating, based on the application information table, a switching cost required for switching a third application executed by at least one of the processors to each of the second applications, and

selecting, based on the switching cost, a second processor to execute each of the second applications.

5. A scheduling system comprising:

a plurality of processors; and

a scheduler that manages the processors, wherein

the scheduler, upon receiving start-up notification for a first application, calculates for each of the processors, based on an application information table,

a total cost, a total of a switching cost for switching each of a plurality of second applications assigned to the respective processor to the first application, the switching cost for each of the second applications being based on a time period for switching of context of the respective second application and an expected number of switches between the respective second application and the first application, and

the scheduler selects, based on the totals calculated for each of the processors, a first processor, from among the processors, to execute the first application.