Efficiency of universal parallel computers

DOI10.1007/BF00265559zbMath0489.68017OpenAlexW2007359222MaRDI QIDQ1166920

Friedhelm Meyer auf der Heide

Publication date: 1983

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00265559

zbMATH Keywords

simulationparallel computationprocessorsfixed communication networktime-processor trade-off

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Related Items (5)

On recurrent and recursive interconnection patterns ⋮ Real-time emulations of bounded-degree networks ⋮ Time-optimal simulations of networks by universal parallel computers ⋮ Efficient and scalable universal circuits ⋮ New graph decompositions with applications to emulations

This page was built for publication: Efficiency of universal parallel computers