Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Hierarchical resource management in the polder metacomputing initiative
Parallel Computing - Special issue on applications
Dynamite - Blasting Obstacles to Parallel Cluster Computing
HPCN Europe '99 Proceedings of the 7th International Conference on High-Performance Computing and Networking
Job Scheduling Strategies for Networks of Workstations
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
A Resource Management Architecture for Metacomputing Systems
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Metrics and Benchmarking for Parallel Job Scheduling
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Dynamic Coscheduling on Workstation Clusters
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Implementation of Gang-Scheduling on Workstation Cluster
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
A Federated Model for Scheduling in Wide-Area Systems
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
MetaLoRaS: a predictable metascheduler for non-dedicated multiclusters
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
User-defined schedulers for real-time concurrent objects
Innovations in Systems and Software Engineering
| Hi-index | 0.01 |
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 refines 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.