Designing broadcasting algorithms in the postal model for message-passing systems
From MaRDI portal
Publication:4311639
DOI10.1007/BF01184933zbMath0812.68079OpenAlexW3201199382WikidataQ60307049 ScholiaQ60307049MaRDI QIDQ4311639
Publication date: 14 May 1995
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01184933
Related Items (18)
Scaling Structured Multigrid to 500K+ Cores Through Coarse-Grid Redistribution ⋮ MODELS AND RESOURCE METRICS FOR PARALLEL AND DISTRIBUTED COMPUTATION∗ ⋮ AN ALGORITHMIC MODEL FOR HETEROGENEOUS HYPER-CLUSTERS: RATIONALE AND EXPERIENCE ⋮ Designing broadcasting algorithms in the postal model for message-passing systems ⋮ A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm ⋮ Optimal broadcast for fully connected processor-node networks ⋮ Unified X-space parallelization algorithm for conserved discrete unified gas kinetic scheme ⋮ The broadcast median problem in heterogeneous postal model ⋮ Optimal multiple message broadcasting in telephone-like communication systems ⋮ A framework for adaptive collective communications for heterogeneous hierarchical computing systems ⋮ On searching strategies, parallel questions, and delayed answers ⋮ Broadcasting on networks of workstations ⋮ Branch and bound on the network model ⋮ Broadcasting in weighted trees under the postal model ⋮ Binary search with delayed and missing answers ⋮ An approximation algorithm and dynamic programming for reduction in heterogeneous environments ⋮ Minimizing broadcast costs under edge reductions in tree networks ⋮ Optimal point-to-point broadcast algorithms via lopsided trees
Cites Work
This page was built for publication: Designing broadcasting algorithms in the postal model for message-passing systems