文章基本信息

标题：On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects
本地全文：下载
作者：David Yu Cheng Chan ; Vassos Hadzilacos ; Sam Toueg 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：91
页码：12:1-12:14
DOI：10.4230/LIPIcs.DISC.2017.12
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：We first prove that there are uncountably many objects with distinct computational powers. More precisely, we show that there is an uncountable set of objects such that for any two of them, at least one cannot be implemented from the other (and registers) in a wait-free manner. We then strengthen this result by showing that there are uncountably many linearizable objects with distinct computational powers. To do so, we prove that for all positive integers n and k, there is a linearizable object that is computationally equivalent to the k-set agreement task among n processes. To the best of our knowledge, these are the first linearizable objects proven to be computationally equivalent to set agreement tasks.
关键词：Set Agreement; Asynchronous System; Shared Memory