A parallel algorithm for finding the maximum value

doi:10.1016/0167-8191(89)90081-1

Parallel Computing

Volume 10, Issue 1, March 1989, Pages 101-108

https://doi.org/10.1016/0167-8191(89)90081-1 Get rights and content

Abstract

A new parallel algorithm for finding the maximum value of a data set is proposed. Execution times are investigated by taking into account the effect of the overhead time of communication for four kinds of interconnection networks; cube connection array, linear array, mesh array, and three-dimensional mesh array. The optimal numbers of processors are derived in the case where the number of processors is less than the number of data. Those are $O (N^{12}), O (N^{23}), O (N^{34}), and O (N)$ , respectively, for linear array, mesh array, three-dimensional mesh array, and cube-connected arrays.

References (9)

M Blum et al.
Time bounds for selection
J. Comput. System Sci.
(1973)
Y Shiloach et al.
Finding the maximum, merging, and sorting in a parallel computation model
J. Algorithms
(1981)
G.H Barnes et al.
The ILLIAC-IV computer
IEEE Trans. Comput.
(1968)
P.M Flander et al.
Efficient high speed computing with distributed array processor

There are more references available in the full text version of this article.

Cited by (4)

A constant time algorithm for finding maxima on reconfigurable bus systems using fewer processors
1993, Microprocessors and Microsystems
Downloading node programs/data into hypercubes
1991, Parallel Computing
In a multiprocessor environment, I/O (loading/unloading of node's or processor's program/data) time has significant impact on the overall execution time of a program. To minimize the I/O time one has to carefully route the data across the interconnecting network. In this paper different data loading strategies are discussed for hypercube multiprocessors with a host processor. A new loading strategy is proposed in which both the host and nodes are kept busy simultaneously. The effectiveness of this strategy is demonstrated by comparing with the existing methods using maximum finding and sorting algorithms.
Parallel Quasi-Concave Set Function Optimization for Scalability Even Without Submodularity
2023, 2023 IEEE High Performance Extreme Computing Conference, HPEC 2023
Parallel quasi-concave set optimization: A new frontier that scales without needing submodularity
2021, arXiv

^∗: Work performed while on leave from Tohoku University, Sendai 980, Japan.

View full text

A parallel algorithm for finding the maximum value

Abstract

J. Comput. System Sci.

J. Algorithms

The ILLIAC-IV computer

IEEE Trans. Comput.

Efficient high speed computing with distributed array processor