Abstract
Most parallel computations require the exchange of data between processing elements. One of important basic communication operations is all-reduce, a variation of the reduction operation. This paper presents an all-reduce communication operation scheme using all-to-all broadcast communication pattern. All-to-all broadcast is the operation in which each processor sends its message to all other processors, and receives messages from all other processors in the system. In this paper, we develop an efficient all-reduce operation scheme in a star network topology with the single-port communication capability. Communication time is compared against known broadcasting schemes to verify the efficiency of the suggested scheme.
Chapter PDF
Similar content being viewed by others
Keywords
References
Akers, S.B., Harel, D., Krishnamurthy, B.: The Star Graph: An Attractive Alternative to The n-cube. In: Proc. Int’l. Conf. of Parallel Processing, pp. 393–400 (1987)
Akers, S.B., Krishnamurthy, B.: The Fault Tolerance of Star Graphs. In: Proc. 2nd Int’l. Conf. on Supercomputing, pp. 270–276 (1987)
Akl, S.G., Qiu, K., Stojmenovic, I.: Fundamental Algorithms for The Star and Pancake Interconnection Networks With Applications to Computational Geometry. Networks 23(4), 215–225 (1993)
Chen, M.-S., Yu, P.S., Wu, K.-L.: Optimal NODUP All-to-All Broadcast Schemes in Distributed Computing Systems. IEEE Trans. Parallel and Distributed Systems, 1275–1284 (1994)
Efe, K., Fernandez, A.: Computational Properties of Mesh Connected Trees: Versatile Architecture for Parallel Computation. In: Int’l Conference on Parallel Processing, pp. 72–76 (1994)
Intel Corp. iPSC/2 User’s Guide, Intel Corp. (March 1988)
Mkwawa, I.M., Kouvatsos, D.D.: An Optimal Neighbourhood Broadcasting Scheme for Star Interconnection Networks. J. Interconnection Networks 4, 103–112 (2004)
Oh, E., Chen, J.: Strong Fault-Tolerance: Parallel Routing in Star Networks with Faults. J. Interconnection Networks 4, 113–126 (2003)
Rabenseifner, R., Adamidis, P.: Collective Reduction Operation on Cray X1 and Other Platforms. In: Proc. the Cray User Group (2004)
Sheu, J.-P., Wu, C.-T., Chen, T.-S.: An Optimal Broadcasting Algorithm Without Message Redundancy in Star Graphs. IEEE Trans. Parallel and Distributed Systems 6(6), 653–658 (1995)
Tseng, Y.-C., Sheu, J.-P.: Toward Optimal Broadcast in A Star Graph Using Multiple Spanning Trees. IEEE Trans. Computers 46, 593–599 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oh, E., Choi, H., Primeaux, D. (2005). An All-Reduce Operation in Star Networks Using All-to-All Broadcast Communication Pattern. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds) Computational Science – ICCS 2005. ICCS 2005. Lecture Notes in Computer Science, vol 3514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11428831_52
Download citation
DOI: https://doi.org/10.1007/11428831_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26032-5
Online ISBN: 978-3-540-32111-8
eBook Packages: Computer ScienceComputer Science (R0)