AI帮你理解科学

AI 生成解读视频

AI抽取解析论文重点内容自动生成视频


pub
生成解读视频

AI 溯源

AI解析本论文相关学术脉络


Master Reading Tree
生成 溯源树

Wait-free algorithms for fast, long-lived renaming

Sci. Comput. Program., no. 1 (1995): 1-39

被引用110|浏览13
EI
下载 PDF 全文
引用

摘要

In the classic “one-time” renaming problem, processes are required to choose new names in order to reduce the size of their name space. We introduce a new, more general version of the renaming problem called “long-lived” renaming, in which processes may repeatedly acquire and release names. We also present several wait-free algorithms for...更多

代码

数据

您的评分 :
0

 

标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn
小科