• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Lock-Free and Wait-Free Slot Scheduling Algorithms
【24h】

Lock-Free and Wait-Free Slot Scheduling Algorithms

机译：无锁和无等待时隙调度算法

获取原文
获取原文并翻译 | 示例
       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, we consider the design space of parallel non-blocking slot scheduling algorithms. Slot schedulers divide time into discrete quanta called , and schedule resources at the granularity of slots. They are typically used in high throughput I/O systems, data centers, video servers, and network drivers. We propose a family of parallel slot scheduling problems of increasing complexity, and then propose parallel lock-free and wait-free algorithms to solve them. In specific, we propose problems that can reserve, as well as free a set of contiguous slots in a non-blocking manner. We show that in a system with 64 threads, it is possible to get speedups of 10X by using lock-free algorithms as compared to a baseline implementation that uses locks. We additionally propose wait-free algorithms, whose mean performance is roughly the same as the version with locks. However, they suffer from significantly lower jitter and ensure a high degree of fairness among threads.
机译：在本文中，我们考虑了并行无阻塞时隙调度算法的设计空间。时隙调度程序将时间划分为称为的离散量，并以时隙的粒度调度资源。它们通常用于高吞吐量I / O系统，数据中心，视频服务器和网络驱动程序。我们提出了一系列复杂度越来越高的并行时隙调度问题，然后提出了并行无锁和无等待算法来解决这些问题。具体而言，我们提出了可以保留的问题，并且可以以非阻塞的方式释放一组连续的时隙。我们证明，在具有64个线程的系统中，与使用锁的基准实现相比，使用无锁算法可以使速度提高10倍。我们还提出了免等待算法，其平均性能与带锁的平均性能大致相同。但是，它们的抖动明显降低，并确保线程之间的高度公平。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号