.png){kind=icon}
返回
An optimal algorithm for global termination detection in shared-memory asynchronous multiprocessor systems
.png){kind=icon}
OA
AI
DOI：10.1109/71.598280.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the literature, the problem of global termination detection in parallel systems is usually solved by message passing. In shared-memory systems, this problem can also be solved by using exclusively accessible variables with locking mechanisms. In this paper, we present an algorithm that solves the problem of global termination detection in shared-memory asynchronous multiprocessor systems without using locking. We assume a reasonable computation model in which concurrent reading does not require locking and concurrent writing different values without locking results in an arbitrary one of the values being actually written. For a system of n processors, the algorithm allocates a working space of 2n + 1 bits. The worst case time complexity of the algorithm is n + 2 root n + 1, which we prove is the lower bound under a reasonable model of computation.
Keyword:
termination detect
shared-memory multiprocessor systems
optimality
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
Similarity judgments and cortical visual responses reflect different properties of object and scene categories in naturalistic images.png)
NeuroImageOAAI
NeuroImageIF0
OAAI分享收藏Age‐Related Changes in Morphology and Function of Scapular Muscles in Asymptomatic PeoplePM&R
PM&RIF0
PREAI
分享收藏 没有更多内容
没有更多内容