大葉大學圖書館 |

Distributed computing pearls /

紀錄類型:	書目-電子資源 : Monograph/item
杜威分類號:	004.36
書名/作者:	Distributed computing pearls // Gadi Taubenfeld.
作者:	Taubenfeld, Gadi,
面頁冊數:	1 PDF (xv, 107 pages) : : illustrations.
附註:	Part of: Synthesis digital library of engineering and computer science.
標題:	Electronic data processing - Distributed processing.
ISBN:	9781681733494
書目註:	Includes bibliographical references (pages 95-102) and index.
內容註:	1. Distributed computing -- 1.1 Winds of change -- 1.2 The internet -- 1.3 Computers with multiple processors -- 1.4 Synchronization -- 1.5 Why is synchronization difficult? -- 1.6 Algorithms and programs -- 1.7 Concurrent and distributed algorithms -- 1.8 Impossibility results -- 1.9 Chapter notes --
摘要、提要註:	Computers and computer networks are one of the most incredible inventions of the 20th century, having an ever-expanding role in our daily lives by enabling complex human activities in areas such as entertainment, education, and commerce. One of the most challenging problems in computer science for the 21st century is to improve the design of distributed systems where computing devices have to work together as a team to achieve common goals. In this book, I have tried to gently introduce the general reader to some of the most fundamental issues and classical results of computer science underlying the design of algorithms for distributed systems, so that the reader can get a feel of the nature of this exciting and fascinating field called distributed computing. The book will appeal to the educated layperson and requires no computer-related background. I strongly suspect that also most computer-knowledgeable readers will be able to learn something new.
電子資源:	https://ieeexplore.ieee.org/servlet/opac?bknumber=8358863

Distributed computing pearls /
Taubenfeld, Gadi,

Distributed computing pearls /Gadi Taubenfeld. - 1 PDF (xv, 107 pages) :illustrations. - Synthesis lectures on distributed computing theory,# 142155-1634 ;. - Synthesis digital library of engineering and computer science..

Part of: Synthesis digital library of engineering and computer science.

Includes bibliographical references (pages 95-102) and index.

1. Distributed computing -- 1.1 Winds of change -- 1.2 The internet -- 1.3 Computers with multiple processors -- 1.4 Synchronization -- 1.5 Why is synchronization difficult? -- 1.6 Algorithms and programs -- 1.7 Concurrent and distributed algorithms -- 1.8 Impossibility results -- 1.9 Chapter notes --

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Compendex

Computers and computer networks are one of the most incredible inventions of the 20th century, having an ever-expanding role in our daily lives by enabling complex human activities in areas such as entertainment, education, and commerce. One of the most challenging problems in computer science for the 21st century is to improve the design of distributed systems where computing devices have to work together as a team to achieve common goals. In this book, I have tried to gently introduce the general reader to some of the most fundamental issues and classical results of computer science underlying the design of algorithms for distributed systems, so that the reader can get a feel of the nature of this exciting and fascinating field called distributed computing. The book will appeal to the educated layperson and requires no computer-related background. I strongly suspect that also most computer-knowledgeable readers will be able to learn something new.

Mode of access: World Wide Web.

ISBN: 9781681733494

Standard No.: 10.2200/S00845ED1V01Y201804DCT014doiSubjects--Topical Terms:

404378
Electronic data processing
--Distributed processing.Subjects--Index Terms:

algorithmsIndex Terms--Genre/Form:

336502
Electronic books.

LC Class. No.: QA76.9.D5 / T283 2018

Dewey Class. No.: 004.36

