On bufferless routing of variable length messages in leveled networks

Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram Ranade, Arnold L. Rosenberg, Eric J. Schwabe

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

We study the most general communication paradigm on a multiprocessor, wherein each processor has a distinct message (of possibly distinct lengths) for each other processor. We study this paradigm, which we call chatting, on multiprocessors that do not allow messages once dispatched ever to be delayed on their routes. By insisting on oblivious routes for messages, we convert the communication problem to a pure scheduling problem. We introduce the notion of a virtual chatting schedule, and we show how efficient chatting schedules can often be produced from efficient virtual chatting schedules. We present a number of strategies for producing efficient virtual chatting schedules on a variety of network topologies.

Original languageEnglish
Pages (from-to)714-729
Number of pages16
JournalIEEE Transactions on Computers
Volume45
Issue number6
DOIs
StatePublished - 1996

Keywords

  • All-to-all communication
  • High-level communication primitives
  • Interprocessor communication
  • Message scheduling
  • Processor networks
  • Routing algorithms

Fingerprint

Dive into the research topics of 'On bufferless routing of variable length messages in leveled networks'. Together they form a unique fingerprint.

Cite this