arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.03141cs.PLcs.DS
收藏

高效动态算法预测短赛事

Efficient Dynamic Algorithms to Predict Short Races

University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校)

Minjian Zhang, Mahesh Viswanathan

AI总结:

本文提出高效动态算法用于预测短赛事,针对发生在之前和同步保持的赛事类型,实现更高效的检测与更低的内存消耗。

摘要:

我们介绍了检测观察轨迹中短赛事的问题。具体来说,对于一种赛事类型R,给定一个轨迹σ和窗口大小w,任务是确定是否存在一个R-赛事(e₁,e₂)在σ中,使得从e₁开始到e₂结束的子轨迹包含至多w个事件。我们提出了一个用于短赛事预测的监控框架,并将该框架实例化为发生在之前和同步保持的赛事,从而得到高效的检测算法。我们的发生在之前算法运行时间与FastTrack相同,但使用的空间规模随log w变化,而非log |σ|。对于同步保持的赛事,我们的算法运行速度更快,消耗的内存显著少于SyncP。我们的实验验证了这些短赛事检测算法的有效性:它们运行更高效,使用更少的内存,并在相同的预算下检测到显著更多的赛事,提供了资源使用和预测能力之间的合理平衡。

英文摘要:

We introduce and study the problem of detecting short races in an observed trace. Specifically, for a race type $R$, given a trace $σ$ and window size $w$, the task is to determine whether there exists an $R$-race $(e_1, e_2)$ in $σ$ such that the subtrace starting with $e_1$ and ending with $e_2$ contains at most $w$ events. We present a monitoring framework for short-race prediction and instantiate the framework for happens-before and sync-preserving races, yielding efficient detection algorithms. Our happens-before algorithm runs in the same time as FastTrack but uses space that scales with $\log w$ as opposed to $\log |σ|$. For sync-preserving races, our algorithm runs faster and consumes significantly less space than SyncP. Our experiments validate the effectiveness of these short-race detection algorithms: they run more efficiently, use less memory, and detect significantly more races under the same budget, offering a reasonable balance between resource usage and predictive power.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