In this paper we investigate the problem of how to schedule n independent jobs on an m×m torus based network. We develop a model to quantify the effect of contention for communication links on the dilation of job execution time when multiple jobs share communication links
Published in:
Algorithms and Architectures for Parallel Processing, 1997. ICAPP 97., 1997 3rd International Conference on
Date of Conference: 10-12 Dec 1997