Abstract
Analytical models for adaptive routing in multicomputer inter-connection networks with the traditional non-bursty Poisson traffic have been widely reported in the literature. However, traffic loads generated by many real-world parallel applications may exhibit bursty and batch arrival properties, which can significantly affect network performance. This paper develops a new and concise analytical model for hypercubic networks in the presence of bursty and batch arrival traffic modelled by the Compound Poisson Process (CPP) with geometrically distributed batch sizes. The computation complexity of the model is independent of network size. The analytical results are validated through comparison to those obtained from the simulation experiments. The model is used to evaluate the effects of the bursty traffic with batch arrivals on the performance of interconnection networks.
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
Duato, J., Yalamanchili, S., Ni, L.: Interconnection Networks: An Engineering Approach, IEEE Computer Society Press, Silver Spring, MD (1997)
Duato, J.: A New Theory of Deadlock-Free Adaptive Routing in Wormhole Routing Networks. IEEE Trans. Parallel & Distributed Systems 4(12), 1320–1331 (1993)
Dally, W.J.: Virtual Channel Flow Control. IEEE Trans. Parallel and Distributed Systems 3(2), 194–205 (1992)
Dally, W.J., Towles, B.P.: Principles and Practices of Interconnection Network. Morgan Kaufmann, Seattle, Washington (2003)
Draper, J.T., Ghosh, J.: A Comprehensive Analytical Model for Wormhole Routing in Multicomputer Systems. Journal of Parallel & Distributed Computing 32(2), 202–214 (1994)
Dinda, P.A., Garcia, B., Leung, K.S.: The Measured Network Traffic of Compiler Parallelized Programs, pp. 175–184, IEEE Computer Society Press, Silver Spring, MD (2001)
Kim, J., Das, C.R.: Hypercube Communication Delay with Wormhole Routing, IEEE Trans. Computers 43(7), 806–814 (1994)
Kouvatsos, D.D.: Entropy Maximisation and Queueing Network Models. Annals of Operations Research 48(1), 63–126 (1994)
Kouvatsos, D.D., Awan, I.U.: Entropy Maximisation and Open Queueing Networks with Priorities and Blocking. Performance Evaluation 51(2-4), 191–227 (2003)
Kouvatsos, D.D., Assi, S., Ould-khaoua, M.: Performance Modelling of Wormhole- Routed Hypercubes with Bursty Traffic and Finite Buffers. Int. Journal of Simulation, Practics, Systems, Science & Technology 6(3-4), 69–81 (2005)
Kleinrock, L.: Queueing Systems, vol. 1. John Wiley, New York (1975)
Loucif, S., Ould-Khaoua, M., Mackenzie, L.M.: Modelling Fully-Adaptive Routing in Hypercubes. Telecommunication Systems 13(1), 111–118 (2000)
Min, G., Ould-Khaoua, M.: Message Latency in Hypercubic Computer Networks with the Bursty Traffic Pattern. Computers and Electrical Engineering 30(3), 207–222 (2004)
Min, G., Ould-Khaoua, M.: A Performance Model for Wormhole-Switched Interconnection Networks under Self-Similar Traffic. IEEE Trans. Computers 53(5), 601–613 (2004)
Ould-Khaoua, M., Sarbazi-Azad, H.: An Analytical Model of Adaptive Wormhole Routing in Hypercubes in the Presence of Hot Spot Traffic. IEEE Trans. Parallel and Distributed Systems 12(3), 283–292 (2001)
Ould-Khaoua, M.: A Performance Model for Duato’s Fully Adaptive Routing Algorithm in k-Ary n-Cubes. IEEE Trans. Computers 48(12), 1297–1304 (1999)
Silla, F., Malumbres, M.P., Duato, J., Dai, D., Panda, D.K.: Impact of Adaptivity on the Behavior of Networks of Workstations under Bursty Traffic, pp. 88–95, IEEE Computer Society Press, Silver Spring, MD (1998)
Wu, J.: Maximum Entropy Analysis of Open Queueing Networks with Group Arrivals. Journal of the Operational Research Society 43(11), 1063–1078 (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, Y., Min, G., Wang, L. (2007). Performance Analysis of Interconnection Networks Under Bursty and Batch Arrival Traffic. In: Jin, H., Rana, O.F., Pan, Y., Prasanna, V.K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2007. Lecture Notes in Computer Science, vol 4494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72905-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-72905-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72904-4
Online ISBN: 978-3-540-72905-1
eBook Packages: Computer ScienceComputer Science (R0)