Representing shared data on distributed-memory parallel computers

DOI10.1007/BF01305311zbMath0840.68030OpenAlexW2313536325MaRDI QIDQ4866678

Kieran T. Herley

Publication date: 27 June 1996

Published in: Mathematical Systems Theory (Search for Journal in Brave)

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

zbMATH Keywords

distributed-memory parallel computer

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Data structures (68P05) Computer system organization (68M99)

Related Items (4)

A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES ⋮ The complexity of deterministic PRAM simulation on distributed memory machines ⋮ DETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINES ⋮ Implementing shared memory on mesh-connected computers and on the fat-tree

Cites Work

• Unnamed Item
• Unnamed Item
• The generalized packet routing problem
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• How to emulate shared memory
• A new scheme for the deterministic simulation of PRAMs in VLSI
• Sorting in \(c \log n\) parallel steps
• A probabilistic simulation of PRAMs on a bounded degree network
• A note on the token distribution problem
• Tight Bounds on the Complexity of Parallel Sorting
• Efficient Simulations among Several Models of Parallel Computers
• Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
• How to share memory in a distributed system
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
• Parallel hashing
• The Token Distribution Problem
• New lower bound techniques for VLSI
• Optimal Sorting Algorithms for Parallel Computers
• Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks

This page was built for publication: Representing shared data on distributed-memory parallel computers