000			nam a22 7a 4500
999			_c29115 _d29115
008			180820b xxu||||| |||| 00| 0 eng d
020			_a9781681733487
082			_a004.36 _bTAU
100			_aTaubenfeld, Gadi
245			_aDistributed Computing Pearls
260			_bMorgan & Claypool, _c2018 _aUK:
300			_axv, 107 p. : _bill.; _c23 cm.
365			_aUS$ _b54.95
440			_aSynthesis lectures on distributed computing theory # 14
504			_aIncludes bibliographical references (pages 95-102), Author's Bibliography (103) and index (105-107)
520			_aThe design of distributed systems where computing devices (computers, smartphones, sensors) interact with one another is one of the most challenging problems in computer science. This book is a gentle introduction to some of the most fundamental issues and classical results of computer science underlying the design of algorithms for distributed systems. While humans can see and hear each other, computing devices usually communicate by sending messages or reading from and writing to shared memory locations. As a result, it is far more difficult to synchronize interactions between computers than between humans. Based on this observation, fundamental principles that relate to interactions between computing devices that involve concurrency and synchronization are explained throughout the book. Each chapter deals with a specific topic in terms of a story. It compares the issues that arise when dealing with groups of computing devices to those that arise when a group of people has to share their resources and work as a team to solve various problems. This is an excellent introduction to the feel and nature of this exciting and interesting field. 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.
650			_aElectronic data processing
650			_aToo much bread problem
650			_aDeadlock
650			_aDining philosophers
650			_aMutual exclusion
650			_aBarrier synchronization
650			_aByzantine failures
650			_aCrash failures
650			_aTwo generals problem
650			_aTwo lovers problem
650			_aSee-saw puzzle
650			_aChoice coordination
650			_aByzantine agreement
650			_aRandomized algorithms
650			_aAsynchronous
650			_aSynchronous
650			_aConsensus
650			_aAgreement
650			_aSynchronization
650			_aDistributed algorithms
650			_aAlgorithms
650			_aDistributed processing
942			_2ddc _cBK