An efficient optimistic time management algorithm for discrete- eventsimulation system

S. S. Rizvi, A. Riasat, K. M. Elleithy

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Time Wrap algorithm is a well-known mechanism of optimistic synchronization in a parallel discrete-event simulation (PDES) system. It offers a run time recovery mechanism that deals with the causality errors. For an efficient use of rollback, the global virtual time (GVT) computation is performed to reclaim the memory, commit the output, detect the termination, and handle the errors. This paper presents a new unacknowledged message list (UML) scheme for an efficient and accurate GVT computation. The proposed UML scheme is based on the assumption that certain variables are accessible by all processors. In addition to GVT computation, the proposed UML scheme provides an effective solution for both simultaneous reporting and transient message problems in the context of synchronous algorithm. To support the proposed UML approach, two algorithms are presented in details, with a proof of its correctness. Empirical evidence from an experimental study of the proposed UML scheme on PHOLD benchmark fully confirms the theoretical outcomes of this paper.

Original languageEnglish (US)
Pages (from-to)117-130
Number of pages14
JournalInternational Journal of Simulation Modelling
Volume9
Issue number3
DOIs
StatePublished - Sep 1 2010

Fingerprint

Time Management
Discrete Systems
Discrete event simulation
Synchronization
Parallel Discrete Event Simulation
Proof of correctness
Data storage equipment
Recovery
Causality
Simulation System
Termination
Experimental Study
Benchmark
Output

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Computer Science Applications

Cite this

@article{66be315e560c4c2ea370a48000dd4803,
title = "An efficient optimistic time management algorithm for discrete- eventsimulation system",
abstract = "Time Wrap algorithm is a well-known mechanism of optimistic synchronization in a parallel discrete-event simulation (PDES) system. It offers a run time recovery mechanism that deals with the causality errors. For an efficient use of rollback, the global virtual time (GVT) computation is performed to reclaim the memory, commit the output, detect the termination, and handle the errors. This paper presents a new unacknowledged message list (UML) scheme for an efficient and accurate GVT computation. The proposed UML scheme is based on the assumption that certain variables are accessible by all processors. In addition to GVT computation, the proposed UML scheme provides an effective solution for both simultaneous reporting and transient message problems in the context of synchronous algorithm. To support the proposed UML approach, two algorithms are presented in details, with a proof of its correctness. Empirical evidence from an experimental study of the proposed UML scheme on PHOLD benchmark fully confirms the theoretical outcomes of this paper.",
author = "Rizvi, {S. S.} and A. Riasat and Elleithy, {K. M.}",
year = "2010",
month = "9",
day = "1",
doi = "10.2507/IJSIMM09(3)1.146",
language = "English (US)",
volume = "9",
pages = "117--130",
journal = "International Journal of Simulation Modelling",
issn = "1726-4529",
publisher = "Vienna University of Technology",
number = "3",

}

An efficient optimistic time management algorithm for discrete- eventsimulation system. / Rizvi, S. S.; Riasat, A.; Elleithy, K. M.

In: International Journal of Simulation Modelling, Vol. 9, No. 3, 01.09.2010, p. 117-130.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An efficient optimistic time management algorithm for discrete- eventsimulation system

AU - Rizvi, S. S.

AU - Riasat, A.

AU - Elleithy, K. M.

PY - 2010/9/1

Y1 - 2010/9/1

N2 - Time Wrap algorithm is a well-known mechanism of optimistic synchronization in a parallel discrete-event simulation (PDES) system. It offers a run time recovery mechanism that deals with the causality errors. For an efficient use of rollback, the global virtual time (GVT) computation is performed to reclaim the memory, commit the output, detect the termination, and handle the errors. This paper presents a new unacknowledged message list (UML) scheme for an efficient and accurate GVT computation. The proposed UML scheme is based on the assumption that certain variables are accessible by all processors. In addition to GVT computation, the proposed UML scheme provides an effective solution for both simultaneous reporting and transient message problems in the context of synchronous algorithm. To support the proposed UML approach, two algorithms are presented in details, with a proof of its correctness. Empirical evidence from an experimental study of the proposed UML scheme on PHOLD benchmark fully confirms the theoretical outcomes of this paper.

AB - Time Wrap algorithm is a well-known mechanism of optimistic synchronization in a parallel discrete-event simulation (PDES) system. It offers a run time recovery mechanism that deals with the causality errors. For an efficient use of rollback, the global virtual time (GVT) computation is performed to reclaim the memory, commit the output, detect the termination, and handle the errors. This paper presents a new unacknowledged message list (UML) scheme for an efficient and accurate GVT computation. The proposed UML scheme is based on the assumption that certain variables are accessible by all processors. In addition to GVT computation, the proposed UML scheme provides an effective solution for both simultaneous reporting and transient message problems in the context of synchronous algorithm. To support the proposed UML approach, two algorithms are presented in details, with a proof of its correctness. Empirical evidence from an experimental study of the proposed UML scheme on PHOLD benchmark fully confirms the theoretical outcomes of this paper.

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

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

U2 - 10.2507/IJSIMM09(3)1.146

DO - 10.2507/IJSIMM09(3)1.146

M3 - Article

AN - SCOPUS:77956369253

VL - 9

SP - 117

EP - 130

JO - International Journal of Simulation Modelling

JF - International Journal of Simulation Modelling

SN - 1726-4529

IS - 3

ER -