Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences 1996
DOI: 10.1109/hicss.1996.495485
|View full text |Cite
|
Sign up to set email alerts
|

WARPED: a time warp simulation kernel for analysis and application development

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
44
0

Year Published

1996
1996
2016
2016

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 59 publications
(44 citation statements)
references
References 2 publications
0
44
0
Order By: Relevance
“…There are several run-time support libraries for running parallel discrete-event simulations such as Root-Sim (Alessandro Pellegrini & Quaglia, 2014), ROSS (Carothers, Bauer, & Pearce, 2002), Warped (Martin, McBrayer, & Wilsey, 1996) or sik (Perumalla, 2005). As a case study, we chose sik simulation library for parallel discrete-event simulation (Onggo, 2008(Onggo, , 2010.…”
Section: A Solution For Parallel Demographic Simulation: Yades Frameworkmentioning
confidence: 99%
“…There are several run-time support libraries for running parallel discrete-event simulations such as Root-Sim (Alessandro Pellegrini & Quaglia, 2014), ROSS (Carothers, Bauer, & Pearce, 2002), Warped (Martin, McBrayer, & Wilsey, 1996) or sik (Perumalla, 2005). As a case study, we chose sik simulation library for parallel discrete-event simulation (Onggo, 2008(Onggo, , 2010.…”
Section: A Solution For Parallel Demographic Simulation: Yades Frameworkmentioning
confidence: 99%
“…Parallel discrete event simulators for fine-grained simulation, like Georgia Tech Time Warp (GTW) [7], Rensselaer's optimistic simulation system (ROSS) [6] or WARPED [24] do not employ IM. Instead, performance improvements are explored with various optimistic synchronisation techniques and, in case of GTW and WARPED, additionally with load distribution.…”
Section: Contrasting Related Workmentioning
confidence: 99%
“…Let the total number of lost events at the merge point be denoted by G. We have G = X G i ; (for all routes in the fork-merge pair) (14) In the simulation of open systems, the population of simultaneous events is determined mainly by the event generators at steady state. Therefore the number of events lost in the merge points will not affect the workload characteristics.…”
Section: Figure 3 Fork and Merge Lp Networkmentioning
confidence: 99%
“…The two major approaches of asynchronous parallel simulation are conservative [4] and optimistic [11]. Synchronization protocols for parallel simulation have been proposed [4,11,16,18,19], and many experimental parallel simulation suites are available [2,6,14,20].…”
Section: Introductionmentioning
confidence: 99%