An agent-based framework for performance modeling of an optimistic parallel discrete event simulator

Aditya Kurve, Khashayar Kotobi, George Kesidis

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

Purpose: 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. Method: 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. Results: 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. Conclusion: 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.

Original languageEnglish (US)
Article number12
JournalComplex Adaptive Systems Modeling
Volume1
Issue number1
DOIs
StatePublished - Dec 1 2013

Fingerprint

Performance Modeling
Discrete Event
Execution Time
Simulator
Simulators
Agent-based Model
Simulation
Incentives
Experiment
Experiments
kernel
Autonomous agents
Autonomous Agents
Complex networks
Performance Metrics
Performance Model
Self-organizing
Load Balancing
Modeling
System Dynamics

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Computer Science Applications
  • Applied Mathematics

Cite this

@article{a980bb08a56f40b08f8e30b52b5a4d5e,
title = "An agent-based framework for performance modeling of an optimistic parallel discrete event simulator",
abstract = "Purpose: 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. Method: 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. Results: 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. Conclusion: 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.",
author = "Aditya Kurve and Khashayar Kotobi and George Kesidis",
year = "2013",
month = "12",
day = "1",
doi = "10.1186/2194-3206-1-12",
language = "English (US)",
volume = "1",
journal = "Complex Adaptive Systems Modeling",
issn = "2194-3206",
publisher = "Springer Open",
number = "1",

}

An agent-based framework for performance modeling of an optimistic parallel discrete event simulator. / Kurve, Aditya; Kotobi, Khashayar; Kesidis, George.

In: Complex Adaptive Systems Modeling, Vol. 1, No. 1, 12, 01.12.2013.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An agent-based framework for performance modeling of an optimistic parallel discrete event simulator

AU - Kurve, Aditya

AU - Kotobi, Khashayar

AU - Kesidis, George

PY - 2013/12/1

Y1 - 2013/12/1

N2 - Purpose: 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. Method: 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. Results: 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. Conclusion: 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.

AB - Purpose: 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. Method: 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. Results: 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. Conclusion: 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.

UR - http://www.scopus.com/inward/record.url?scp=84921700141&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84921700141&partnerID=8YFLogxK

U2 - 10.1186/2194-3206-1-12

DO - 10.1186/2194-3206-1-12

M3 - Article

AN - SCOPUS:84921700141

VL - 1

JO - Complex Adaptive Systems Modeling

JF - Complex Adaptive Systems Modeling

SN - 2194-3206

IS - 1

M1 - 12

ER -