• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Bounded-Bypass Mutual Exclusion with Minimum Number of Registers
【24h】

Bounded-Bypass Mutual Exclusion with Minimum Number of Registers

机译：寄存器数量最少的有界绕过互斥

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

摘要

A mutual exclusion mechanism that is both fair and space efficient can be highly valuable for shared memory systems under time and memory constraints such as embedded real-time systems. Several algorithms that utilize only one shared variable and guarantee a certain level of fairness have been proposed. However, these use hypothetical read-modify-write operations that have never been implemented in any system. This paper presents two fair algorithms that do not use such operations, each of which uses a single additional shared variable. The proposed algorithms employ commonly available operations, fetch&store and read/write, on two shared variables. The first algorithm satisfies the bounded-bypass condition. The second is an improvement on the first that satisfies the FIFO condition, which is the most stringent fairness condition. Additionally, it is shown that achieving the bounded-bypass condition using the same set of operations requires two shared variables. Both of the algorithms are thus optimal with respect to the number of shared variables.
机译：公平且节省空间的互斥机制对于在时间和内存约束下的共享内存系统（例如嵌入式实时系统）非常有价值。已经提出了几种仅利用一个共享变量并保证一定程度的公平性的算法。但是，这些使用假设性的读-修改-写操作，从未在任何系统中实现过。本文提出了两种不使用此类运算的公平算法，每个算法都使用单个附加共享变量。所提出的算法在两个共享变量上采用了常见的操作，即获取和存储以及读/写。第一种算法满足有界绕行条件。第二个是对第一个的改进，它满足了FIFO条件，这是最严格的公平性条件。此外，它表明使用同一组操作来实现有界绕过条件需要两个共享变量。因此，两种算法在共享变量的数量上都是最佳的。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号