Simulating shared memory in real time: On the computation power of reconfigurable architectures
From MaRDI portal
Publication:1369096
DOI10.1006/inco.1997.2642zbMath0881.68011OpenAlexW2059799481MaRDI QIDQ1369096
Friedhelm Meyer auf der Heide, Volker Stemann, Artur Czumaj
Publication date: 13 January 1998
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1997.2642
Related Items (2)
Simulating shared memory in real time: On the computation power of reconfigurable architectures ⋮ Randomized registers and iterative algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to emulate shared memory
- Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model
- Applications of reconfigurable meshes to constant-time computations
- Universal classes of hash functions
- Methods for message routing in parallel machines
- Exploiting storage redundancy to speed up randomized shared memory simulations
- Simulating shared memory in real time: On the computation power of reconfigurable architectures
- The complexity of reconfiguring network models
- Efficient PRAM simulation on a distributed memory machine
- Fast parallel space allocation, estimation, and integer sorting
- Efficient Schemes for Parallel Communication
- How to share memory in a distributed system
- Parallel hashing
- Recursive Star-Tree Parallel Data Structure
- An Optical Simulation of Shared Memory
- Dynamic Perfect Hashing: Upper and Lower Bounds
- The Parallel Simplicity of Compaction and Chaining
- FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH
- Contention Resolution in Hashing Based Shared Memory Simulations
- On contention resolution protocols and associated probabilistic phenomena
This page was built for publication: Simulating shared memory in real time: On the computation power of reconfigurable architectures
