Writing-all deterministically and optimally using a nontrivial number of asynchronous processors

Author:

Kowalski Dariusz R.1,Shvartsman Alexander A.2

Affiliation:

1. University of Liverpool, Liverpool, UK

2. University of Connecticut, Storrs, CT

Abstract

The problem of performing n tasks on p asynchronous or undependable processors is a basic problem in distributed computing. This article considers an abstraction of this problem called Write-All: using p processors write 1's into all locations of an array of size n . In this problem writing 1 abstracts the notion of performing a simple task. Despite substantial research, there is a dearth of efficient deterministic asynchronous algorithms for Write-All/ . Efficiency of algorithms is measured in terms of work that accounts for all local steps performed by the processors in solving the problem. Thus, an optimal algorithm would have work Θ( n ), however it is known that optimality cannot be achieved when p = Ω( n ). The quest then is to obtain work-optimal solutions for this problem using a nontrivial, compared to n , number of processors p . The algorithm presented in this article has work complexity of O ( n + p 2 + ϵ ), and it achieves work optimality for p = O ( n 1/(2 + ε) ) for any ε > 0, while the previous best result achieved optimality for p ≤4√ n /log n . Additionally, the new result uses only the atomic read/write memory, without resorting to using the test-and-set primitive that was necessary in the previous solution.

Funder

National Science Foundation

North Atlantic Treaty Organization

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Reference28 articles.

1. A theory of competitive analysis for distributed algorithms

2. Algorithms for the Certified Write-All Problem

3. Highly efficient asynchronous execution of large-grained parallel programs

4. Aumann Y. and Rabin M. O. 1994. Clock construction in fully asynchronous parallel systems and pram simulation. Theoret. Comput. Sci. 128 1&2 3--30. 10.1016/0304-3975(94)90162-7 Aumann Y. and Rabin M. O. 1994. Clock construction in fully asynchronous parallel systems and pram simulation. Theoret. Comput. Sci. 128 1&2 3--30. 10.1016/0304-3975(94)90162-7

5. Parallel Algorithms with Processor Failures and Delays

Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Asynchronous Adaptive Task Allocation;2015 IEEE 35th International Conference on Distributed Computing Systems;2015-06

2. Distributed Algorithms;Computing Handbook, Third Edition;2014-05-08

3. Solving the at-most-once problem with nearly optimal effectiveness;Theoretical Computer Science;2013-07

4. How to Allocate Tasks Asynchronously;2012 IEEE 53rd Annual Symposium on Foundations of Computer Science;2012-10

5. The Strong At-Most-Once Problem;Lecture Notes in Computer Science;2012

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3