Self-adaptive logical processes: the probabilistic distributed simulation protocol
Self-adaptive logical processes: the probabilistic distributed simulation protocol
复制标题
自适应逻辑过程:概率分布式仿真协议
DOI:
10.1109/simsym.1994.283110
复制
发表时间:
1994
期刊:
影响因子:
--
通讯作者:
G. Chiola
中科院分区:
文献类型:
--
作者:
A. Ferscha;G. Chiola
A probabilistic distributed discrete event simulation strategy is developed as a performance efficient compromise between the two classical approaches in parallel and distributed simulation, the conservative and the optimistic approach. It weakens the conservative "block until safe-to-process"-rule in a sense that if the time instant of the occurrence of an external event is in the time interval /spl lsqb/s, t/spl rsqb/, it allows progressing simulation up until the forecasted next event instant t/spl circ/(O), s/spl les/t/spl circ/(O)/spl les/t, but further progression only with controlled probability. t/spl circ/(O) is an estimate based on the arrival instant differences O=(/spl deltasub 1/,/spl deltasub 2/,.../spl deltasub n/) observed during a time window by some logical (simulation) process. Compared to the optimistic strategy it prevents from propagating incorrect computations too far ahead into the simulated future, and thus avoids unnecessary communication overhead by breaking rollback cascades as early as possible. The arrival patterns observed in O are used to dynamically adapt the logical process' synchronization behavior at runtime, to what is the best tradeoff among blocking and optimistically progressing with respect to the parallelism inherent to the simulation model.<<ETX>>