東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Distributed systems of simple intera...

Yale University.

FindBook

Google Book

Amazon

博客來

Distributed systems of simple interacting agents.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Distributed systems of simple interacting agents./
作者:	Jiang, Hong.
面頁冊數:	115 p.
附註:	Adviser: Michael J. Fischer.
Contained By:	Dissertation Abstracts International68-12B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3293331
ISBN:	9780549372646

Distributed systems of simple interacting agents.
Jiang, Hong.

Distributed systems of simple interacting agents. - 115 p.

Adviser: Michael J. Fischer.

Thesis (Ph.D.)--Yale University, 2007.

Fault-tolerance is a critical requirement for most tasks in the systems we consider. We study fault-tolerance in this model from two aspects: self-stabilization and distributed consensus.

ISBN: 9780549372646Subjects--Topical Terms:

626642
Computer Science.

Distributed systems of simple interacting agents.
LDR:03151nam 2200313 a 45 001 852952
005 20100701
008 100701s2007 ||||||||||||||||| ||eng d
020 $a 9780549372646
035 $a (UMI)AAI3293331
035 $a AAI3293331
040 $a UMI $c UMI
100 1 $a Jiang, Hong. $3 1019090
245 1 0 $a Distributed systems of simple interacting agents.
300 $a 115 p.
500 $a Adviser: Michael J. Fischer.
500 $a Source: Dissertation Abstracts International, Volume: 68-12, Section: B, page: 8133.
502 $a Thesis (Ph.D.)--Yale University, 2007.
520 $a Fault-tolerance is a critical requirement for most tasks in the systems we consider. We study fault-tolerance in this model from two aspects: self-stabilization and distributed consensus.
520 $a Based on earlier research on population protocols, we establish a theoretical model to study distributed systems of simple anonymous interacting agents. We define global fairness to model nondeterministic scheduling in loosely-coupled distributed systems and show that global fairness is a realistic assumption and useful abstraction in many circumstances.
520 $a Self-stabilization is a way to design algorithms that tolerate arbitrary transient faults. In the type of systems we study, most of the known algorithms and even problem definitions are no longer applicable. We give the appropriate definitions and present self-stabilizing algorithms for a number of important problems including token circulation, distance-2 coloring, ring orientation, spanning-tree construction, and leader election, with some constraints on the underlying interaction graph or external inputs.
520 $a To achieve constant-space uniform self-stabilizing leader election in rings under the assumption of global fairness, we introduce the failure detector O? to provide the agents with limited eventually-correct global information concerning the presence or absence of leader(s). O? can be implemented in practice with simple mechanisms such as timeouts. On the other hand, uniform self-stabilizing leader election is impossible, under local fairness, even with the help of O?.
520 $a It is known that consensus is impossible in the presence of even one crash failure in an asynchronous system. We define a nonterminating version of the consensus problem appropriate to our model of computation called stabilizing consensus which allows the inputs and outputs to change over time and requires the outputs of non-faulty agents to eventually reach agreement if the inputs of non-faulty agents stabilize. We present stabilizing-consensus algorithms in the presence of both crash failures and Byzantine failures. To tolerate Byzantine failures, it is necessary to augment agents with partial identifiers, and the number of Byzantine faults must be less than one-third of the total number of distinct identifiers.
590 $a School code: 0265.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 $a Yale University. $3 515640
773 0 $t Dissertation Abstracts International $g 68-12B.
790 $a 0265
790 1 0 $a Fischer, Michael J., $e advisor
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3293331