首页> 外文会议>PODC'11 : Proceedings of the 2011 ACM symposium on principles of distributed computing. >Brief Announcement: A Nonblocking Set Optimized for Querying the Minimum Value
【24h】

Brief Announcement: A Nonblocking Set Optimized for Querying the Minimum Value

机译:简要公告:为查询最小值而优化的非阻塞集

获取原文
获取原文并翻译 | 示例

摘要

Shared memory run-time systems, such as garbage collectors (GC) and trsnsactional memory (TM) [2], often require global coordination. To keep costs low, designers of these systems identify a tradeoff that can prevent bottlenecks without affecting the common case, usually by optimizing the run time of one operation at the expense of other operations.
机译:共享内存运行时系统,例如垃圾收集器(GC)和事务存储(TM)[2],通常需要全局协调。为了保持较低的成本,这些系统的设计人员确定了一个折衷方案,可以在不影响常见情况的情况下避免瓶颈,这通常是通过优化一个操作的运行时间而以其他操作为代价的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号