2014 IEEE/ACM 18th International Symposium on Distributed Simulation and Real Time Applications 2014
DOI: 10.1109/ds-rt.2014.30
|View full text |Cite
|
Sign up to set email alerts
|

Accelerating Distributed Discrete Event Simulation through Exchange of Conditional Look-Ahead

Abstract: Distributed discrete event simulation is a very important method today to analyze the behavior of large models. We investigate the practical implementation of distributed discrete event simulation with conservative synchronization and its acceleration through dynamic estimation of process-to-process look-ahead. Since the dynamic look-ahead changes with time, we have to face the situation, that the look-ahead between some logical processes is decreased temporarily. The shortened lookahead has a very negative in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
2
2

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 20 publications
0
3
0
Order By: Relevance
“…There have been many variants proposed to improve the effectiveness of conservative algorithms, especially with respect to alternative approaches to null message generation and extracting better lookahead from application specific details. For example, broadcasting (Peacock, Manning, & Wong, 1980), shared resources (Reynolds, 1972), appointments (Nicol & Reynolds, 1984), LP interconnection topology (Kumar, 1986), bounded lag (Lubachevsky, 1989) and conditional lookahead (Fu, Becker, & Szczerbicka, 2014). Work continues in this area as researchers seek to produce more effective time management approaches for specific applications or new mapping/partitioning algorithms to load balance the processing of a DS.…”
Section: Conservative Approachesmentioning
confidence: 99%
“…There have been many variants proposed to improve the effectiveness of conservative algorithms, especially with respect to alternative approaches to null message generation and extracting better lookahead from application specific details. For example, broadcasting (Peacock, Manning, & Wong, 1980), shared resources (Reynolds, 1972), appointments (Nicol & Reynolds, 1984), LP interconnection topology (Kumar, 1986), bounded lag (Lubachevsky, 1989) and conditional lookahead (Fu, Becker, & Szczerbicka, 2014). Work continues in this area as researchers seek to produce more effective time management approaches for specific applications or new mapping/partitioning algorithms to load balance the processing of a DS.…”
Section: Conservative Approachesmentioning
confidence: 99%
“…The concept of conditional LA makes this achievable by detection and invalidation of over-estimation [17], and the corrected estimation can be calculated conservatively. The concept of conditional LA makes this achievable by detection and invalidation of over-estimation [17], and the corrected estimation can be calculated conservatively.…”
Section: Related Workmentioning
confidence: 99%
“…In our approach here, overestimation is allowed without the necessity of a time‐warp algorithm, because causality errors are avoided. The concept of conditional LA makes this achievable by detection and invalidation of over‐estimation , and the corrected estimation can be calculated conservatively. This will be discussed in the next section.…”
Section: Related Workmentioning
confidence: 99%