Details
| Original language | English |
|---|---|
| Pages (from-to) | 3357-3368 |
| Number of pages | 12 |
| Journal | Concurrency and Computation: Practice and Experience |
| Volume | 28 |
| Issue number | 12 |
| Early online date | 5 Mar 2016 |
| Publication status | Published - 3 Aug 2016 |
Abstract
Distributed discrete event simulation is an important approach for enabling the modeling and analysis of the behavior of large systems. This approach presents a major problem, namely, the possible low performance due to the excessive overhead in synchronizing the distributed logical processes. To counter this, our approach to distributed discrete event simulation involves conservative synchronization and its acceleration using dynamic estimation of process-to-process look-ahead with a feedback mechanism. This mechanism allows for the estimation of a larger look-ahead, which may be invalidated and recalculated during the course of the simulation, if one of the processes obtains more detailed knowledge. In this work, we extend the dynamically estimated look-ahead, on the basis of the local state of the logical processes, by exchanging conditional look-aheads, in conjunction with the broadcast of invalidation announcements. A notable reduction in runtime in various cases is thus achieved, especially when the estimated look-ahead is stochastically too conservative.
ASJC Scopus subject areas
- Mathematics(all)
- Theoretical Computer Science
- Computer Science(all)
- Software
- Computer Science(all)
- Computer Science Applications
- Computer Science(all)
- Computer Networks and Communications
- Computer Science(all)
- Computational Theory and Mathematics
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Concurrency and Computation: Practice and Experience, Vol. 28, No. 12, 03.08.2016, p. 3357-3368.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - Improving the performance of distributed discrete event simulation by exchange of conditional look-ahead
AU - Fu, Desheng
AU - Becker, Matthias
AU - Szczerbicka, Helena
PY - 2016/8/3
Y1 - 2016/8/3
N2 - Distributed discrete event simulation is an important approach for enabling the modeling and analysis of the behavior of large systems. This approach presents a major problem, namely, the possible low performance due to the excessive overhead in synchronizing the distributed logical processes. To counter this, our approach to distributed discrete event simulation involves conservative synchronization and its acceleration using dynamic estimation of process-to-process look-ahead with a feedback mechanism. This mechanism allows for the estimation of a larger look-ahead, which may be invalidated and recalculated during the course of the simulation, if one of the processes obtains more detailed knowledge. In this work, we extend the dynamically estimated look-ahead, on the basis of the local state of the logical processes, by exchanging conditional look-aheads, in conjunction with the broadcast of invalidation announcements. A notable reduction in runtime in various cases is thus achieved, especially when the estimated look-ahead is stochastically too conservative.
AB - Distributed discrete event simulation is an important approach for enabling the modeling and analysis of the behavior of large systems. This approach presents a major problem, namely, the possible low performance due to the excessive overhead in synchronizing the distributed logical processes. To counter this, our approach to distributed discrete event simulation involves conservative synchronization and its acceleration using dynamic estimation of process-to-process look-ahead with a feedback mechanism. This mechanism allows for the estimation of a larger look-ahead, which may be invalidated and recalculated during the course of the simulation, if one of the processes obtains more detailed knowledge. In this work, we extend the dynamically estimated look-ahead, on the basis of the local state of the logical processes, by exchanging conditional look-aheads, in conjunction with the broadcast of invalidation announcements. A notable reduction in runtime in various cases is thus achieved, especially when the estimated look-ahead is stochastically too conservative.
UR - http://www.scopus.com/inward/record.url?scp=84959487763&partnerID=8YFLogxK
U2 - 10.1002/cpe.3811
DO - 10.1002/cpe.3811
M3 - Article
AN - SCOPUS:84959487763
VL - 28
SP - 3357
EP - 3368
JO - Concurrency and Computation: Practice and Experience
JF - Concurrency and Computation: Practice and Experience
SN - 1532-0626
IS - 12
ER -