The following pages link to How to emulate shared memory (Q808683):
Displaying 22 items.
- Simulation of PRAMs with scan primitives by unbounded fan-in circuits (Q293467) (← links)
- Fast rehashing in PRAM emulations (Q672145) (← links)
- Practical constructive schemes for deterministic shared-memory access (Q675852) (← links)
- Deterministic P-RAM simulation with constant redundancy (Q756419) (← links)
- How to emulate shared memory (Q808683) (← links)
- Store-and-forward multicast routing on the mesh (Q927394) (← links)
- Efficient delay routing (Q1128715) (← links)
- Oblivious routing with limited buffer capacity (Q1176105) (← links)
- Efficient parallel algorithms can be made robust (Q1189859) (← links)
- A data parallel finite element method for computational fluid dynamics on the Connection Machine system (Q1205078) (← links)
- Clocked adversaries for hashing (Q1209734) (← links)
- Simulating the CRCW PRAM on reconfigurable networks (Q1275082) (← links)
- Locality-preserving hash functions for general purpose parallel computation (Q1333434) (← links)
- A note on implementing combining networks (Q1350360) (← links)
- Simulating shared memory in real time: On the computation power of reconfigurable architectures (Q1369096) (← links)
- Deadlock prevention by acyclic orientations (Q1399106) (← links)
- Efficient PRAM simulation on a distributed memory machine (Q1923863) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- Optimal cover time for a graph-based coupon collector process (Q2434930) (← links)
- Fast algorithms for bit-serial routing on a hypercube (Q3357513) (← links)
- Routing multiple paths in hypercubes (Q3358210) (← links)
- Parallel Weighted Random Sampling (Q5075804) (← links)
