Abstract
In this paper, we propose a Barrier Tree for Irregular Networks (BTIN) and a barrier synchronization scheme using BTIN for switch-based cluster systems. The synchronization latency of the proposed BTIN scheme is asymptotically O(log n) while that of the fastest scheme reported in the literature is bounded by O(n), where n is the number of member nodes. Extensive simulation study shows that, for the group size of 256, the BTIN scheme improves the synchronization latency by a factor of 3.3 ~ 3.8, and is more scalable than conventional schemes with less network traffic.
Nodes, in this paper, actually mean PCs or workstations in a cluster system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. D. Schroeder, et.al., “Autonet: a High-speed, Self-configuring Local Area Network Using Point-to-point Links,” SRC Research Report, No.59, Digital Equipment Corporation, April 1990.
A. M. Mainwaring, B. N. Chun, S. Schleimer, and D. S. Wilkerson, “System Area Network Mapping,” Proceedings of the Annual Symposium on Parallel Algorithms and Architectures, 1997.
N. Boden, et.al., “Myrinet: A Gigabit-per-Second Local Area Network,” IEEE Micro, Vol. 15 No. 1, pp. 29–36, February 1995.
R. Buyya, High Performance Cluster Computing: Architectures and Systems, Prentice-Hall Inc., NJ, 1999.
G. F. Pfister, In Search of Clusters, 2nd Edition, Chapter 5, Prentice-Hall, Inc., NJ, 1998.
V. Ramakrishnan, I. D. Scherson, and R. Subramanian, “Efficient Techniques for Nested and Disjoint Barrier Synchronization,” Journal of Parallel and Distributed Computing, Vol. 58, pp. 333–356, Aug, 1999.
R. Kesavan, K. Bondalapati, and D. K. Panda, “Multicast on Irregular Switch-Based Networks with Wormhole Routing,” Proceedings of the 3rd International Symposium on High-Performance Computer Architecture, pp. 48–57, Feb. 1-5, 1997.
R. Libeskind-Hadas, D. Mazzoni, and R. Rajagopalan, “Tree-Based Multicasting in Wormhole-Routed Irregular Topologies,” Proceedings of the International Parallel Processing Symposium, pp. 244–249, Mar. 30-Apr. 3, 1998.
M. Gerla, P. Palnati, and S. Walton, “Multicasting Protocols for High-Speed, Wormhole-Routing Local Area Networks,” Proceedings of the International Conference on Applications, Techniques, Architectures, and Protocols for Computer Communication, pp. 184–193, Aug. 28-30, 1996.
L. Ni and P. K. McKinley, “A Survey of Wormhole Routing Techniques in Direct Networks,” IEEE Computer, Vol. 23, No. 2, pp. 62–76, Feb. 1993.
R. Sivaram, R. Kesavan, D. K. Panda, and C. B. Stunkel, “Where to Provide Support for Efficient Multicasting in Irregular Networks: Network Interface or Switch?,” Proceedings of the International Conference on Parallel Processing, pp. 452–459, Aug. 10-14, 1998.
S. Moh, C. Yu, H. Y. Youn, D. Han, B. Lee, and D. Lee, “A Fast Tree-Based Barrier Synchronization on Switch-Based Irregular Networks,” Technical Report, School of Engineering, Information and Communications University, July 2000.
S. Warnakulasuriya and T. M. Pinkston, “Characterization of Deadlocks in Irregular Networks,” Proceedings of the International Conference on Parallel Processing, pp. 75–84, Sep. 21-24, 1999.
P. Pacheco, Parallel Programming with MPI, Morgan Kaufmann, San Francisco, CA, 1997.
A. A. Chien, “A Cost and Speed Model for k-ary n-Cube Wormhole Routers,” IEEE Transactions on Parallel and Distributed Systems, Vol. 9, No. 2, pp. 150–162, Feb. 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moh, S., Yu, C., Youn, H.Y., Han, D., Lee, B., Lee, D. (2000). A Fast Tree-Based Barrier Synchronization on Switch-Based Irregular Networks. In: Valero, M., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2000. HiPC 2000. Lecture Notes in Computer Science, vol 1970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44467-X_24
Download citation
DOI: https://doi.org/10.1007/3-540-44467-X_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41429-2
Online ISBN: 978-3-540-44467-1
eBook Packages: Springer Book Archive