Processing

Please wait...

Settings

Settings

Goto Application

1. US20100146515 - Support of non-trivial scheduling policies along with topological properties

Office United States of America
Application Number 12568450
Application Date 28.09.2009
Publication Number 20100146515
Publication Date 10.06.2010
Grant Number 08601480
Grant Date 03.12.2013
Publication Kind B2
IPC
G06F 9/46
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
FELECTRIC DIGITAL DATA PROCESSING
9Arrangements for program control, e.g. control units
06using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
46Multiprogramming arrangements
Applicants Shpigelman Igor
International Business Machines Corporation
Inventors Shpigelman Igor
Agents Baudino James L.
Toub Libby Z.
Title
(EN) Support of non-trivial scheduling policies along with topological properties
Abstract
(EN)

A system and method for scheduling jobs in a multiprocessor machine is disclosed. The status of resources, including CPUs on node boards and associated shared memory in the multiprocessor machine is periodically determined. The status can indicate the resources available to execute jobs. This information is accumulated by the topology-monitoring unit and provided to the topology library. The topology library also receives a candidate host list from the scheduling unit which lists all of the resources available to execute the job being scheduled based on non-trivial scheduling. The topology library unit then uses this to generate a free map F indicative of the interconnection of the resources available to execute the job. The topology monitoring unit then matches the jobs to the resources available to execute the jobs, based on resource requirements including shape requirements indicative of interconnections of resources required to execute the job. The topology monitoring unit dispatches the job to the portion of the free map F which match the shape requirements of the job. If the topology library unit determines that no resources are available to execute the job, the topology library unit will return the job to the scheduling unit and the scheduling unit which will wait until the resources become available. The free map F may include resources which have been suspended or reserved in previous scheduling cycles, provided the job to be scheduled satisfies the predetermined criteria for execution of the job on the suspended, have a lower priority, or are reserved resources.