Grain sensitive event scheduling in time warp parallel discrete event simulation
Grain sensitive event scheduling in time warp parallel discrete event simulation
复制标题
时间扭曲并行离散事件仿真中的粒度敏感事件调度
DOI：
--
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
V. Cortellessa
中科院分区：
文献类型：
--
作者：
F. Quaglia;V. Cortellessa
在时间扭曲并行离散事件仿真中，已经提出了几种调度算法来确定下一个要在处理器上执行的事件。然而，没有一个是专门为模拟设计的，其中不同类型的事件的执行时间（或粒度）有很大的差异。我们提出了一个粮食敏感的调度算法，解决这个问题。在我们的解决方案中，调度决策取决于时间戳和粒度值，目的是为小粒度事件提供更高的优先级，即使它们的时间戳不是最低的时间戳（即最接近模拟的承诺范围）。这隐含地限制了执行大粒度事件的乐观性，如果回滚，将产生大量的CPU时间浪费。该算法是自适应的，因为它依赖于动态重新计算模拟时间窗口的长度，在该模拟时间窗口内，用于调度的任何好的候选事件的时间戳福尔斯。如果窗口长度设置为零，则算法的行为类似于标准的最低时间戳优先（LTF）调度算法。一个经典的基准在几种不同的配置的仿真结果与LTF的性能比较报告：这些结果证明了我们的算法的有效性。
Several scheduling algorithms have been proposed to determine the next event to be executed on a processor in a time warp parallel discrete event simulation. However none of them is specifically designed for simulations where the execution time (or granularity) for different types of events has large variance. We present a grain sensitive scheduling algorithm which addresses this problem. In our solution, the scheduling decision depends on both timestamp and granularity values with the aim at giving higher priority to small grain events even if their timestamp is not the lowest one (i.e. the closest one to the commitment horizon of the simulation). This implicitly limits the optimism of the execution of large grain events that, if rolled back, would produce a large waste of CPU time. The algorithm is adaptive in that it relies on the dynamic recalculation of the length of a simulated time window within which the timestamp of any good candidate event for the scheduling falls in. If the window length is set to zero, then the algorithm behaves like the standard Lowest-Timestamp-First (LTF) scheduling algorithm. Simulation results of a classical benchmark in several different configurations are reported for a performance comparison with LTF: these results demonstrate the effectiveness of our algorithm.