An Integrated Processor Management Scheme for the Mesh-Connected Multicomputer Systems
ICPP '97 Proceedings of the international Conference on Parallel Processing
Scheduling Jobs on Parallel Systems Using a Relaxed Backfill Strategy
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Largest-job-first-scan-all scheduling policy for 2D mesh-connected systems
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Utilization and Predictability in Scheduling the IBM SP2 with Backfilling
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
A dynamic processor management strategy on the reconfigurable meshes
International Journal of High Performance Computing and Networking
Backfilling with guarantees granted upon job submission
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Parallel job scheduling — a status report
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
| Hi-index | 0.00 |
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.