Distributed systems : an algorithmic approach
Author(s)
Bibliographic Information
Distributed systems : an algorithmic approach
(Chapman & Hall/CRC computer and information science series / series editor, Sartaj Sahni)
CRC Press, c2015
2nd ed
Available at 1 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. 501-512) and index
Description and Table of Contents
Description
Distributed Systems: An Algorithmic Approach, Second Edition provides a balanced and straightforward treatment of the underlying theory and practical applications of distributed computing. As in the previous version, the language is kept as unobscured as possible-clarity is given priority over mathematical formalism. This easily digestible text:
Features significant updates that mirror the phenomenal growth of distributed systems
Explores new topics related to peer-to-peer and social networks
Includes fresh exercises, examples, and case studies
Supplying a solid understanding of the key principles of distributed computing and their relationship to real-world applications, Distributed Systems: An Algorithmic Approach, Second Edition makes both an ideal textbook and a handy professional reference.
Table of Contents
Section I: Background Materials. Introduction. Interprocess Communication: An Overview. Section II: Foundational Topics. Models for Communication. Representing Distributed Algorithms: Syntax and Semantics. Program Correctness. Time in a Distributed System. Section III: Important Paradigms. Mutual Exclusion. Distributed Snapshot. Global State Collection. Graph Algorithms. Coordination Algorithms. Section IV: Faults and Fault-Tolerant Systems. Fault-Tolerant Systems. Distributed Consensus. Distributed Transactions. Group Communication. Replicated Data Management. Self-Stabilizing Systems. Section V: Real-World Issues. Distributed Discrete-Event Simulation. Security in Distributed Systems. Sensor Networks. Social and Peer-to-Peer Networks.
by "Nielsen BookData"