Information Transfer in Distributed Computing with Applications to VLSI

DOI10.1145/2422.322421zbMath0625.68030OpenAlexW2071931508MaRDI QIDQ3028340

V. K. Prasanna Kumar, Joseph F. Ja'Ja'

Publication date: 1984

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2422.322421

zbMATH Keywords

lower boundsVLSIdistributed computinginformation transferarea-time complexityamount of interprocessor communicationchip complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Area-time lower-bound techniques with applications to sorting ⋮ Lower bounds on communication complexity ⋮ Communication complexity of PRAMs ⋮ Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays ⋮ The communication complexity of several problems in matrix computation ⋮ Probabilistic communication complexity ⋮ Semelectivity is not sufficient