A processor architecture for horizon
Proceedings of the 1988 ACM/IEEE conference on Supercomputing
Warp: an integrated solution of high-speed parallel computing
Proceedings of the 1988 ACM/IEEE conference on Supercomputing
IEEE Transactions on Computers
An O(n log n) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube
Information Processing Letters
Horizons of parallel computation
Journal of Parallel and Distributed Computing
All-to-All Personalized Communication in a Wormhole-Routed Torus
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Job Scheduling in a Partitionable Mesh Using a Two-Dimensional Buddy System Partitioning Scheme
IEEE Transactions on Parallel and Distributed Systems
On Job Scheduling on a Hypercube
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.98 |
In this paper, we investigate the problem of how to schedule n independent jobs on an m x m torus based network. We develop a model to to quantify the effect of contention for communication links on the dilation of job execution time when multiple jobs share communication links; we then design an efficient algorithm to schedule a set of n independent jobs with different torus size requirements on a given torus with an objective to minimize the total schedule length. We also develop a feasibility algorithm for pre-emptively scheduling a given set of jobs on a torus of given size with a given deadline. We provide analysis for both the algorithms.