Multitasking in multistage interconnection network machines

Chansu Yu, Chitaranjan Das

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

Abstract

Cubic and noncubic task allocation algorithms for multistage-interconnection-network (MIN)-based multiprocessors are presented. Conflicts in passage through the network and inability to partition the system effectively are the main bottlenecks in a MIN-based system. To solve both problems, a renaming scheme called bit reversal (BR) matching pattern is proposed. This matching pattern minimizes conflicts and partitions the system completely into subsystems. Simulation results that show the advantage of allocation algorithms using the proposed matching pattern in terms of system efficiency, delay, and task miss ratio are presented.

Original languageEnglish (US)
Title of host publicationProceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages30-37
Number of pages8
ISBN (Electronic)0818628650
DOIs
StatePublished - Jan 1 1992
Event12th International Conference on Distributed Computing Systems, ICDCS 1992 - Yokohama, Japan
Duration: Jun 9 1992Jun 12 1992

Publication series

NameProceedings - International Conference on Distributed Computing Systems
Volume1992-June

Conference

Conference12th International Conference on Distributed Computing Systems, ICDCS 1992
CountryJapan
CityYokohama
Period6/9/926/12/92

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Multitasking in multistage interconnection network machines'. Together they form a unique fingerprint.

Cite this