The following pages link to Communication complexity of PRAMs (Q913504):
Displaying 18 items.
- A bridging model for multi-core computing (Q619912) (← links)
- The bulk-synchronous parallel random access machine (Q1128714) (← links)
- Analysis of an asynchronous PRAM algorithm (Q1183402) (← links)
- Trade-offs between communication and space (Q1201877) (← links)
- Minimizing the overhead for some tree-scheduling problems (Q1278303) (← links)
- Methods for message routing in parallel machines (Q1330418) (← links)
- Locality-preserving hash functions for general purpose parallel computation (Q1333434) (← links)
- Communication-processor tradeoffs in a limited resources PRAM (Q1849381) (← links)
- Scheduling tree dags on parallel architectures (Q1911467) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
- PRAM's towards realistic parallelism: BRAM's (Q5055910) (← links)
- Lower bounds to processor-time tradeoffs under bounded-speed message propagation (Q5057417) (← links)
- Trade-offs between communication throughput and parallel time (Q5906374) (← links)
- Some models for scheduling parallel programs with communication delays (Q5961603) (← links)
- Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol (Q6104339) (← links)
- Recursively divisible problems (Q6487438) (← links)
