ANALYSIS OF MESSAGE SWITCHING WITH SHUFFLE-EXCHANGES IN MULTIPROCESSORS.

D. H. Lawrie, D. A. Padua

Research output: Contribution to conferencePaper

Abstract

A one-stage shuffle exchange network to be used as a processor-memory switch in a multiprocessor is described. The stochastic behavior of the network is studied under the assumption that any memory module is equally likely to be referenced. It is shown that under these assumptions the average number of passes through the network for an item of data to reach its destination can be made less than 2log//2N when N less than equivalent to 2**2**0 (N is the number of processors and memories). This can be achieved by using no more than four one-stage shuffle-exchange networks, each one consisting of N exchange elements.

Original languageEnglish (US)
Pages116-123
Number of pages8
StatePublished - Jan 1 2017
EventProc of the Workshop on Interconnect Networks for Parallel and Distrib Process - Lafeyette, IN, USA
Duration: Apr 21 1980Apr 22 1980

Conference

ConferenceProc of the Workshop on Interconnect Networks for Parallel and Distrib Process
CityLafeyette, IN, USA
Period4/21/804/22/80

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'ANALYSIS OF MESSAGE SWITCHING WITH SHUFFLE-EXCHANGES IN MULTIPROCESSORS.'. Together they form a unique fingerprint.

  • Cite this

    Lawrie, D. H., & Padua, D. A. (2017). ANALYSIS OF MESSAGE SWITCHING WITH SHUFFLE-EXCHANGES IN MULTIPROCESSORS.. 116-123. Paper presented at Proc of the Workshop on Interconnect Networks for Parallel and Distrib Process, Lafeyette, IN, USA, .