On scheduling send-graphs and receive-graphs under the LogP-model

DOI10.1016/S0020-0190(01)00257-5zbMath1013.68294OpenAlexW2023043295MaRDI QIDQ1603551

Wolf Zimmermann, Welf M. Löwe, Denis Trystram

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00257-5

zbMATH Keywords

algorithmsparallel processing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: On scheduling send-graphs and receive-graphs under the LogP-model