当前位置: X-MOL 学术J. Sched. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Scheduling computations with provably low synchronization overheads
Journal of Scheduling ( IF 2 ) Pub Date : 2021-10-21 , DOI: 10.1007/s10951-021-00706-6
Guilherme Rito 1 , Hervé Paulino 2
Affiliation  

We present a Work Stealing scheduling algorithm that provably avoids most synchronization overheads by keeping processors’ deques entirely private by default and only exposing work when requested by thieves. This is the first paper that obtains bounds on the synchronization overheads that are (essentially) independent of the total amount of work, thus corresponding to a great improvement, in both algorithm design and theory, over state-of-the-art Work Stealing algorithms. Consider any computation with work \(T_{1}\) and critical-path length \(T_{\infty }\) executed by P processors using our scheduler. Our analysis shows that the expected execution time is \(O\left( \frac{T_{1}}{P} + T_{\infty }\right) \), and the expected synchronization overheads incurred during the execution are at most \(O\left( \left( C_{\mathrm{CAS}} + C_{\mathrm{MFence}}\right) PT_{\infty }\right) \), where \(C_{\mathrm{CAS}}\) and \(C_{\mathrm{MFence}}\), respectively, denote the maximum cost of executing a Compare-And-Swap instruction and a Memory Fence instruction.



中文翻译:

以可证明的低同步开销调度计算

我们提出了一种工作窃取调度算法,该算法通过在默认情况下保持处理器的双端队列完全私有并且仅在窃贼请求时才公开工作,从而避免了大多数同步开销。这是第一篇获得(基本上)独立于工作总量的同步开销界限的论文,因此对应于算法设计和理论方面的巨大改进,优于最先进的工作窃取算法. 考虑使用我们的调度程序由P 个处理器执行的工作\(T_{1}\)和关键路径长度\(T_{\infty }\) 的任何计算。我们的分析表明,预期执行时间为\(O\left( \frac{T_{1}}{P} + T_{\infty }\right) \),并且在执行过程中产生的预期同步开销最多为\(O\left( \left( C_{\mathrm{CAS}} + C_{\mathrm{MFence}}\right) PT_{\infty }\right) \),其中\(C_{\mathrm{CAS}}\)\(C_{\mathrm{MFence}}\)分别表示执行 Compare-And-Swap 指令和 Memory Fence 指令的最大成本.

更新日期:2021-10-22
down
wechat
bug