On the scalability of PSRS algorithm

DOI10.1007/BF02900868MaRDI QIDQ4229558zbMATH OpenOpenAlexFDO

Authors Naijie Gu, Guoliang Chen

Publication date 22 February 1999

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02900868

zbMATH Keywords

iso-efficiency functionsorting algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• On the convergence of the parallel multisplitting PSD algorithm
• scientific article; zbMATH DE number 1110507
• Scalability of algorithms: An analytic approach
• Recent progress on scaling algorithms and applications
• The scalability analysis of a parallel tree search algorithm
• The scalability analysis of a parallel tree search algorithm
• scientific article; zbMATH DE number 1538873
• scientific article; zbMATH DE number 5039783
• The RSCG algorithm on distributed memory architectures
• On the extended iterative proportional scaling algorithm

Cites work

• Efficient algorithms for parallel sorting on mesh multicomputers
• On the scalability of PSRS algorithm
• Parallel depth first search. II: Analysis
• Parallel sorting by regular sampling

Cited in

(3)

• Efficient algorithms for parallel sorting on mesh multicomputers
• PSBS: Practical Size-Based Scheduling
• On the scalability of PSRS algorithm

This page was built for publication: On the scalability of PSRS algorithm

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