A simulation model for performance analysis of routing algorithms in concurrent systems under realistic load

The communication behavior of concurrent programs has great influence on the efficiency of a routing algorithm. Selection of a good routing algorithm for a particular application or network constraint requires performance analysis under realistic load. We have proposed a simulator model for the study and analysis of the various routing policies in concurrent systems. In this paper a timed Petri net model for representing concurrent programs and its probabilistic approximation are presented. The development considerations and operation methodology of the proposed event-driven simulator are presented.

[1]  Sandhya Dwarkadas,et al.  Efficient Simulation of Parallel Computer Systems , 1991, Int. J. Comput. Simul..

[2]  M. Diaz,et al.  Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..

[3]  Herb Schwetman,et al.  Cost-Performance Bounds for Multimicrocomputer Networks , 1983, IEEE Transactions on Computers.

[4]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[5]  Daniel H. Linder,et al.  An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.

[6]  Anant Agarwal,et al.  Limits on Interconnection Network Performance , 1991, IEEE Trans. Parallel Distributed Syst..

[7]  William J. Dally,et al.  Express Cubes: Improving the Performance of k-Ary n-Cube Interconnection Networks , 1989, IEEE Trans. Computers.

[8]  Larry D. Wittie,et al.  Communication Structures for Large Networks of Microcomputers , 1981, IEEE Transactions on Computers.

[9]  J. Robert Jump,et al.  Cross-profiling as an efficient technique in simulating parallel computer systems , 1989, [1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference.

[10]  Vassilios V. Dimakopoulos,et al.  Routing in Hypercycles. Deadlock Free and Backtracking Strategies , 1992, PARLE.

[11]  R. C. Covington,et al.  The rice parallel processing testbed , 1988, SIGMETRICS '88.

[12]  Athanasios Papoulis,et al.  Probability, Random Variables and Stochastic Processes , 1965 .