Subtorii allocation strategies for torus connected networks

S. K.S. Gupta, P. K. Srimani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publication1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997
EditorsWanlei Zhou, Andrzej Goscinski, Michael Hobbs
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages287-294
Number of pages8
ISBN (Electronic)0780342291, 9780780342293
DOIs
StatePublished - 1997
Externally publishedYes
Event3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 - Melbourne, Australia
Duration: Dec 10 1997Dec 12 1997

Publication series

Name1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997

Conference

Conference3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997
Country/TerritoryAustralia
CityMelbourne
Period12/10/9712/12/97

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Signal Processing

Fingerprint

Dive into the research topics of 'Subtorii allocation strategies for torus connected networks'. Together they form a unique fingerprint.

Cite this