Pages that link to "Item:Q1185246"
From MaRDI portal
The following pages link to Processor-time tradeoffs in PRAM simulations (Q1185246):
Displaying 20 items.
- On the power of concurrent-write PRAMs with read-only memory (Q582089) (← links)
- Relating the power of the multiple associative computing (MASC) model to that of reconfigurable bus-based models (Q666096) (← links)
- Fast rehashing in PRAM emulations (Q672145) (← links)
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories (Q799371) (← links)
- Efficient simulation of circuits by EREW PRAMs (Q911771) (← links)
- Incomparability in parallel computation (Q919822) (← links)
- Simulations among concurrent-write PRAMs (Q1104097) (← links)
- Some considerations about NPRIORITY(1) without ROM (Q1113673) (← links)
- Simulating the CRCW PRAM on reconfigurable networks (Q1275082) (← links)
- Asynchronous PRAMs with memory latency (Q1345653) (← links)
- Multiprocessor simulation strategies with optimal speed-up (Q1349734) (← links)
- Processor-time tradeoffs under bounded-speed message propagation. I: Upper bounds (Q1384682) (← links)
- Optimal tradeoffs between size and slowdown for universal parallel networks (Q1384695) (← links)
- Removing Ramsey theory: Lower bounds with smaller domain size (Q1392014) (← links)
- Pointers versus arithmetic in PRAMs (Q1816730) (← links)
- Communication-processor tradeoffs in a limited resources PRAM (Q1849381) (← links)
- Time-memory-processor trade-offs (Q3796743) (← links)
- New simulations between CRCW PRAMs (Q3974857) (← links)
- ANALYSIS OF PRAM INSTRUCTION SETS FROM A LOG COST PERSPECTIVE (Q4853322) (← links)
- Lower bounds to processor-time tradeoffs under bounded-speed message propagation (Q5057417) (← links)
