Locality, Communication, and Interconnect Length in Multicomputers

DOI10.1137/0217042zbMath0658.68052OpenAlexW2016388628MaRDI QIDQ3806815

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 computationmulticomputersedge-symmetric graphembeddings of graphswire lengthnonsequential computation

Mathematics Subject Classification ID

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

Related Items (5)

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

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