This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
PP-MESS-SIM: A Flexible and Extensible Simulator for Evaluating Multicomputer Networks
January 1997 (vol. 8 no. 1)
pp. 25-40

Abstract—This paper presents pp-mess-sim, an object-oriented discrete-event simulation environment for evaluating interconnection networks in message-passing systems. The simulator provides a toolbox of various network topologies, communication workloads, routing-switching algorithms, and router models. By carefully defining the boundaries between these modules, pp-mess-sim creates a flexible and extensible environment for evaluating different aspects of network design. The simulator models emerging multicomputer networks that can support multiple routing and switching schemes simultaneously; pp-mess-sim achieves this flexibility by associating routing-switching policies, traffic patterns, and performance metrics with collections of packets, instead of the underlying router model. Besides providing a general framework for evaluating router architectures, pp-mess-sim includes a cycle-level model of the PRC, a programmable router for point-to-point distributed systems. The PRC model captures low-level implementation details, while another high-level model facilitates experimentation with general router design issues. Sample simulation experiments capitalize on this flexibility to compare network architectures under various application workloads.

[1] W.C. Athas and C.L. Seitz, “Multicomputers: Message-Passing Concurrent Computers,” Computer, vol. 21, pp. 9-24, Aug. 1988.
[2] X. Zhang, "Systems of Interprocessor Communication Latency in Multicomputers," IEEE Micro, pp. 12-15 and 52-55, Apr. 1991.
[3] J. Dolter, "A Programmable Routing Controller Supporting Multi-Mode Routing and Switching in Distributed Real-Time Systems," PhD thesis, Univ. of Michigan, Sept. 1993.
[4] J. Rexford, J. Dolter, W. Feng, and K.G. Shin, "PP-MESS-SIM: A Simulator for Evaluating Multicomputer Interconnection Networks," Proc. Simulation Symp., pp. 84-93, Apr. 1995.
[5] A.M. Law and M.G. McComas, "Simulation Software for Communications Networks: The State of the Art," IEEE Comm., pp. 44-50, Mar. 1994.
[6] J.-M. Hsu and P. Banerjee, “Performance Measurement and Trace Driven Simulation of Parallel CAD and Numeric Applications on a Hypercube Multicomputer,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 4, pp. 451–464, July 1992.
[7] R. Cypher, A. Ho, S. Konstantinidou, and P. Messina, "Architectural Requirements of Parallel Scientific Applications with Explicit Communication," Proc. 20th Ann. Int'l Symp. Computer Architecture, pp. 2-13, May 1993.
[8] M.G. Norman and P. Thanisch, “Models of Machines and Computation for Mapping in Multicomputers,” ACM Computing Surveys, vol. 25, no. 3, pp. 263-302, 1993.
[9] V.M. Lo, S. Rajopadhye, S. Gupta, D. Keldsen, M.A. Mohamed, B. Nitzeberg, J.A. Telle, and X. Zhong, "OREGAMI: Tools for mapping parallel computations to parallel architectures," International Journal of Parallel Programming, vol 20, pp. 237-270, June 1991.
[10] F. Hady and D. Smitley, "Adaptive vs. Non-Adaptive Routing: An Application Driven Case Study," Technical Report SRC-TR-93-099, Supercomputing Research Center, Bowie, Md., Mar. 1993.
[11] J.H. Kim and A.A. Chien, "Evaluation of Wormhole Routed Networks Under Hybrid Traffic Loads," Proc. Hawaii Int'l Conf. System Sciences, pp. 276-285, Jan. 1993.
[12] J. Rexford, J. Dolter, and K. Shin, "Hardware Support for Controlled Interaction of Guaranteed and Best-Effort Communication," Proc. Third IPPS Workshop Parallel and Distributed Real-Time Systems, pp. 188-193, Apr. 1994.
[13] S. Konstantinidou, "Segment Router: A Novel Router Design for Parallel Computers," Proc. Symp. Parallel Algorithms and Architectures, June 1994.
[14] D. Smitley, F. Hady, and D. Burns, "Hnet: A High-Performance Network Evaluation Testbed," Technical Report SRC-TR-91-049, Supercomputing Research Center, Inst. for Defense Analyses, Dec. 1991.
[15] nCube Corporation nCube-3: The Scalable Server Platform, Mar. 1995.
[16] S. Daniel, J. Rexford, J. Dolter, and K. Shin, "A Programmable Routing Controller for Flexible Communications in Point-to-Point Networks," Proc. Int'l Conf. Computer Design, pp. 320-325, Oct. 1995.
[17] J. Rexford, J. Hall, and K.G. Shin, "A Router Architecture for Real-Time Point-to-Point Networks," Proc. 23rd Ann. Int'l Symp. Computer Architecture, pp. 237-246, May 1996.
[18] E. Olk, "PARSE: Simulation of Message Passing Communication Networks," Proc. Simulation Symp., pp. 115-1245, Apr. 1994.
[19] P.M. Dickens, P. Heidelberger, and D.M. Nicol, "Parallelized Network Simulators for Message-Passing Parallel Programs," Proc. Int'l Workshop Modeling, Analysis, Simulation of Computer and Telecommunication Systems, pp. 72-76, 1995.
[20] R.C. Bedichek, "Talisman: Fast and Accurate Multicomputer Simulation," Proc. ACM SIGMETRICS/Performance, pp. 14-24, May 1995.
[21] L.A. Barroso and M. Dubois,“The performance of cache-coherent ring-based multiprocessors,” Proc. 20th Int’l Conf. of Computer Architectures, IEEE Computer Society Press, Apr. 1993, pp. 268-277.
[22] J.R. Jump and S. Lakshmanamurthy, "NETSIM: A General-Purpose Interconnection Network Simulator," Proc. Int'l Workshop Modeling, Analysis, Simulation of Computer and Telecommunication Systems, pp. 121-125, Jan. 1993.
[23] K. Bolding, S.-E. Choi, and M. Fulgham, "The Chaos Router Simulator." Presentation at Parallel Computer Routing and Comm. Workshop, May 1994.
[24] W.J. Dally, "Performance Analysis of k-ary n-Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1992.
[25] A. Agarwal, "Limits on Interconnection Network Performance," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 398-412, Oct. 1991.
[26] W.J. Dally and C.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[27] W.J. Dally, "Virtual-Channel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
[28] A.A. Chien, "A Cost and Speed Model for k-Ary n-Cube Wormhole Routers," Proc. Hot Interconnects, Aug. 1993.
[29] P. Kermani and L. Kleinrock, "Virtual Cut-Through: A New Computer Communication Switching Technique," Computer Networks, vol. 3, pp. 267-286, Sept. 1979.
[30] W.J. Dally and C.L. Seitz, "The Torus Routing Chip," J. Distributed Computing, vol. 1, no. 3, pp. 187-196, 1986.
[31] K.G. Ashin and S. Daniel, "Analysis and Implementation of Hybrid Switching," IEEE Trans. Computers, pp. 211-219, 1995.
[32] V. Karamcheti and A.A. Chien, "Software Overhead in Messaging Layers: Where Does the Time Go?" Proc. Sixth Symp. Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI), ACM Press, New York, 1994, pp. 51-60; http://www-csag.cs.uiuc.edu/papers/asplos94.ps.
[33] M.G. Hluchyj and M.J. Karol, "Queueing in High-Performance Packet Switching," IEEE J. Selected Areas in Comm., vol. 6, pp. 1,587-1,597, Dec. 1988.
[34] J. Rexford and K.G. Shin, "Support for Multiple Classes of Traffic in Multicomputer Routers," Proc. Parallel Computer Routing and Communication Workshop, May 1994.
[35] J. Duato, "A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1,320-1,331, Dec. 1993.
[36] H.G. Badr and S. Podar, "An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies," IEEE Trans. Computers, vol. 38, no. 10, pp. 1,362-1,370, Oct. 1989
[37] A.L. Davis, "Mayfly: A General-Purpose, Scalable, Parallel Processing Architecture," Lisp and Symbolic Computation, vol. 5, pp. 7-47, May 1992.
[38] W.J. Dally and H. Aoki, "Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 4, pp. 466-475, Apr. 1993.
[39] D. Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, Mass., 1998.
[40] R. Jain, The Art of Computer Systems Performance Analysis. John Wiley&Sons, 1991.
[41] J. Rexford and K.G. Shin, "Shortest-Path Routing in Homogeneous Point-to-Point Networks with Virtual Cut-Through Switching," Computer Science and Eng. Technical Report CSE-TR-146-92, Univ. of Michigan, Nov. 1992.
[42] W. Feng, J. Rexford, A. Mehra, S. Daniel, J. Dolter, and K. Shin, "Architectural Support for Managing Communication in Point-to-Point Distributed Systems," Technical Report CSE-TR-197-94, Univ. of Michigan, Mar. 1994.
[43] W. Feng, J. Rexford, S. Daniel, A. Mehra, and K. Shin, "Tailoring Routing and Switching Schemes to Application Workloads in Multicomputer Networks," Computer Science and Eng. Technical Report CSE-TR-239-95, Univ. of Michigan, May 1995.
[44] W. Feng and K.G. Shin, "Impact of Selection Functions on Routing Algorithm Performance in Multicomputer Networks," Computer Science and Eng. Technical Report CSE-TR-287-96, Univ.. of Michigan, Mar. 1996.

Index Terms:
Multicomputers, routers, routing, switching, object-oriented simulation.
Citation:
Jennifer Rexford, Wu-chang Feng, James Dolter, Kang G. Shin, "PP-MESS-SIM: A Flexible and Extensible Simulator for Evaluating Multicomputer Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 1, pp. 25-40, Jan. 1997, doi:10.1109/71.569653
Usage of this product signifies your acceptance of the Terms of Use.