Scalability of algorithms: An analytic approach

DOI10.1016/0167-8191(94)00113-OzbMATH Open0875.68175OpenAlexW2050589308MaRDI QIDQ673022FDOQ673022

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (10)

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

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)