The job scheduler of a massively parallel processor which executes jobs in batch operation should achieve short job waiting times and a high load of the system. In this paper the different scheduling strategies are examined with regard to these requirements. To simulate the schedule the different strategies use the real workload of the massively parallel processors Intel Paragon and Cray T3E at Forschungszentrum Juelich. The results of the simulation are compared with the values of the real allocation of the system. (orig.)SIGLEAvailable from TIB Hannover: RA 831(3458) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
evaluate and compare the performance of various Scheduling Algorithms. Efficiency of scheduling algo...
International audienceToday, large scale parallel systems are available at relatively low cost. Many...
This study aims to determinate which scheduling rule should be applied, for minimizing the makespan ...
Der Job-Scheduler eines massiv-paralleles Systems, das Jobs im Batch-Betrieb ausführt, soll sowohl k...
This thesis presents a deterministic job-scheduling procedure, which optimizes job-execution sequenc...
. We present a new scheduling method for batch jobs on massively parallel processor architectures. T...
The problem of job scheduling on Partitionable Massively Parallel Processor (PMPP) Systems is studie...
Scheduling is very important for an efficient utilization of modern parallel computing systems. In t...
The speed and performance of computers have become a major concern today. Multiprocessor systems are...
Abstract: In this paper we study the performance of parallel job scheduling in a distributed system....
This paper analyzes job scheduling for parallel computers by using theoretical and experimental mean...
. Parallel job scheduling is beginning to gain recognition as an important topic that is distinct f...
The specific properties of parallel computers with shared virtual memories are described, and basic ...
grantor: University of TorontoMultiprocessors are being used increasingly to support workl...
The supercomputers maintained by the Jülich Supercomputing Centre (JSC) are run in batch mode and ar...
evaluate and compare the performance of various Scheduling Algorithms. Efficiency of scheduling algo...
International audienceToday, large scale parallel systems are available at relatively low cost. Many...
This study aims to determinate which scheduling rule should be applied, for minimizing the makespan ...
Der Job-Scheduler eines massiv-paralleles Systems, das Jobs im Batch-Betrieb ausführt, soll sowohl k...
This thesis presents a deterministic job-scheduling procedure, which optimizes job-execution sequenc...
. We present a new scheduling method for batch jobs on massively parallel processor architectures. T...
The problem of job scheduling on Partitionable Massively Parallel Processor (PMPP) Systems is studie...
Scheduling is very important for an efficient utilization of modern parallel computing systems. In t...
The speed and performance of computers have become a major concern today. Multiprocessor systems are...
Abstract: In this paper we study the performance of parallel job scheduling in a distributed system....
This paper analyzes job scheduling for parallel computers by using theoretical and experimental mean...
. Parallel job scheduling is beginning to gain recognition as an important topic that is distinct f...
The specific properties of parallel computers with shared virtual memories are described, and basic ...
grantor: University of TorontoMultiprocessors are being used increasingly to support workl...
The supercomputers maintained by the Jülich Supercomputing Centre (JSC) are run in batch mode and ar...
evaluate and compare the performance of various Scheduling Algorithms. Efficiency of scheduling algo...
International audienceToday, large scale parallel systems are available at relatively low cost. Many...
This study aims to determinate which scheduling rule should be applied, for minimizing the makespan ...