A constant time algorithm for finding maxima on reconfigurable bus systems using fewer processors

This paper presents a constant time algorithm for finding themaximum of N data items on a processor array with a reconfigurable bus system. It employs a divide and conquer strategy and requires only N3/2 processors, whereas the previous algorithm by Miller et al. requires N2 processors.

[1]  David Peleg,et al.  Square Meshes are not always Optimal , 1991, IEEE Trans. Computers.

[2]  Massimo Maresca,et al.  Polymorphic-Torus Network , 1989, IEEE Trans. Computers.

[3]  Steven P. Levitan,et al.  Algorithms for a Broadcast Protocol Multiprocessor , 1982, IEEE International Conference on Distributed Computing Systems.

[4]  Gen-Huey Chen,et al.  Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems , 1990, IEEE Trans. Parallel Distributed Syst..

[5]  Dionysios I. Reisis,et al.  Image computations on reconfigurable VLSI arrays , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[6]  Shahid H. Bokhari,et al.  Finding Maximum on an Array Processor with a Global Bus , 1984, IEEE Transactions on Computers.

[7]  Susumu Horiguchi,et al.  A parallel algorithm for finding the maximum value , 1989, Parallel Comput..

[8]  Jerome Rothstein.  Bus automata, brains, and mental models , 1988, IEEE Trans. Syst. Man Cybern..

[9]  Quentin F. Stout,et al.  Mesh-Connected Computers with Broadcasting , 1983, IEEE Transactions on Computers.