Optimal broadcast on parallel locality models

DOI10.1016/S1570-8667(03)00023-6zbMath1094.68032MaRDI QIDQ1827284

Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping, Ben H. H. Juurlink

Publication date: 6 August 2004

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

zbMATH Keywords

Parallel computingBSP modelLower boundsBroadcastH-PRAM

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

1-optimality of static BSP computations: Scheduling independent chains as a case study.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modeling parallel bandwidth: Local versus global restrictions
• Real-time emulations of bounded-degree networks
• A practical hierarchical model of parallel computation. I: The model
• A practical hierarchical model of parallel computation. II: Binary tree and FFT algorithms

This page was built for publication: Optimal broadcast on parallel locality models