Scalability analysis of large codes using factorial designs

DOI10.1016/S0167-8191(01)00068-0MaRDI QIDQ5941360zbMATH OpenOpenAlexWikidataFDO

Authors M. Alabdulkareem, S. Lakshmivarahan, Sudarshan Dhall

Publication date 20 August 2001

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(01)00068-0

zbMATH Keywords

parallel algorithm-architecturescalability of a large code

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Scalability versus execution time in scalable systems
• Some aspects about the scalability of scientific applications on parallel architectures
• Scalability of algorithms: An analytic approach
• The scalability analysis of a parallel tree search algorithm
• scientific article; zbMATH DE number 1260669

Cited in

(2)

• Some aspects about the scalability of scientific applications on parallel architectures
• Scalability versus execution time in scalable systems

This page was built for publication: Scalability analysis of large codes using factorial designs

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