DocumentCode
2165256
Title
Subtorii allocation strategies for torus connected networks
Author
Gupta, Sandeep K S ; Srimani, Pradip K.
Author_Institution
Dept. of Comput. Sci., Colorado State Univ., Fort Collins, CO, USA
fYear
1997
fDate
10-12 Dec 1997
Firstpage
287
Lastpage
294
Abstract
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
Keywords
multiprocessor interconnection networks; processor scheduling; communication links; contention; job execution time; n independent jobs; subtorii allocation; torus connected networks; Algorithm design and analysis; Bandwidth; Computer science; Degradation; Multiprocessor interconnection networks; Network topology; Parallel processing; Partitioning algorithms; Processor scheduling; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Algorithms and Architectures for Parallel Processing, 1997. ICAPP 97., 1997 3rd International Conference on
Conference_Location
Melbourne, Vic.
Print_ISBN
0-7803-4229-1
Type
conf
DOI
10.1109/ICAPP.1997.651498
Filename
651498
Link To Document