Distributed computing pearls /
LDR:06410nmm 2200829 i 4500 001 509172
003 IEEE
005 20180526171703.0
006 m eo d
007 cr cn |||m|||a
008 210514s2018 caua foab 001 0 eng d
020 $a 9781681733494 $q PDF
020 $z 9781681733517 $q ePub
020 $z 9781681733487 $q paperback
020 $z 9781681733500 $q hardcover
024 7 $a 10.2200/S00845ED1V01Y201804DCT014 $2 doi
035 $a (CaBNVSL)swl408343
035 $a (OCoLC)1037800691
035 $a 8358863
040 $a CaBNVSL $b eng $e rda $c CaBNVSL $d CaBNVSL
050 4 $a QA76.9.D5 $b T283 2018
082 0 4 $a 004.36 $2 23
100 1 $a Taubenfeld, Gadi, $e author. $3 729065
245 1 0 $a Distributed computing pearls / $c Gadi Taubenfeld.
264 1 $a [San Rafael, California] : $b Morgan & Claypool, $c 2018.
300 $a 1 PDF (xv, 107 pages) : $b illustrations.
336 $a text $2 rdacontent
337 $a electronic $2 isbdmedia
338 $a online resource $2 rdacarrier
490 1 $a Synthesis lectures on distributed computing theory, $x 2155-1634 ; $v # 14
500 $a Part of: Synthesis digital library of engineering and computer science.
504 $a Includes bibliographical references (pages 95-102) and index.
505 0 $a 1. Distributed computing -- 1.1 Winds of change -- 1.2 The internet -- 1.3 Computers with multiple processors -- 1.4 Synchronization -- 1.5 Why is synchronization difficult? -- 1.6 Algorithms and programs -- 1.7 Concurrent and distributed algorithms -- 1.8 Impossibility results -- 1.9 Chapter notes --
505 8 $a 2. One loaf of bread, please -- 2.1 The too much bread problem -- 2.2 Applications -- 2.3 First attempt -- 2.4 Second attempt -- 2.5 Third attempt -- 2.6 Fourth attempt: a correct solution -- 2.7 Communicating by reading and writing of notes -- 2.8 Chapter notes -- 2.9 Self review --
505 8 $a 3. A tale of two lovers -- 3.1 The two lovers problem -- 3.2 Applications -- 3.3 A surprising impossibility result -- 3.4 further explanations -- 3.5 Chapter notes -- 3.6 Self review --
505 8 $a 4. A night at the movies -- 4.1 The movie agreement problem -- 4.2 Applications -- 4.3 A surprising impossibility result -- 4.4 A more general result -- 4.5 An algorithm -- 4.6 Further explanations -- 4.7 How many rounds are needed? -- 4.8 Chapter notes -- 4.9 Self review --
505 8 $a 5. The fall of the Byzantine Empire -- 5.1 The Byzantine generals problem -- 5.2 Applications -- 5.3 A surprising result -- 5.4 An algorithm -- 5.5 Further explanations -- 5.6 Chapter notes -- 5.7 Self review --
505 8 $a 6. Sightseeing in Paris -- 6.1 The choice coordination problem -- 6.2 Applications -- 6.3 A randomized algorithm -- 6.4 Further explanations -- 6.5 A simple deterministic algorithm -- 6.6 Perfectionism, it seems, does not pay! -- 6.7 Chapter notes -- 6.8 Self review --
505 8 $a 7. Food for thought -- 7.1 The dining philosophers problem -- 7.2 Applications -- 7.3 Deadlock prevention: the total order technique -- 7.4 Hold and wait strategy: the LR algorithm -- 7.5 Hold and wait strategy: the LLR algorithm -- 7.6 Wait and release strategy: the wait/release algorithm -- 7.7 Wait and release strategy: a randomized algorithm -- 7.8 Chapter notes -- 7.9 Self review --
505 8 $a 8. All for one and one for all -- 8.1 The see-saw puzzle -- 8.2 Applications -- 8.3 The kids' first plan -- 8.4 The kids' second plan -- 8.5 The kids' final plan -- 8.6 Further explanations -- 8.7 Chapter notes -- 8.8 Self review --
505 8 $a 9. The world is a playground -- 9.1 The green-or-blue game -- 9.2 Applications -- 9.3 Two observations -- 9.4 The kids' plan -- 9.5 Further explanations -- 9.6 An alternative plan -- 9.7 The queen's new challenge -- 9.8 A surprising impossibility result -- 9.9 The queen's final challenge -- 9.10 General impossibility results -- 9.11 Chapter notes -- 9.12 Self review --
505 8 $a 10. Getting the service you deserve -- 10.1 The two tellers problem -- 10.2 Applications -- 10.3 First attempt: a solution which cannot tolerate a single fault -- 10.4 Second attempt: a correct solution -- 10.5 How many notes are needed? -- 10.6 Chapter notes -- 10.7 Self review --
505 8 $a Bibliography -- Author's biography -- Index.
506 $a Abstract freely available; full-text restricted to subscribers or individual document purchasers.
510 0 $a Compendex
510 0 $a INSPEC
510 0 $a Google scholar
510 0 $a Google book search
520 3 $a Computers and computer networks are one of the most incredible inventions of the 20th century, having an ever-expanding role in our daily lives by enabling complex human activities in areas such as entertainment, education, and commerce. One of the most challenging problems in computer science for the 21st century is to improve the design of distributed systems where computing devices have to work together as a team to achieve common goals. In this book, I have tried to gently introduce the general reader to some of the most fundamental issues and classical results of computer science underlying the design of algorithms for distributed systems, so that the reader can get a feel of the nature of this exciting and fascinating field called distributed computing. The book will appeal to the educated layperson and requires no computer-related background. I strongly suspect that also most computer-knowledgeable readers will be able to learn something new.
530 $a Also available in print.
538 $a Mode of access: World Wide Web.
588 $a Title from PDF title page (viewed on May 25, 2018).
650 0 $a Electronic data processing $x Distributed processing. $3 404378
653 $a algorithms
653 $a distributed algorithms
653 $a synchronization
653 $a agreement
653 $a consensus
653 $a synchronous
653 $a asynchronous
653 $a randomized algorithms
653 $a Byzantine agreement
653 $a choice coordination
653 $a the see-saw puzzle
653 $a the two lovers problem
653 $a the two generals problem
653 $a the too much bread problem
653 $a deadlock
653 $a dining philosophers
653 $a mutual exclusion
653 $a barrier synchronization
653 $a crash failures
653 $a Byzantine failures
655 0 $a Electronic books. $2 local $3 336502
776 0 8 $i Print version: $z 9781681733487 $z 9781681733500
830 0 $a Synthesis digital library of engineering and computer science. $3 461208
830 0 $a Synthesis lectures on distributed computing theory ; $v #5. $3 628446
856 4 2 $3 Abstract with links to resource $u https://ieeexplore.ieee.org/servlet/opac?bknumber=8358863