An agent-based framework for performance modeling of an optimistic parallel discrete event simulator
The performance of an optimistic parallel discrete event simulator (PDES) in terms of the total simulation execution time of an experiment depends on a large set of variables. Many of them have a complex and generally unknown relationship with the simulation execution time. In this paper, we describe an agent-based performance model of a PDES kernel that is typically used to simulate large-sized complex networks on multiple processors or machines. The agent-based paradigm greatly simplifies the modeling of system dynamics by representing a component logical process (LP) as an autonomous agent that interacts with other LPs through event queues and also interacts with its environment which comprises the processor it resides on.
We model the agents representing the LPs using a “base” class of an LP agent that allows us to use a generic behavioral model of an agent that can be extended further to model more details of LP behavior. The base class focuses only on the details that most likely influence the overall simulation execution time of the experiment.
We apply this framework to study a local incentive based partitioning algorithm where each LP makes an informed local decision about its assignment to a processor, resulting in a system akin to a self organizing network. The agent-based model allows us to study the overall effect of the local incentive-based cost function on the simulation execution time of the experiment which we consider to be the global performance metric.
This work demonstrates the utility of agent-based approach in modeling a PDES kernel in order to evaluate the effects of a large number of variable factors such as the LP graph properties, load balancing criteria and others on the total simulation execution time of an experiment.
- Agent-based modeling vs. equation-based modeling: A case study and users guide In Proceedings of the, First International Workshop on Multi-Agent Systems and Agent-Based Simulation. Springer-Verlag; 1998:10–25.
- Agrawal VD, Chakradhar ST: Performance analysis of synchronized iterative algorithms on multiprocessor systems. IEEE Trans, Parallel Distributed Syst 1992,3(6):739–746. CrossRef
- Axelrod R: The dissemination of culture a model with local convergence and global polarization. J Confl Resolution 1997,41(2):203–226. CrossRef
- Bagrodia R, Meyer R, Takai M, Chen Y, Zeng X, Martin J, Song HY: Parsec: a parallel simulation environment for complex systems. Computer 1998,31(10):77–85. CrossRef
- Borshchev A, Filippov A: From system dynamics and discrete event to practical agent based modeling: reasons, techniques, tools. Proceedings of the 22nd International Conference of the System Dynamics Society 2004. number 22.
- Bu T, Towsley D: On distinguishing between internet power law topology generators. In Proceedings of the 21st, Annual Joint Conference of the IEEE Computer and Communications Societies IN-FOCOM. volume 2. IEEE; 2002:638–647.
- Carl G, Kesidis G: Large-scale testing of the Internet’s Border Gateway Protocol (BGP) via topological scale-down. ACM Trans Model, Comput Simul (TOMACS) 2008,18(3):1–30. CrossRef
- Chandy KM, Misra J: Asynchronous distributed simulation via a sequence of parallel computations. Commun ACM 1981,24(4):198–206. CrossRef
- Chertov R, Fahmy S: Forwarding devices: From measurements to simulations. ACM Trans Model and, Comput Simul (TOMACS) 2011,21(2):12.
- Dimitropoulos X, Krioukov D, Vahdat A, Riley G: Graph annotations in modeling complex network topologies. ACM Trans Model, Comput Simul (TOMACS) 2009,19(4):17.
- Dorigo M, Birattari M, Stutzle T: Ant colony optimization. Comput Intell, Mag, IEEE 2006,1(4):28–39.
- Gupta D, Vishwanath KV, Vahdat A: Diecast: testing distributed systems with an accurate scale model. In Proc. 5th USENIX Symposium on Networked Systems Design and Implementation. USENIX Association; 2008:407–422.
- Jefferson DR: Virtual time. ACM Trans Program, Languages Syst (TOPLAS) 1985,7(3):404–425. CrossRef
- Jennings NR, Commun ACM: An agent-based approach for building complex software systems. 2001,44(4):35–41.
- Karypis G, Kumar V: Parallel multilevel k-way partitioning scheme for irregular graphs. In Proc. 1996 ACM/IEEE Conference on Supercomputing. IEEE; 1996.
- Kurve A, Griffin C, Kesidis G: A graph partitioning game for distributed simulation of networks. In Proceedings of the 2011 International Workshop on, Modeling, Analysis, and Control of Complex Networks. ITCP; 2011a:9–16.
- Kurve, A: Iterative partitioning scheme for distributed simulation of dynamic networks. In Proc. 16th IEEE International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD). IEEE; 2011b:92–96. CrossRef
- Kurve A, Griffin C, Miller DJ, Kesidis G: Optimizing Cluster Formation in Super-Peer Networks via Local Incentive Design. Springer; 2013:Accepted-Accepted.
- Monderer D, Shapley LS: Potential games. Games Econ, Behav 1996, 14:124–143. CrossRef
- Niazi M, Hussain A: Agent-based computing from multi-agent systems to agent-based models a visual survey. Scientometrics 2011,89(2):479–499. CrossRef
- Nicol D, Fujimoto R: Parallel simulation today. Ann Oper, Res 1994,53(1):249–285. CrossRef
- Nikolai C, Madey G: Anatomy of a toolkit: A comprehensive compensium of various agent-based modeling. Proceedings of the Agent 2007 Conference on Complex Interaction and Social Emergence 2007, 87–92.
- North M, Howe T, Collier N, Vos J: A declarative model assembly infrastructure for verification and validation. In Advancing Social, Simulation: The First World Congress. Springer; 2007:129–140. CrossRef
- Pothen A, Simon HD, Liou KPetal: Partitioning sparse matrices with eigenvectors of graphs. SIAM J Matrix Anal Appl 1990,11(3):430–452. CrossRef
- Psounis K, Pan R, Prabhakar B, Wischik D: The scaling hypothesis: Simplifying the prediction of network performance using scaled-down simulations. ACM SIGCOMM Comput Commun, Rev 2003,33(1):35–40. CrossRef
- Reynolds R: Flocks, herds and schools: a distributed behavioral model. In ACM SIGGRAPH Comput Graph. volume 21. ACM; 1987:25–34.
- Sriram K, Montgomery D, Borchert O, Kim O, Kuhn DR: Study of BGP peering session attacks and their impacts on routing performance. IEEE J Selected Areas, Commun 2006,24(10):1901–1915. CrossRef
- Tisue S, Wilensky U: Netlogo: A simple environment for modeling complexity. In Proc. International Conference on Complex Systems. Citeseer; 2004:16–21.
- Van Den Bout DE, Thomas Miller III TK: Graph partitioning using annealed neural networks. IEEE Trans Neural Netw 1990,1(2):192–203. CrossRef
- Xu J, Chung MJ: Predicting the performance of synchronous discrete event simulation. IEEE Trans Parallel, Distributed Syst 2004,15(12):1130–1137. CrossRef
- Zeigler B, Praehofer H, Kim TG: Theory of modeling and simulation: integrating discrete event and continuous complex dynamic systems. Academic Pr 2000.
- Zhang L: Internet topology data. 2013.
- An agent-based framework for performance modeling of an optimistic parallel discrete event simulator
- Open Access
- Available under Open Access This content is freely available online to anyone, anywhere at any time.
Complex Adaptive Systems Modeling
- Online Date
- April 2013
- Online ISSN
- Springer Berlin Heidelberg
- Additional Links
- Agent-based modeling
- Parallel simulation
- Self organizing system
- Game theory
- Load balancing