MODELS AND RESOURCE METRICS FOR PARALLEL AND DISTRIBUTED COMPUTATION∗
From MaRDI portal
Publication:4820143
DOI10.1080/10637199608915543zbMATH Open1049.68943OpenAlexW2106568002MaRDI QIDQ4820143FDOQ4820143
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
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The uniform memory hierarchy model of computation
- Parallelism in random access machines
- Designing broadcasting algorithms in the postal model for message-passing systems
- Tight Bounds on the Complexity of Parallel Sorting
- Algorithms for parallel memory. II: Hierarchical multilevel memories
- The expected advantage of asynchrony
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)
