A performance study of the RPE mechanism for PDES

Butler, John E.; Wallentine, Virgil

doi:10.1109/mascot.1994.284420

“…Remote process execution to keep simulation clocks of different logical processes in synchrony is due to Butler and Wallentine [6]. Bagrodia and Liao [1] have shown how the detection of artificial rollbacks can reduce the overhead due to state saving and coast forward phase.…”

Section: Prakash and Subramanianmentioning

confidence: 99%

Design and Implementation of DynamicLoad Balancing Algorithms for Rollback Reductionin Optimistic PDES

Sarkar

¹

,

Das

²

1999

View full text Add to dashboard Cite

In an optimistic parallel simulation, logical processes (Ips) proceed with their computation without any constraints. However, if the computing requirements of different lps are not balanced or if the processors are not homogeneous, some lps may lag behind in simulation time while others surge forward. In other words, if the simulation clocks of different lps are not progressing at the same rate, cascading rollbacks may occur nullifying the potential benefit of an optimistic parallel discrete event simulation (PDES). Hence it is necessary to balance the computational load on different lps in such a way that their local simulation clocks advance almost at the same rate. In this paper, we propose two algorithms for dynamic load balancing which reduce the number of rollbacks in an optimistic PDES system. Our first algorithm is based on the load transfer mechanism between lps; while the second algorithm, based on the principle of evolutionary strategy, migrates logical processes between several pairs of physical processors. We have implemented both of these algorithms on a cluster of heterogeneous workstations and studied their performance. The experimental results show that the algorithm based on the load transfer is effective when the grain size is greater than 10 milliseconds. The algorithm based on the process migration yields good performance only for grain sizes of 20 milliseconds or larger. In both of these cases the speed up ranges mostly between and 2 using four processors.

show abstract

“…Initially, the speed up increases but a decreasing trend is observed beyond a certain value of the grain size. The average speed up is about 1.30 using four processors, showing a significant improvement due Grain size in milliseconds FIGURE 6 Ratio of the number of rollbacks to the total number of messages vs. grain size, using load transfer algorithm.…”

Section: Results For Load Transfer Algorithmmentioning

confidence: 99%

“…Remote process execution to keep simulation clocks of different logical processes in synchrony is due to Butler and Wallentine [6]. Bagrodia [36].…”

Section: Introductionmentioning

confidence: 99%

Design and implementation of dynamic load balancing algorithms for rollback reduction in optimistic PDES

Sarkar

¹

,

Das

²

Proceedings Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems

3

0

View full text Add to dashboard Cite

In an optimistic parallel simulation, logical processes (Ips) proceed with their computation without any constraints. However, if the computing requirements of different lps are not balanced or if the processors are not homogeneous, some lps may lag behind in simulation time while others surge forward. In other words, if the simulation clocks of different lps are not progressing at the same rate, cascading rollbacks may occur nullifying the potential benefit of an optimistic parallel discrete event simulation (PDES). Hence it is necessary to balance the computational load on different lps in such a way that their local simulation clocks advance almost at the same rate. In this paper, we propose two algorithms for dynamic load balancing which reduce the number of rollbacks in an optimistic PDES system. Our first algorithm is based on the load transfer mechanism between lps; while the second algorithm, based on the principle of evolutionary strategy, migrates logical processes between several pairs of physical processors. We have implemented both of these algorithms on a cluster of heterogeneous workstations and studied their performance. The experimental results show that the algorithm based on the load transfer is effective when the grain size is greater than 10 milliseconds. The algorithm based on the process migration yields good performance only for grain sizes of 20 milliseconds or larger. In both of these cases the speed up ranges mostly between and 2 using four processors.

show abstract

A hypercube algorithm for GVT computation and its application in optimistic parallel simulation

Das

¹

,

Sarkar

²

Proceedings of Simulation Symposium

View full text Add to dashboard Cite

A performance study of the RPE mechanism for PDES

Cited by 3 publications

References 7 publications

Design and Implementation of DynamicLoad Balancing Algorithms for Rollback Reductionin Optimistic PDES

Design and Implementation of DynamicLoad Balancing Algorithms for Rollback Reductionin Optimistic PDES

Design and implementation of dynamic load balancing algorithms for rollback reduction in optimistic PDES

A hypercube algorithm for GVT computation and its application in optimistic parallel simulation

Contact Info

Product

Resources

About