首页> 外文会议>Algorithms and Computation >A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model
【24h】

A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model

机译:异步单写/多读共享存储模型中的转弯功能方案

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

摘要

We consider a set of users wishing to receive a service in an asynchronous distributed system. Such users declare their wishes and then wait to gain admittance to be served. Except for the initial transient period, at least one user must be waiting to be served, and the system should be as fair as possible for users. A procedure that ensures such a situation is called a turn function. It can be easily implemented in the asynchronous multi-writer/reader shared memory model. The turn function is useful to solve some problems concerning temporal orders within an asynchronous distributed system (e.g., the mutual exclusion problem and the k-exclusion problem). In this paper we propose an algorithm for the turn function that can be implemented in the single-writer/multi-reader shared memory model. Its implementation is simpler than the general method of simulating operations of multi-writer/reader shared variables by using a bounded concurrent time-stamp scheme in the single-writer/multi-reader shared memory model. We show the correctness of our algorithm and discuss its efficiency.
机译:我们考虑了一组希望在异步分布式系统中接收服务的用户。这些用户宣告自己的愿望,然后等待获得准许入场。除初始过渡期外,至少一个用户必须等待服务,并且该系统对于用户而言应尽可能公平。确保这种情况的过程称为转弯功能。它可以在异步多写入器/读取器共享内存模型中轻松实现。转弯功能对于解决与异步分布式系统中的时间顺序有关的一些问题(例如互斥问题和k排斥问题)很有用。在本文中,我们提出了一种可以在单写/多读共享内存模型中实现的转弯函数算法。它的实现比通过在单写入器/多读取器共享内存模型中使用有界并发时间戳方案来模拟多写入器/读取器共享变量的操作的通用方法更简单。我们展示了算法的正确性并讨论了其效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号