Pages that link to "Item:Q4311639"
From MaRDI portal
The following pages link to Designing broadcasting algorithms in the postal model for message-passing systems (Q4311639):
Displaying 19 items.
- Optimal broadcast for fully connected processor-node networks (Q436809) (← links)
- A framework for adaptive collective communications for heterogeneous hierarchical computing systems (Q941463) (← links)
- Broadcasting on networks of workstations (Q973010) (← links)
- Binary search with delayed and missing answers (Q1007537) (← links)
- An approximation algorithm and dynamic programming for reduction in heterogeneous environments (Q1024788) (← links)
- Minimizing broadcast costs under edge reductions in tree networks (Q1283789) (← links)
- Optimal point-to-point broadcast algorithms via lopsided trees (Q1296579) (← links)
- On searching strategies, parallel questions, and delayed answers (Q1765232) (← links)
- The broadcast median problem in heterogeneous postal model (Q1956241) (← links)
- Optimal multiple message broadcasting in telephone-like communication systems (Q1962017) (← links)
- Unified X-space parallelization algorithm for conserved discrete unified gas kinetic scheme (Q2701254) (← links)
- Scaling Structured Multigrid to 500K+ Cores Through Coarse-Grid Redistribution (Q3174783) (← links)
- Designing broadcasting algorithms in the postal model for message-passing systems (Q4311639) (← links)
- Multiple message broadcasting in the postal model (Q4345569) (← links)
- MODELS AND RESOURCE METRICS FOR PARALLEL AND DISTRIBUTED COMPUTATION∗ (Q4820143) (← links)
- AN ALGORITHMIC MODEL FOR HETEROGENEOUS HYPER-CLUSTERS: RATIONALE AND EXPERIENCE (Q5315922) (← links)
- Branch and bound on the network model (Q5941065) (← links)
- Broadcasting in weighted trees under the postal model (Q5964023) (← links)
- A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm (Q6082271) (← links)
