Job Scheduling in Mesh Multicomputers
- 1 August 1994
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A new approach for dynamic job scheduling in mesh-connected multiprocessor system, which supports a multi-user environment, is proposed. The proposed job scheduler combines a priority-based scheduling policy with a submesh reservation policy to obtain high performance in terms of high throughput, high utilization and low turn-around times for jobs. The proposed scheduling strategy offers the flexibility of achieving high performance at the expense of short-term 'fairness' towards certain jobs. A fast and efficient implementation of the proposed scheduler has also been presented. Simulation results indicate that our scheduling strategy outperforms the FCFS policy significantly by reducing the average waiting delay significantly.Keywords
This publication has 7 references indexed in Scilit:
- An efficient submesh allocation strategy for mesh computer systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Processor allocation vs. job scheduling on hypercube computersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Job Scheduling in Mesh MulticomputersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected SystemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- A Lazy Scheduling Scheme for Improving Hypercube PerformancePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Efficient processor allocation strategies for mesh-connected parallel computersJournal of Parallel and Distributed Computing, 1992
- A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected systemJournal of Parallel and Distributed Computing, 1991