| R. Bagrodia, V. Jha, and M. Takai, Performance Evaluation of Conservative Algorithms in Parallel Simulation Languages, Tech. Report CSD 980026, Computer Science Dept., UCLA, 1998. |
....with each other. The time at which the two servers will communicate is known in advance based on the pre sampled reconciliation times. One possible solution is to introduce dynamic topology changes as the simulation proceeds, such that the connectivity of a server is modified based on its state [2]. However, an alternative solution is to use destination specific lookahead: each entity can specify unique lookahead values for each of its destinations [7] This provides the same functionality as dynamic topology changes as illustrated by the following: suppose entity A decides to disconnect ....
R. Bagrodia, V. Jha, and M. Takai, "Performance Evaluation of Conservative Algorithms in Parallel Simulation Languages," Technical Report, UCLA CS Department - 980026.
No context found.
R. Bagrodia, V. Jha, and M. Takai, Performance Evaluation of Conservative Algorithms in Parallel Simulation Languages, Tech. Report CSD 980026, Computer Science Dept., UCLA, 1998.
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