Representing shared data on distributed-memory parallel computers

DOI10.1007/BF01305311MaRDI QIDQ4866678zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• How to share memory in a distributed system
• Parallel hashing
• scientific article; zbMATH DE number 512820
• Exploiting storage redundancy to speed up randomized shared memory simulations
• Practical constructive schemes for deterministic shared-memory access

Cites work

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

Cited in

(6)

• Implementing shared memory on mesh-connected computers and on the fat-tree
• A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES
• Toward a model for shared data abstraction with performance
• The ramifications of sharing in data structures
• Deterministic branch-and-bound on distributed memory machines
• The complexity of deterministic PRAM simulation on distributed memory machines

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

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