Time-optimal simulations of networks by universal parallel computers

DOI10.1007/BFb0028978zbMath1492.68032OpenAlexW1555573027MaRDI QIDQ5096148

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

infinite networkbutterfly networkcommunication graphparallel 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)

Related Items (1)

Real-time emulations of bounded-degree networks

Cites Work

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

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