Scalability of algorithms: An analytic approach

DOI10.1016/0167-8191(94)00113-OMaRDI QIDQ673022zbMATH OpenOpenAlexFDO

Authors Dieter Müller-Wichards, Wolfgang Rönsch

Publication date 28 February 1997

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(94)00113-o

zbMATH Keywords

Amdahl's lawCommunication overheadMultiprocessorsRevised Amdahl's lawScalability of parallel algorithmsTiming model

Mathematics Subject Classification ID

Distributed algorithms (68W15) Computer system organization (68M99)

Recommendations

• Scalability versus execution time in scalable systems
• scientific article; zbMATH DE number 1859705
• A study of average-case speedup and scalability of parallel computations on static networks
• Some aspects about the scalability of scientific applications on parallel architectures

Cited in

(10)

• On the scalability of PSRS algorithm
• Scalable Algorithms for Data and Network Analysis
• Algorithm-system scalability of heterogeneous computing
• A study of average-case speedup and scalability of parallel computations on static networks
• A note on scaling the Linpack benchmark
• Scalability analysis of large codes using factorial designs
• Average-case analysis of isospeed scalability of parallel computations on multiprocessors
• scientific article; zbMATH DE number 1859705 (Why is no real title available?)
• Scalability versus execution time in scalable systems
• Metrics for evaluation of parallel efficiency toward highly parallel processing

This page was built for publication: Scalability of algorithms: An analytic approach

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