Abstract
In this paper, we propose a fast algorithm to solve the maximum finding problem under the broadcast communication model, such as an Ethernet. In our maximum finding algorithm, each processor holds one data element initially. The key point of our algorithm is to use broadcast conflicts to build broadcasting layers and then to distribute the data elements into those layers. Only those elements who are on the active layer and still alive can broadcast their values. Thus, the number of broadcast conflicts is reduced. Suppose that there are n input data elements and n available processors. We show that the average time complexity of our algorithm is Θ(log n), which is better than any previous result
This research work was partially supported by the National Science Council under contract NSC 84-2121-M-110-005 MS.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. I. Capetanakis, “Tree algorithms for packet broadcast channels,” IEEE Transactions on Information Theory, Vol. 25, No. 5, pp. 505–515, May 1979.
R. Dechter and L. Kleinrock, “Broadcast communications and distributed algorithms,” IEEE Transactions on Computers, Vol. 35, No. 3, pp. 210–219, Mar. 1986.
K. D. E., The Art of Computer Programming: Fundamental Algorithms, Vol. 1. Addison, Wesley Publish Company Inc., 1968.
J. H. Huang and L. Kleinrock, “Distributed selectsort sorting algorithm on broadcast communication,” Parallel Computing, Vol. 16, pp. 183–190, 1990.
S. Levitan, “Algorithms for broadcast protocol multiprocessor,” Proc. of 3rd International Conference on Distributed Computing Systems, pp. 666–671, 1982.
S. P. Levitan and C. C. Foster, “Finding an extremum in a network,” Proc. of 1982 International Symposium on Computer Architechure, pp. 321–325, 1982.
C. U. Martel, “Maximum finding on a multi access broadcast network,” Information Processing Letters, Vol. 52, pp. 7–13, 1994.
W. M. Moh, C. U. Martel, and T. S. Moh, “A dynamic solution to prioritized conflict resolution on a multiple access broadcast channel,” Proc. of 1993 International Conference on Parallel and Distributed Systems, pp. 414–418, 1993.
C. Y. Tang and M. J. Chiu, “Distributed sorting on the serially connected local area networks,” Proc. of 1989 Singapore International Conference on Networks, pp. 458–462, 1989.
D. E. Willard, “Log-logarithmic protocols for resolving ethernet and semaphore conflicts,” Proc. of 16th Annual ACM Symposium on Theory of Computing, pp. 512–521, 1984.
C. B. Yang, “Reducing conflict resolution time for solving graph problems in broadcast communications,” Information Processing Letters, Vol. 40, pp. 295–302, 1991.
C. B. Yang, R. C. T. Lee, and W. T. Chen, “Parallel graph algorithms based upon broadcast communications,” IEEE Transactions on Computers, Vol. 39, No. 12, pp. 1468–1472, Dec. 1990.
C. B. Yang, R. C. T. Lee, and W. T. Chen, “Conflict-free sorting algorithm broadcast under single-channel and multi-channel broadcast communication models,” Proc. of 1985 International Conference on Computing and Information, pp. 350–359, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shiau, SH., Yang, CB. (1995). A fast maximum finding algorithm on broadcast communication. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030868
Download citation
DOI: https://doi.org/10.1007/BFb0030868
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive