We define quittable consensus, a natural variation of the consensus problem, where processes have the option to agree on "quit" if failures occur, and we relate this problem to the well-known problem of nonb...
详细信息
We define quittable consensus, a natural variation of the consensus problem, where processes have the option to agree on "quit" if failures occur, and we relate this problem to the well-known problem of nonblocking atomic commit. We then determine the weakest failure detectors for these two problems in all environments, regardless of the number of faulty processes.
Motivated by the ideas of asynchronous relaxation algorithms this paper investigates optimal decision-making problems that exhibit decentralized characteristics. Such problems consist of a collection of interacting su...
详细信息
Motivated by the ideas of asynchronous relaxation algorithms this paper investigates optimal decision-making problems that exhibit decentralized characteristics. Such problems consist of a collection of interacting sub-systems, each one described by local properties and dynamics, joined together by the need to accomplish a common task which achieves overall optimal performance. Special properties of such systems that make them ideally suited for the framework of asynchronouscomputing are (a) the lack of a single overall objective describing the collective performance, and (b) the asynchronism in implementing topologically optimal decisions based on information which is local in space and time. A methodology for decentralized decision making is developed based on the solution of a series of sub-problems in which each minimizes a local objective while maximizing a common Lagrangian function, by generating independent approximations of an ascent direction in the space of the dual variables. The concepts are illustrated by means of motivating examples. (C) 1999 Elsevier Science Ltd. All rights reserved.
暂无评论