首页    期刊浏览 2024年09月15日 星期日
登录注册

文章基本信息

  • 标题:Read-Write Memory and k-Set Consensus as an Affine Task
  • 本地全文:下载
  • 作者:Eli Gafni ; Yuan He ; Petr Kuznetsov
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2017
  • 卷号:70
  • 页码:6:1-6:17
  • DOI:10.4230/LIPIcs.OPODIS.2016.6
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:The wait-free read-write memory model has been characterized as an iterated Immediate Snapshot (IS) task. The IS task is affine - it can be defined as a (sub)set of simplices of the standard chromatic subdivision. In this paper, we highlight the phenomenon of a "natural" model that can be captured by an iterated affine task and, thus, by a subset of runs of the iterated immediate snapshot model. We show that the read-write memory model in which, additionally, k-set-consensus objects can be used is "natural" by presenting the corresponding simple affine task captured by a subset of 2-round IS runs. As an "unnatural" example, the model using the abstraction of Weak Symmetry Breaking (WSB) cannot be captured by a set of IS runs and, thus, cannot be represented as an affine task. Our results imply the first combinatorial characterization of models equipped with abstractions other than read-write memory that applies to generic tasks.
  • 关键词:iterated affine tasks; k-set consensus; k-concurrency; simplicial complexes; immediate snapshot
国家哲学社会科学文献中心版权所有