Simulating job scheduling for clusters of workstations

J. Santoso, G. D. van Albada, Bobby Achirul Awal Nazief, P. M.A. Sloot

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)


In this paper we study hierarchical job scheduling strategies for clusters of workstations. Our approach uses two-level scheduling: global scheduling and local scheduling. The local scheduler re_nes the scheduling decisions made by the global scheduler, taking into account the most recent information. In this paper, we explore the First Come First Served (FCFS), the Shortest Job First (SJF), and the First Fit (FF) policies at the global level and the local level. In addition, we use separate queues at the global level for arriving jobs, where the jobs with the same number of tasks are placed in one queue. At both levels, the schedulers strive to maintain a good load balance. The unit of load balancing at the global level is the job consisting of one or more parallel tasks; at the local level it is the task.

Original languageEnglish
Title of host publicationHigh Performance Computing and Networking - 8th International Conference, HPCN Europe 2000, Proceedings
EditorsMarian Bubak, Hamideh Afsarmanesh, Bob Hertzberger, Roy Williams
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540675532
Publication statusPublished - 2000
Event8th International Conference on High Performance Computing and Networking, HPCNEurope 2000 - Amsterdam, Netherlands
Duration: 8 May 200010 May 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference8th International Conference on High Performance Computing and Networking, HPCNEurope 2000


Dive into the research topics of 'Simulating job scheduling for clusters of workstations'. Together they form a unique fingerprint.

Cite this