Packet routing and PRAM emulation on star graphs and leveled networks

DOI10.1006/JPDC.1994.1015MaRDI QIDQ1325971zbMATH OpenOpenAlexFDO

Authors Michael A. Palis, Sanguthevar Rajasekaran

Publication date 22 June 1994

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://semanticscholar.org/paper/0b9654a55e05ddac4aa1adbcb1f505e5d7776ef3

zbMATH Keywords

interconnection networkPRAMstar graphparallel computationspermutation routingrandomized routing algorithm

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Recommendations

• Randomized Routing and Sorting on Fixed-Connection Networks
• scientific article; zbMATH DE number 4049037
• Packet Routing on grids of processors
• Optimal routing algorithms for mesh-connected processor arrays

Cited in

(3)

• Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
• A novel routing scheme on the star and pancake networks and its applications
• Optimal parallel routing in star graphs (extended abstract)

This page was built for publication: Packet routing and PRAM emulation on star graphs and leveled networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1325971)