Operating systems: design and implementation
Operating systems: design and implementation
Computer algorithms: introduction to design and analysis (2nd ed.)
Computer algorithms: introduction to design and analysis (2nd ed.)
On allocating subcubes in a hypercube multiprocessor
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Journal of Parallel and Distributed Computing
IEEE Spectrum - Supercomputing
Japan: a competitive assessment
IEEE Spectrum - Supercomputing
IEEE Spectrum - Supercomputing
Space and time scheduling in multicomputers
Space and time scheduling in multicomputers
Journal of Parallel and Distributed Computing
ICS '90 Proceedings of the 4th international conference on Supercomputing
Communications of the ACM
Non-contiguous processor allocation algorithms for distributed memory multicomputers
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
A Top-Down Processor Allocation Scheme for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
Processor Scheduling and Allocation for 3D Torus Multicomputer Systems
IEEE Transactions on Parallel and Distributed Systems
Multitoroidal Interconnects For Tightly Coupled Supercomputers
IEEE Transactions on Parallel and Distributed Systems
An adaptive job scheduling scheme for mesh-connected multicomputers
The Journal of Supercomputing
Dynamic resource allocation of computer clusters with probabilistic workloads
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Task migration in all-port wormhole-routed 2D mesh multicomputers
Information Sciences: an International Journal
| Hi-index | 0.00 |
A new approach for dynamic job scheduling in mesh-connected multiprocessor systems, which supports a multiuser environment, is proposed in this paper. Our approach combines a submesh reservation policy with a priority-based scheduling policy to obtain high performance in terms of high throughput, high utilization, and low turn-around times for jobs. This high performance is achieved at the expense of scheduling jobs in a strictly fair, FCFS fashion; in fact, the algorithm is parameterized to allow trade-offs between performance and (short-term) FCFS fairness. The proposed scheduler can be used with any submesh allocation policy. A fast and efficient implementation of the proposed scheduler has also been presented. The performance of the proposed scheme has been compared with the FCFS policy, the only existing scheduling strategy for meshes, to demonstrate the effectiveness of the proposed approach. Simulation results indicate that our scheduling strategy outperforms the FCFS policy significantly. Specifically, our strategy significantly reduces the average waiting delay of jobs over the FCFS policy. The fast implementation of the proposed scheduler results in low allocation and deallocation time overhead, as well as low space overhead.