A parallel algorithm for finding the maximum value

DOI10.1016/0167-8191(89)90081-1MaRDI QIDQ1121004zbMATH OpenOpenAlexFDO

Authors Susumu Horiguchi, Willard L. Miranker

Publication date 1989

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(89)90081-1

zbMATH Keywords

cube connection arrayexecution time investigationfinding the maximum valueinterconnection networkslinear arraysmesh arrayparallel algorithmthree-dimensional mesh array

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Theory of operating systems (68N25) Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 559227
• scientific article; zbMATH DE number 2134687
• Finding the maximum subsequence sum on interconnection networks
• Efficient parallel k selection algorithm
• An optimal parallel algorithm for solving the maximal elements problem in the plane

Cited in

(6)

• Maximum principle for the realization of the minimum computing time for parallel algorithms
• scientific article; zbMATH DE number 2134687 (Why is no real title available?)
• scientific article; zbMATH DE number 559227 (Why is no real title available?)
• scientific article; zbMATH DE number 1830922 (Why is no real title available?)
• Parallel minimax search for a maximum
• A fast maximum finding algorithm on broadcast communication

This page was built for publication: A parallel algorithm for finding the maximum value

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