Efficiency of universal parallel computers

DOI10.1007/BF00265559MaRDI QIDQ1166920zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(5)

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

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

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