IP Library › Granted Patent US 9,588,817
Granted Patent B2
US 9,588,817 · App. 13/946,361 · Granted Mar 7, 2017

Scheduling method and scheduling system for assigning application to processor

Inventors: Hiromasa Yamauchi (Kawasaki, JP); Koichiro Yamashita (Hachioji, JP); Tetsuo Hiraki (Kawasaki, JP); Koji Kurihara (Kawasaki, JP); Toshiya Otomo (Kawasaki, JP)
Assignee: FUJITSU LIMITED
G06F9/5027G06F9/4881G06F9/5083
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,588,817
App. No.
13/946,361
Granted
Mar 7, 2017
Kind
B2
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 (17)

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.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 5, 2016
From: YAMAUCHI, HIROMASA; HIRAKI, TETSUO; KURIHARA, KOJI; OTOMO, TOSHIYA; YAMASHITA, KOICHIRO
To: FUJITSU LIMITED
Reel/Frame 040519/0006 →
Continuity (2)
Continuation PCTJP2011051118 · Jan 21, 2011
Related Publication 20130312002A1 · Nov 21, 2013