Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
From MaRDI portal
Publication:3774930
DOI10.1137/0216053zbMath0635.68015OpenAlexW1994038072MaRDI QIDQ3774930
Helmut Alt, Kurt Mehlhorn, Torben Hagerup, Franco P. Preparata
Publication date: 1987
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0216053
Related Items (13)
Implementing shared memory on multi-dimensional meshes and on the fat-tree ⋮ Representing shared data on distributed-memory parallel computers ⋮ A new scheme for the deterministic simulation of PRAMs in VLSI ⋮ A complexity theory of efficient parallel algorithms ⋮ A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES ⋮ Practical constructive schemes for deterministic shared-memory access ⋮ Improved deterministic PRAM simulation on the mesh ⋮ The complexity of deterministic PRAM simulation on distributed memory machines ⋮ Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries ⋮ Towards a scalable and robust DHT ⋮ Deterministic P-RAM simulation with constant redundancy ⋮ Simulating the CRCW PRAM on reconfigurable networks ⋮ Implementing shared memory on mesh-connected computers and on the fat-tree
This page was built for publication: Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones