Sudhir Srinivasan

Learn More
Simulations that run at multiple levels of resolution often encounter consistency problems because of insufficient correlation between the attributes at multiple levels of the same entity. Inconsistency may occur despite the existence of valid models at each resolution level. Cross-Resolution Modeling (CRM) attempts to build effective multiresolution(More)
Adaptive approaches to synchronization in parallel discrete event simulations hold significant potential for performance improvement. We contend that an adaptive approach based on low cost near-perfect system state information is the most likely to yield a consistently efficient synchronization algorithm. We suggest a framework by which NPSI (near-perfect(More)
It has been established elsewhere [Reyn92] that hardware to support parallel discrete event simulations (PDES) is desirable. We describe the steps leading to the implementation of a hardware-based framework to support PDES. We begin with an exploration of the criteria necessary to make such a framework both practical and useful, concluding that maintenance(More)
Multi-resolution representation of simulated entities is considered essential for a growing portion of distributed simulations. Heretofore, modelers have represented entites at just one level of resolution, or have represented concurrent representations in an inconsistent manner. We address the question of the cost of maintaining multiple, concurrent(More)
In previous papers, we have described a reduction model for computing near-perject state information (NPSI) in support of adaptive synchronization in a parallel discrete-event simulation. Here, we report on an implementation of this model on u popular high pe@ormmnce computing platfcnrm-a network of workstutions-without the use of special purpose hardware.(More)
We introduce a new class of synchronization protocols for parallel discrete event simulation, those based on <italic>near-perfect state information</italic> (NPSI). NPSI protocols are adaptive dynamically controlling the rate at which processes constituting a parallel simulation proceed with the goal of completing a simulation efficiently. We show by(More)
* GVT computation has been a significant problem in Time Warp implementations since it affects the completion time of the simulation. We present a new method for computing GVT using inexpensive hardware designed to support synchronization in parallel computations. The main contribution of this paper is this new GVT algorithm. Unlike previous methods, the(More)
Adaptive synchronization algorithms have been proposed to improve upon conservative and optimistic algorithms. We present the first known analytical comparison of adaptive, optimistic algorithms and Time Warp. We define a class of adaptive protocols, the asynchronous adaptive waiting protocols (AAWPs) and identify several practical protocols that belong to(More)
Critical path analysis has been suggested as a technique for establishing a lower bound on the completion times of parallel discrete event simulations. A protocol is super-critical if there is at least one simulation that can complete in less than the critical path time using that protocol. Previous studies have shown that several practical protocols are(More)