rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Distributed computing pearls
  name:
    name part: Taubenfeld, Gadi
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: Morgan & Claypool Publishers
  type of resource: text
  genre: abstract or summary
  genre: Electronic books.
  origin info:
    place:
      place term: cau
    date issued: 2018
    issuance: monographic
  language:
    language term: eng
  physical description:
    reformatting quality: access
    form: remote
    extent: 1 online resource (xv, 107 pages) : illustrations.
  abstract: 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.
  table of contents: 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 --
  table of contents: 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 --
  table of contents: 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 --
  table of contents: 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 --
  table of contents: 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 --
  table of contents: 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 --
  table of contents: 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 --
  table of contents: 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 --
  table of contents: 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 --
  table of contents: 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 --
  table of contents: Bibliography -- Author's biography -- Index.
  target audience: specialized
  note: Gadi Taubenfeld.
  note: Part of: Synthesis digital library of engineering and computer science.
  note: Abstract freely available; full-text restricted to subscribers or individual document purchasers.
  note: Compendex
  note: Google book search
  note: Google scholar
  note: INSPEC
  note: Also available in print.
  note: Mode of access: World Wide Web.
  note: Includes bibliographical references (pages 95-102) and index.
  subject:
    topic: Electronic data processing
    topic: Distributed processing
  subject:
    topic: Byzantine agreement
  subject:
    topic: Byzantine failures
  subject:
    topic: agreement
  subject:
    topic: algorithms
  subject:
    topic: asynchronous
  subject:
    topic: barrier synchronization
  subject:
    topic: choice coordination
  subject:
    topic: consensus
  subject:
    topic: crash failures
  subject:
    topic: deadlock
  subject:
    topic: dining philosophers
  subject:
    topic: distributed algorithms
  subject:
    topic: mutual exclusion
  subject:
    topic: randomized algorithms
  subject:
    topic: synchronization
  subject:
    topic: synchronous
  subject:
    topic: the see-saw puzzle
  subject:
    topic: the too much bread problem
  subject:
    topic: the two generals problem
  subject:
    topic: the two lovers problem
  classification: QA76.9.D5 T283 2018
  classification: 004.36
  related item:
    note: Compendex
  related item:
    note: Google book search
  related item:
    note: Google scholar
  related item:
    note: INSPEC
  related item:
    title info:
      title: Synthesis digital library of engineering and computer science
  related item:
    title info:
      title: Synthesis lectures on distributed computing theory ; # 14
  identifier: 9781681733494
  identifier: 9781681733487
  identifier: 9781681733500
  identifier: 9781681733517
  identifier: https://dx.doi.org/10.2200/S00845ED1V01Y201804DCT014
  access condition: Abstract freely available; full-text restricted to subscribers or individual document purchasers.
  record info:
    record content source: CaBNVSL
    record creation date: 180525
    record change date: 20210728140020.0
    record identifier: in00004034424
    language of cataloging:
      language term: eng