Computing global functions in asynchronous distributed systems prone to process crashes

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI:10.1109/ICDCS.2000.840973

J. Hélary, M. Hurfin, A. Mostéfaoui, M. Raynal, F. Tronel

{"title":"Computing global functions in asynchronous distributed systems prone to process crashes","authors":"J. Hélary, M. Hurfin, A. Mostéfaoui, M. Raynal, F. Tronel","doi":"10.1109/ICDCS.2000.840973","DOIUrl":null,"url":null,"abstract":"Global data is a vector with one entry per process. Each entry must be filled with an appropriate value provided by the corresponding process. Several distributed computing problems amount to compute a function on global data. This paper proposes a protocol to solve such problems in the context of asynchronous distributed systems where processes may fail by crashing. The main problem that has to be solved lies in computing the global data and in providing each non-crashed process with a copy of it, despite the possible crash of some processes. To be consistent, the global data must contain (at least) all the values provided by the processes that do not crash. This defines the global data computation (GDC) problem. To solve this problem, processes execute a sequence of asynchronous rounds during which they construct (in a decentralized way) the value of the global data, and eventually each process gets a copy of it. To cope with process crashes, the protocol uses a perfect failure detector. The proposed protocol has been designed to be time-efficient. It allows early decisions. Let t be the maximum number of processes that may crash (t<n where n is the total number of processes) and f be the actual number of process crashes (f/spl les/t). In the worst case, the protocol terminates in min(2f+2,t+1) rounds. Moreover the protocol does not require processes to exchange information on their perception of crashes. The message size depends only on the size of the global data.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2000.840973","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

Abstract

Global data is a vector with one entry per process. Each entry must be filled with an appropriate value provided by the corresponding process. Several distributed computing problems amount to compute a function on global data. This paper proposes a protocol to solve such problems in the context of asynchronous distributed systems where processes may fail by crashing. The main problem that has to be solved lies in computing the global data and in providing each non-crashed process with a copy of it, despite the possible crash of some processes. To be consistent, the global data must contain (at least) all the values provided by the processes that do not crash. This defines the global data computation (GDC) problem. To solve this problem, processes execute a sequence of asynchronous rounds during which they construct (in a decentralized way) the value of the global data, and eventually each process gets a copy of it. To cope with process crashes, the protocol uses a perfect failure detector. The proposed protocol has been designed to be time-efficient. It allows early decisions. Let t be the maximum number of processes that may crash (t

查看原文本刊更多论文

在异步分布式系统中计算全局函数容易导致进程崩溃

全局数据是一个矢量，每个进程有一个入口。每个条目必须填写由相应进程提供的适当值。几个分布式计算问题相当于在全局数据上计算一个函数。本文提出了一种协议来解决异步分布式系统中进程可能因崩溃而失败的问题。必须解决的主要问题在于计算全局数据，并为每个未崩溃的进程提供数据的副本，尽管可能会有一些进程崩溃。为了保持一致，全局数据必须包含(至少)不会崩溃的进程提供的所有值。这定义了全局数据计算(GDC)问题。为了解决这个问题，进程执行一系列异步轮，在此期间，它们(以分散的方式)构造全局数据的值，最终每个进程都得到它的一个副本。为了处理进程崩溃，协议使用了一个完美的故障检测器。拟议的协议被设计为具有时间效率。它允许提前做出决定。设t为可能崩溃的最大进程数(t

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings 20th IEEE International Conference on Distributed Computing Systems

自引率

0.00%

发文量

京公网安备 11010802042870号

Book学术文献互助群
群号：604180095