Author | Conference | Journal | Organization | Year | DOI
Look for results that meet for the following criteria:
Academic
Publications
Analysis of bounded time warp and comparison with YAWNS

Analysis of bounded time warp and comparison with YAWNS,10.1145/240896.240913,ACM Transactions on Modeling and Computer Simulation,Phillip M. Dickens,

Edit
Analysis of bounded time warp and comparison with YAWNS   (Citations: 14)
BibTex | RIS | RefWorks Download
This article studies an analytic model of parallel discrete-event simulation, comparing the YAWNS conservative synchronization protocol with Bounded Time Warp. The assumed simulation problem is a heavily loaded queuing network where the probability of an idle server is closed to zero. We model workload and job routing in standard ways, then develop and validate methods for computing approximated performance measures as a function of the degree of optimism allowed, overhead costs of state-saving, rollback, and barrier synchronization, and workload aggregation. We find that Bounded Time Warp is superior when the number of servers per physical processor is low (i.e., sparse load), but that aggregating workload improves YAWNS relative performance.
Journal: ACM Transactions on Modeling and Computer Simulation - TOMACS , vol. 6, no. 4, pp. 297-320, 1996
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
More »
    • ...Promiment examples arethe Bounded Lag algorithm (Lubachevsky, Shwartz, and Weiss 1991), Time Buckets (Steinman 1993), YAWNS (Dickens et al. 1996), and more recently Composite Synchronization (Nicol and Liu 2002)...
    • ...For conservative protocols, there is: Bounded Lag (Lubachevsky, Shwartz, and Weiss 1991), YAWNS (Dickens et al. 1996), and Critical Channel Traversing (Xiao et al. 1999), and Composite Synchronization (Nicol and Liu 2002)...

    Christopher D. Carothers, et al. On deciding between conservative and optimistic approaches on massivel...

    • ...As pointed out in other contexts [DNRD96], probe functions may be expensive, therefore, they should be executed only when a further delay could actually produce negative effects on performance...

    Marco Pedicini, et al. PELCR: Parallel Environment for Optimal Lambda-Calculus Reduction

    • ...Among the outcoming protocols, a complete performance model has been presented in [6] for the case of Bounded Time Warp [35]...
    • ...The analysis in [6] compares performance of Bounded Time Warp to that of a conservative protocol for the case of a queuing network under heavy load for each server...
    • ...Compared to performance models in literature, our model has features similar to that in [6] (although we analyze a different synchronization protocol—i.e., Time Warp instead of Bounded Time Warp)...
    • ...Two main differences exist between the model in [6] and ours: We consider communication instantaneous (like in [18]); we do not restrict the analysis to a particular simulation model (e.g., queuing networks), homogeneity of LPs is, instead, our only assumption on the simulation model...

    Francesco Quaglia, et al. Trade-Off between Sequential and Time Warp-Based Parallel Simulation

    • ...For SYNC we describe event-horizon time advance as their associated protocols have been shown to be efficient [2, 18]...

    Mauricio Marín. Towards Automated Performance Prediction in Bulk-Synchronous Parallel ...

    • ...Based on probabilistic approach and numerical techniques, Dickens et. al. analyze the performance of bounded TW [2]...

    Seng Chuan Tay, et al. Performance Analysis of Time Warp Simulation with Cascading Rollbacks

Sort by:

Citations (14)

Share this on