MODELS AND RESOURCE METRICS FOR PARALLEL AND DISTRIBUTED COMPUTATION∗

DOI10.1080/10637199608915543MaRDI QIDQ4820143zbMATH OpenOpenAlexFDO

Authors Zhi-Yong Li, Peter H. Mills, J. Reif

Publication date 6 October 2004

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10637199608915543

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 1003297 (Why is no real title available?)
• scientific article; zbMATH DE number 53687 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• Algorithms for parallel memory. II: Hierarchical multilevel memories
• Designing broadcasting algorithms in the postal model for message-passing systems
• Parallelism in random access machines
• The expected advantage of asynchrony
• The uniform memory hierarchy model of computation
• Tight Bounds on the Complexity of Parallel Sorting

This page was built for publication: MODELS AND RESOURCE METRICS FOR PARALLEL AND DISTRIBUTED COMPUTATION∗

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820143)