Locality, Communication, and Interconnect Length in Multicomputers

DOI10.1137/0217042MaRDI QIDQ3806815zbMATH OpenOpenAlexFDO

Authors Paul M. B. Vitányi

Publication date 1988

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

Full work available at URL https://ir.cwi.nl/pub/6088

zbMATH Keywords

communicationcomplexity of computationedge-symmetric graphembeddings of graphsmulticomputersnonsequential computationwire length

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 4051664
• scientific article; zbMATH DE number 140144
• On embedding rectangular grids in hypercubes
• Efficient Embeddings of Trees in Hypercubes
• Special Issue: Node-to-Node Distances in Regulard-Neighbours Topologies

Cited in

(6)

• Adaptive and fault-tolerant routing algorithms for high performance 2D torus interconnection network
• Data independence of read, write, and control structures in PRAM computations
• Spatial/kinematic domain and lattice computers
• PRAM's towards realistic parallelism: BRAM's
• Algorithmic arguments in physics of computation
• Parallel machine models: how they are and where are they going

This page was built for publication: Locality, Communication, and Interconnect Length in Multicomputers

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