Abstract
Long and unpredictable interconnection network delay can be the performance bottleneck of multicomputers with thousands of processing elements. Scheduling techniques based on virtual channels can be applied to provide the ability to deliver guaranteed communication bandwidth to classes of time-critical messages. This paper describes and evaluates a virtual channel flow control algorithm, which can meet lowlatency transmission time and high network utilization requirements. Uniform and non-uniform traffic cases are studied. Performance evaluations under various virtual channel partitionings and network loads show that appropriate allocation of the communication bandwidth can significantly improve the network delay while efficiently using the buffer resources.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Athas W. C. and Seitz C. L., Multicomputers: Message-Passing Concurrent Computers, IEEE Computer, Vol. 21, No. 8, pp. 9–24, August 1988
Chittor S. and Enbody R., Performance Degradation in Large Wormhole-Routed Interprocessor Communication Networks.Proc. of Int. Conf. on Parallel Processing, 1990, pp. I.424–I.428.
Dally W. J. and Seitz C. L., Deadlock-Free Message Routing in Multiprocessor Interconnection Network, IEEE Transactions on Computers, Vol. C-36, No. 5, pp. 547–553, May 1987
Dally W. J., Virtual Channel Flow Control, Proc. 17th Int. Symp. on Computer Architecture, 1990, pp. 60–68.
Dally W. J., Performance Analysis of k-ary n-cube Interconnection Networks, IEEE Transactions on Computers, Vol. 39, No. 6, pp. 775–785, June 1992
Dally W. J. and Aoki H., Deadlock-Free Adaptive Routing In Multicomputer Networks using Virtual Channels IEEE Transactions on Parallel and Distributed Systems, 1992
Duato J., On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Design Methodologies, Proc. Parallel Architectures and Languages Europe, 1991
Duato J., Improving the Efficiency of Virtual Channels with Time-Dependent Selection Functions, Proc. Parallel Architectures and Languages Europe, 1992
Kermani P. and Kleinrock L., Virtual Cut-Through: A New Computer Communication Switching Technique, Computer Networks, Vol. 3, 1979, pp. 267–268.
Liu Z., Duato J. and Thorelli L.-E., Grouping Virtual Channels for Deadlock-Free Adaptive Wormhole Routing, Proc. Parallel Architectures and Languages Europe, 1993
Reed D. A. and Fujimoto R. M., Multicomputer Networks: Message-Based Parallel Processing, The MIT Press, 1987.
Seitz C. L., VLSI and Parallel Computation, Chap. 1, Concurrent Architectures, Morgan Kaufmann Publisher, Inc., 1990
Shin K. G., HARTS: A Distributed Real-Time Architecture, IEEE Computer, May, 91, pp. 25–35.
Smai A-H. and Wu H., Evaluation of a Priority Flow Control Scheme for Multicomputer Networks, Euromicro Workshop on Parallelel and Distributed Processing, 1994, pp.111–116
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smai, AH., Thorelli, LE. (1994). Dynamic allocation of communication bandwidth in multicomputers. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds) PARLE'94 Parallel Architectures and Languages Europe. PARLE 1994. Lecture Notes in Computer Science, vol 817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58184-7_140
Download citation
DOI: https://doi.org/10.1007/3-540-58184-7_140
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58184-0
Online ISBN: 978-3-540-48477-6
eBook Packages: Springer Book Archive