A scalable time-sharing scheduling for partitionable distributed memory parallel machines
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 173-182 vol.2
- https://doi.org/10.1109/hicss.1995.375465
Abstract
We propose a new process scheduling queue system called the distributed queue tree (DQT) for a distributed memory, dynamically partitionable parallel machines. We assume that partitions can be nested dynamically and that a process in a partition can be preempted. The combination of dynamically nested partitioning and time-sharing scheduling may provide an interactive environment and higher processor utilization. The key idea of DQT is to distribute process scheduling queues to each partition. We propose a round-robin scheduling algorithm and several task allocation policies on DQT. The simulation results show that time-sharing with DQT results in better processor utilization than that available from batch scheduling in high-load situations.<>Keywords
This publication has 7 references indexed in Scilit:
- Super-threadingPublished by Association for Computing Machinery (ACM) ,1993
- Efficient processor allocation strategies for mesh-connected parallel computersJournal of Parallel and Distributed Computing, 1992
- A fast recognition-complete processor allocation strategy for hypercube computersIEEE Transactions on Computers, 1992
- A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected systemJournal of Parallel and Distributed Computing, 1991
- Subcube allocation and task migration in hypercube multiprocessorsIEEE Transactions on Computers, 1990
- Distributed hierarchical control for parallel processingComputer, 1990
- Buddy systemsCommunications of the ACM, 1977