GANG SCHEDULING SYSTEM

PROBLEM TO BE SOLVED: To resolve a problem wherein a parallel program which should not be assigned at the same time to a plurality of CPUs carries out undesired operation. SOLUTION: A gang scheduler 20 is provided with a function of distinguishing between a parallel program which should be assigned...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: YABUKI KENTARO
Format: Patent
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:PROBLEM TO BE SOLVED: To resolve a problem wherein a parallel program which should not be assigned at the same time to a plurality of CPUs carries out undesired operation. SOLUTION: A gang scheduler 20 is provided with a function of distinguishing between a parallel program which should be assigned at the same time to the plurality of CPUs and the parallel program which should not be assigned at the same time to the plurality of CPUs by using a common a characteristic which is "used CPU times of each distribution process becomes substantially equal in the parallel program which should be assigned at the same time to the plurality of CPUs, while a difference is resulted between used CPU times of each distribution process in the parallel program which should not be assigned at the same time to the plurality of CPUs", and comparing the used CPU times of each distribution process in each parallel program. A next parallel program to be executed is determined after controlling so that the parallel program which should not be assigned at the same time to the plurality of CPUs is not a target of gang scheduling. COPYRIGHT: (C)2004,JPO&NCIPI