Subtorii allocation strategies for torus connected networks

Abstract

In this paper we investigate the problem of how to schedule n independent jobs on an m/spl times/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.