Sharpness, a tight condition for throughput scalability

DOI10.1145/1281100.1281165MaRDI QIDQ5401453zbMATH OpenOpenAlexFDO

Authors Augustin Chaintreau

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1281100.1281165

zbMATH Keywords

scalabilitylast-passage percolationlattice animalsuniform recurrence equations

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Sharpness: A Tight Condition for Scalability
• Throughput scalability analysis of fork-join queueing networks
• scientific article; zbMATH DE number 1859705
• Algorithm-system scalability of heterogeneous computing
• A study of average-case speedup and scalability of parallel computations on static networks

Cited in

(1)

• Sharpness: A Tight Condition for Scalability

This page was built for publication: Sharpness, a tight condition for throughput scalability

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