Mattern, F. Effecient algorithms for distributed snapshots and global virtual time approximation. Journal of Parallel and Distributed Computing 18, 4 (August 1993), 423--434.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... For example, improved partitioning strategies have been developed to minimize the number of messages generated by the application [1,6,36,57] Similarly, several optimizations that minimize messages generated by the kernel have been studied (lazy cancellation [49] efficient GVT estimations [41], bounding optimism [20, 47] In this thesis, DyMA has been proposed to reduce the average communication overhead experienced by the application. In DyMA, delaying and sending a group of application messages as a single physical message result in a single overhead for all the messages sent. ....

.... (by sending an anti message with the earliest erroneous message time stamp and nullifying subsequent messages from the same source) The global progress time of the simulation, called Global Virtual Time (GVT) is defined as the minimum of the LVT values of all LPs and all messages in transit [22, 37,41]. Periodic GVT calculation is necessary to reclaim memory space used by history queues; history items with a time stamp lower than GVT are no longer needed, and are deleted to make room for new history items. The communication behavior of distributed optimistically synchronized simulations is ....

[Article contains additional citation context not shown here]

Mattern, F. Effecient algorithms for distributed snapshots and global virtual time approximation. Journal of Parallel and Distributed Computing 18, 4 (August 1993), 423--434.

....at which the saved information is needed. The process of identifying and reclaiming this space is called fossil collection. The global time against which fossil collection algorithms operate is called the global virtual time (or GVT) and several algorithms for GVT estimation have been proposed [3, 4, 5, 6, 7, 8]. In addition to its use for fossil collection, GVT is also useful for deciding when irrevocable operations (such as I O) can be performed and, in some instances, when the simulation has completed. 1.2 General Approach A simulation system is operating correctly when: i) it processes simulation ....

F. Mattern. Effecient algorithms for distributed snapshots and global virtual time approximation. Journal of Parallel and Distributed Computing, 18(4):423--434, August 1993.

.... For example, improved partitioning strategies have been developed to minimize the number of messages generated by the application [1, 2, 10, 18] Similarly, several optimizations that minimize messages generated by the kernel have been studied (lazy cancelation [16] efficient GVT calculations [12], bounding optimism [5, 15] In contrast, there have been no efforts to optimize the operation of the communication subsystem of the simulator kernel. The work described in this paper optimizes the operation of the communication subsystem by matching the message behavior to the characteristics ....

F. Mattern. Effecient algorithms for distributed snapshots and global virtual time approximation. Journal of Parallel and Distributed Computing, 18(4):423--434, August 1993.

....be committed and the space used to store them can be reclaimed. This process is called fossil collection. The frequency of GVT calculation affects performance of the simulation. Doing it too often slows down the simulation and doing it too rarely causes the memory to build up. The algorithm used [12,56,59] also determines the overhead of calculating the GVT. Some of the major concerns in Time Warp simulators are: ffl the costs involved in saving the state and event histories [32] ffl the implementation of the event list structure. ffl higher memory requirements as compared to sequential and ....

Mattern, F. Effecient algorithms for distributed snapshots and global virtual time approximation. Journal of Parallel and Distributed Computing 18, 4 (August 1993), 423--434.

.... protocol based on the virtual time paradigm [4,9] In a Time Warp simulator, each LP is responsible for maintaining a local simulation time (called Local Virtual Time or LVT) Furthermore, the overall global progress of simulation is monitored by approximations of the Global Virtual Time (GVT) [12]. Each LP executes autonomously and processes the events in its ordered event list (input queue) without any external control. This can result in causality errors if an event message arrives with a time stamp preceding the current LVT value (a straggler message) The arrival of a straggler ....

Mattern, F. Effecient algorithms for distributed snapshots and global virtual time approximation. Journal of Parallel and Distributed Computing 18, 4 (August 1993), 423--434.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC