A sweep algorithm for massively parallel simulation of circuit-switched networks

Bruno Gaujal, Albert G. Greenberg, David M. Nicol

Research output: Contribution to journalArticle

Abstract

A new massively parallel algorithm is presented for simulating large asymmetric circuit-switched networks that are controlled by a randomized-routing policy that includes trunk-reservation. A single instruction multiple data implementation is described and corresponding experiments on a 16384 processor MasPar parallel computer are reported. A multiple instruction multiple data implementation is also described and corresponding experiments on an Intel IPSC/860 parallel computer, using 16 processors, are reported. By exploiting parallelism, our algorithm increases the possible execution rate of such complex simulations by as much as an order of magnitude.

Original languageEnglish (US)
Pages (from-to)484-500
Number of pages17
JournalJournal of Parallel and Distributed Computing
Volume18
Issue number4
DOIs
StatePublished - Aug 1993
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'A sweep algorithm for massively parallel simulation of circuit-switched networks'. Together they form a unique fingerprint.

  • Cite this