IEEE Trans. Parallel Distributed Syst.最新文献_第2页

On k-set consensus problems in asynchronous systems 异步系统中的k集一致性问题

IEEE Trans. Parallel Distributed Syst. Pub Date : 1999-05-01 DOI: 10.1145/301308.301368

R. Prisco, D. Malkhi, M. Reiter

{"title":"On k-set consensus problems in asynchronous systems","authors":"R. Prisco, D. Malkhi, M. Reiter","doi":"10.1145/301308.301368","DOIUrl":"https://doi.org/10.1145/301308.301368","url":null,"abstract":"In this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value and by the end of the protocol must decide on one value so that at most k total values are decided by all correct processes. We extend previous work by exploring several variations of the problem definition and model, including for the first time investigation of Byzantine failures. We show that the precise definition of the validity requirement, which characterizes what decision values are allowed as a function of the input values and whether failures occur, is crucial to the solvability of the problem. For example, we show that allowing default decisions in case of failures makes the problem solvable for most values of k despite a minority of failures, even in face of the most severe type of failures (Byzantine). We introduce six validity conditions for this problem (all considered in various contexts in the literature), and demarcate the line between possible and impossible for each case. In many cases, this line is different from the one of the originally studied k-set consensus problem. Index Terms—Agreement problems, Byzantine failures, consensus, crash failures, distributed systems, validity conditions. E","PeriodicalId":13128,"journal":{"name":"IEEE Trans. Parallel Distributed Syst.","volume":"73 1","pages":"7-21"},"PeriodicalIF":0.0,"publicationDate":"1999-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74819665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 38

Mutable checkpoints: a new checkpointing approach for mobile computing systems 可变检查点:移动计算系统的一种新的检查点方法

IEEE Trans. Parallel Distributed Syst. Pub Date : 1999-05-01 DOI: 10.1145/301308.301371

G. Cao, M. Singhal

{"title":"Mutable checkpoints: a new checkpointing approach for mobile computing systems","authors":"G. Cao, M. Singhal","doi":"10.1145/301308.301371","DOIUrl":"https://doi.org/10.1145/301308.301371","url":null,"abstract":"Mobile computing raises many new issues such as lack of stable storage, low bandwidth of wireless channel, high mobility, and limited battery life. These new issues make traditional checkpointing algorithms unsuitable. Coordinated checkpointing is an attractive approach for transparently adding fault tolerance to distributed applications since it avoids domino effects and minimizes the stable storage requirement. However, it suffers from high overhead associated with the checkpointing process in mobile computing systems. Two approaches have been used to reduce the overhead: First is to minimize the number of synchronization messages and the number of checkpoints; the other is to make the checkpointing process nonblocking. These two approaches were orthogonal previously until the Prakash-Singhal algorithm (28) combined them. However, we (8) found that this algorithm may result in an inconsistency in some situations and we proved that there does not exist a nonblocking algorithm which forces only a minimum number of processes to take their checkpoints. In this paper, we introduce the concept of \"mutable checkpoint,\" which is neither a tentative checkpoint nor a permanent checkpoint, to design efficient checkpointing algorithms for mobile computing systems. Mutable checkpoints can be saved anywhere, e.g., the main memory or local disk of MHs. In this way, taking a mutable checkpoint avoids the overhead of transferring large amounts of data to the stable storage at MSSs over the wireless network. We present techniques to minimize the number of mutable checkpoints. Simulation results show that the overhead of taking mutable checkpoints is negligible. Based on mutable checkpoints, our nonblocking algorithm avoids the avalanche effect and forces only a minimum number of processes to take their checkpoints on the stable storage.","PeriodicalId":13128,"journal":{"name":"IEEE Trans. Parallel Distributed Syst.","volume":"17 3","pages":"157-172"},"PeriodicalIF":0.0,"publicationDate":"1999-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91487051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 189

A simple local-spin group mutual exclusion algorithm 一个简单的局部自旋群互斥算法

IEEE Trans. Parallel Distributed Syst. Pub Date : 1999-05-01 DOI: 10.1145/301308.301319

P. Keane, Mark Moir

引用次数: 88

Guest Editors' Introduction: Special Issue on Compilers and Languages for Parallel and Distributed Computers 特邀编辑导言:并行和分布式计算机的编译器和语言特刊

IEEE Trans. Parallel Distributed Syst. Pub Date : 1999-01-01 DOI: 10.1109/TPDS.1999.10002

Yingchun Zhu, L. Hendren

引用次数: 0

LoGPC: modeling network contention in message-passing programs 在消息传递程序中建模网络争用

IEEE Trans. Parallel Distributed Syst. Pub Date : 1998-06-01 DOI: 10.1145/277851.277933

C. A. Moritz, M. Frank

引用次数: 159

Editorial Board Changes 编辑委员会的变动

IEEE Trans. Parallel Distributed Syst. Pub Date : 1996-01-01 DOI: 10.1109/TPDS.1996.10000

Samuel Forest

引用次数: 0

Introduction of New Associate Editor 新副主编简介

IEEE Trans. Parallel Distributed Syst. Pub Date : 1994-09-01 DOI: 10.1109/TPDS.1994.10002

D. Lawrie

引用次数: 0

Experiences with parallel N-body simulation 有平行n体仿真经验

IEEE Trans. Parallel Distributed Syst. Pub Date : 1994-08-01 DOI: 10.1145/181014.181081

Pangfeng Liu, S. Bhatt

{"title":"Experiences with parallel N-body simulation","authors":"Pangfeng Liu, S. Bhatt","doi":"10.1145/181014.181081","DOIUrl":"https://doi.org/10.1145/181014.181081","url":null,"abstract":"This paper describes our experiences developing high-performance code for astrophysical N-body simulations. Recent N-body methods are based on an adaptive tree structure. The tree must be built and maintained across physically distributed memory; moreover, the communication requirements are irregular and adaptive. Together with the need to balance the computational work-load among processors, these issues pose interesting challenges and tradeoffs for high-performance implementation.\u0000Our implementation was guided by the need to keep solutions simple and general. We use a technique for implicitly representing a dynamic global tree across multiple processors which substantially reduces the programming complexity as well as the performance overheads of distributed memory architectures. The contributions include methods to vectorize the computation and minimize communication time which are theoretically and experimentally justified.\u0000The code has been tested by varying the number and distribution of bodies on different configurations of the Connection Machine CM-5. The overall performance on instances with 10 million bodies is typically over 30% of the peak machine rate. Preliminary timings compare favorably with other approaches.","PeriodicalId":13128,"journal":{"name":"IEEE Trans. Parallel Distributed Syst.","volume":"83 1","pages":"1306-1323"},"PeriodicalIF":0.0,"publicationDate":"1994-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74189078","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 74

Editor's Notice 编辑的通知

IEEE Trans. Parallel Distributed Syst. Pub Date : 1994-01-01 DOI: 10.1109/TPDS.1994.10001

D. Lawrie

引用次数: 0

Randomized routing with shorter paths 具有较短路径的随机路由

IEEE Trans. Parallel Distributed Syst. Pub Date : 1993-08-01 DOI: 10.1145/165231.166106

E. Upfal, S. A. Felperin, M. Snir

引用次数: 8