Time-optimal simulations of networks by universal parallel computers

DOI10.1007/BFB0028978MaRDI QIDQ5096148zbMATH OpenOpenAlexFDO

Authors Friedhelm Meyer auf der Heide, Rolf Wanka

Publication date 16 August 2022

Published in STACS 89 (Search for Journal in Brave)

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

zbMATH Keywords

butterfly networkcommunication graphinfinite networkparallel random access machineroot processor

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Efficient Simulations among Several Models of Parallel Computers
• scientific article; zbMATH DE number 4001488
• Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
• Optimally universal parallel computers
• Optimal tradeoffs between size and slowdown for universal parallel networks

Cites work

• A Permutation Network
• An Efficient General-Purpose Parallel Computer
• Efficiency of universal parallel computers
• Efficient Simulations among Several Models of Parallel Computers
• Infinite cube-connected cycles
• Parallel Processing with the Perfect Shuffle
• Sorting in \(c \log n\) parallel steps
• The Indirect Binary n-Cube Microprocessor Array
• VLSI Algorithms for the Connected Component Problem

Cited in

(5)

• Real-time emulations of bounded-degree networks
• Optimal tradeoffs between size and slowdown for universal parallel networks
• Efficient Simulations among Several Models of Parallel Computers
• Optimally universal parallel computers
• Self-simulation for the Passive Optical Star model

This page was built for publication: Time-optimal simulations of networks by universal parallel computers

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