A parallel algorithm for finding the maximum value

DOI10.1016/0167-8191(89)90081-1zbMATH Open0673.68018OpenAlexW1999359343MaRDI QIDQ1121004FDOQ1121004

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

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

zbMATH Keywords

parallel algorithminterconnection networkslinear arrayscube connection arrayexecution time investigationfinding the maximum valuemesh arraythree-dimensional mesh array

Mathematics Subject Classification ID

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

Cited In (4)

• Title not available (Why is that?)
• Parallel minimax search for a maximum
• A fast maximum finding algorithm on broadcast communication
• Title not available (Why is that?)

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)