Increasing the Size of a Network by a Constant Factor can Increase Performance by More Than a Constant Factor

DOI10.1137/0221048MaRDI QIDQ4015969zbMATH OpenOpenAlexFDO

Authors

Publication date 6 December 1992

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0221048

zbMATH Keywords

difference equationsinterconnection networksparallel computer architecture

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• A theory of wormhole routing in parallel computers
• Simple Algorithms for Routing on Butterfly Networks with Bounded Queues
• Analysis of the delta network with shared buffers under nonuniform load
• Sharper analysis of packet routing on a butterfly
• Concurrent threads and optimal parallel minimum spanning trees algorithm

Cited in

(1)

• Bi-genic Hopf algebras in characteristic \(p\)

This page was built for publication: Increasing the Size of a Network by a Constant Factor can Increase Performance by More Than a Constant Factor

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