Performance analysis of circuit-switching interconnection networks with deterministic and adaptive routing

Performance Evaluation

Volumn 34, Issue 1, 1998, Pages 1-26

  Colajanni, M ^a   Ciciani, B ^b   Tucci, S ^a  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Approximate analytical model; Circuit switching routing; Message passing; Multicomputers

Indexed keywords

APPROXIMATION THEORY; COMPUTER AIDED NETWORK ANALYSIS; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; ELECTRIC NETWORK TOPOLOGY; MATHEMATICAL MODELS; PROBABILITY; ROUTERS; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

CIRCUIT-SWITCHING ROUTING; MESSAGE PASSING;

INTERCONNECTION NETWORKS;

EID: 0032164275     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-5316(98)00023-6     Document Type: Article

References (26)

1. V.S. Adve, M.K. Vernon, Performance analysis of mesh interconnection networks with deterministic routing, IEEE Trans. Parallel and Distributed Systems 5 (3) (1994) 225-246.
2. R.V. Boppana, S. Chalasani, A comparison of adaptive wormhole routing algorithms, in: Proc. 20th Annual Int. Symp. on Computer Architecture, San Diego, CA, May 1993, IEEE Computer Society Press, Sliver Spring, MD, pp. 351-360.
3. M.S. Chen, K.G. Shin, Adaptive fault-tolerant routing in hypercube multicomputers, IEEE Trans. Comput. 39 (12) (1990) 1406-1416.
4. A.A. Chien, J.H. Kim, Planar-adaptive routing: Low-cost adaptive networks for multiprocessors, J. ACM 42 (1) (1995) 91-123.
5. I. Chlamtac, A. Ganz, M. Kienzle, A performance model of a connection based hypercube interconnection system, in: G. Balbo, G. Serazzi (Eds.), Computer Performance Evaluation, Modelling Techniques and Tools, Proc. 5th Int. Conf. on Modelling Tech. and Tools for Comp. Perf. Eval., Turin, Italy, Elsevier, Amsterdam, February 1991, pp. 215-228.
6. B. Ciciani, D.M. Dias, P.S. Yu, Analysis of concurrency-coherency control protocols for transaction processing systems with regional locality, IEEE Trans. Software Engrg. 18 (10) (1992) 899-914.
7. M. Colajanni, B. Ciciani, S. Tucci, An analytical model for circuit-switching routing, Tech. Rep. RI-95.15, University of Rome - Tor Vergata, 1995 (http://www.ce.uniroma2.it/∼colajan/routing/RI-95.15.ps).
8. M. Colajanni, A. Dell'Arte, B. Ciciani, Communication switching techniques and link-conflict resolution strategies: A comparison analysis, J. Simulation Practice and Theory (1998).
9. W.J. Dally, Performance analysis of k-ary n-cube interconnection networks, IEEE Trans. Comput. 39 (6) (1990) 775-785.
10. N.J. Dimopoulos, D. Radvan, K.F. Li, Performance evaluation of the backtracking-to-the-origin-and-retry routing for hypercycle-based interconnection networks, in: Proc. IEEE Distributed Computing Systems Conf., Paris, June 1990, IEEE Computer Society Press, Sliver Spring, MD, pp. 278-284.
11. C.J. Glass, L.M. Ni, The turn model for adaptive routing, in: Proc. 19th Int. Symp. on Computer Architecture, Gold Cost, Australia, 1992, ACM, New York, pp. 278-287.
12. L. Gravano, G.D. Pifarré, P.E. Berman, J.L.C. Sanz, Adaptive deadlock-and livelock-free routing with all minimal paths in torus networks, IEEE Trans. Parallel and Distributed Systems 5 (12) (1994) 1233-1251.
13. D.C. Grunwald, D.A. Reed, Networks for parallel processors: Measurements and prognostications, in: Proc. 3rd Conf. on Hypercube Concurrent Computers and Applications, New York, 1988, pp. 610-619.
14. P.G. Harrison, N.M. Patel, The representation of multistage interconnection networks in queueing models of parallel systems, J. ACM 37 (4) (1990) 863-898.
15. P. Kermani, L. Kleinrock, Virtual cut-through: A new computer communication switching technique, Comput. Networks 3 (1979) 267-286.
16. J. Kim, C.R. Das, Hypercube communication delay with wormhole routing, IEEE Trans. Comput. 43 (7) (1994) 806-814.
17. L. Kleinrock, Queueing Systems, Wiley, New York, 1979.
18. C.A. Lamanna, W.H. Shaw, A performance study of the hypercube parallel processor architecture, Simulation 53 (3) (1991) 185-196.
19. D. Linder, J.C. Harden, An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes, IEEE Trans. Comput. 40 (1) (1991) 2-12.
20. I. Mitrani, Simulation Techniques for Discrete Event Systems, Cambridge University Press, Cambridge, 1982.
21. J. Peterson, E. Chow, H. Madan, A high-speed message-driven communication architecture, in: Proc. Int. Conf. on Supercomputing, St. Malo, France, July 1988, ACM, New York.
22. S. Romany, D. Eager, The interaction between virtual channel flow control and adaptive routing in wormhole networks, in: Proc. Int. Conf. on Supercomputing, Manchester, UK, July 1994, ACM, New York, pp. 136-145.
23. D.A. Reed, R.M. Fujimoto, Multicomputer Networks: Message-based Parallel Processing, Scientific Computation Series, MIT Press, Cambridge, MA, 1987.
24. K.S. Trivedi, Probability and Statistics with Reliability, Queueing and Computer Science Applications, Prentice-Hall, Englewood cliffs, NJ, 1982.
25. R.J. Vetter, D.H.C. Du, Distributed computing with high-speed optical networks, IEEE Comput. 26 (2) (1993) 8-18.
26. C.-L. Wu, M. Lee, Performance analysis of multistage interconnection network configurations and operations, IEEE Trans. Comput. 41 (1) (1992) 18-26.