An O[n^3/z^3] reduction procedure for determining the maximum degree of parallelism in parallel applications

DOI10.1007/3-540-44743-1_14MaRDI QIDQ4778632zbMATH OpenFDO

Authors I. V. Zotov, V. S. Titov

Publication date 18 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2127/21270150

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• scientific article; zbMATH DE number 1185605
• A parallel algorithm for finding the maximum value
• scientific article; zbMATH DE number 4114026
• scientific article; zbMATH DE number 279005
• Towards an Architecture-Independent Analysis of Parallel Algorithms

Cited in

(1)

• Task ordering and memory management problem for degree of parallelism estimation

This page was built for publication: An \(O[n^3/z^3]\) reduction procedure for determining the maximum degree of parallelism in parallel applications

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