Implementing shared memory on mesh-connected computers and on the fat-tree

DOI10.1006/inco.2000.3006zbMath1003.68048OpenAlexW2073363224MaRDI QIDQ1854415

Andrea Pietracaprina, Kieran T. Herley, Geppino Pucci

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a74d5f0607cb71c0ebdb19b6de6f0de1780dcd04

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Store-and-forward multicast routing on the mesh ⋮ A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES

Cites Work

• Unnamed Item
• The complexity of deterministic PRAM simulation on distributed memory machines
• A framework for solving VLSI graph layout problems
• How to share memory in a distributed system
• Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
• Parallel hashing
• Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks
• Deterministic on-line routing on area-universal networks
• Improved deterministic PRAM simulation on the mesh
• Representing shared data on distributed-memory parallel computers

This page was built for publication: Implementing shared memory on mesh-connected computers and on the fat-tree