Introduction to distributed algorithms / (Record no. 81821)

000 -LEADER
fixed length control field 05378nam a22003618i 4500
001 - CONTROL NUMBER
control field CR9781139168724
003 - CONTROL NUMBER IDENTIFIER
control field UkCbUP
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20221102214124.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS
fixed length control field m|||||o||d||||||||
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr||||||||||||
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 141103s2000||||enk o ||1 0|eng|d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781139168724 (ebook)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Canceled/invalid ISBN 9780521794831 (paperback)
040 ## - CATALOGING SOURCE
Original cataloging agency UkCbUP
Language of cataloging eng
Description conventions rda
Transcribing agency UkCbUP
050 00 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.D5
Item number T44 2000
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.2/76
Edition number 21
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Tel, Gerard,
Relator term author.
9 (RLIN) 66963
245 10 - TITLE STATEMENT
Title Introduction to distributed algorithms /
Statement of responsibility, etc. Gerard Tel.
250 ## - EDITION STATEMENT
Edition statement Second edition.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Cambridge :
Name of producer, publisher, distributor, manufacturer Cambridge University Press,
Date of production, publication, distribution, manufacture, or copyright notice 2000.
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource (xii, 596 pages) :
Other physical details digital, PDF file(s).
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
500 ## - GENERAL NOTE
General note Title from publisher's bibliographic system (viewed on 05 Oct 2015).
505 00 - FORMATTED CONTENTS NOTE
Miscellaneous information 1
Title Introduction: Distributed Systems
Miscellaneous information 1 --
-- 1.2
Title Architecture and Languages
Miscellaneous information 18 --
-- 1.3
Title Distributed Algorithms
Miscellaneous information 26 --
-- 1.4
Title Outline of the Book
Miscellaneous information 36 --
-- Part 1
Title Protocols
Miscellaneous information 41 --
-- 2
Title Model
Miscellaneous information 43 --
-- 2.1
Title Transition Systems and Algorithms
Miscellaneous information 44 --
-- 2.2
Title Proving Properties of Transition Systems
Miscellaneous information 50 --
-- 2.3
Title Causal Order of Events and Logical Clocks
Miscellaneous information 54 --
-- 2.4
Title Additional Assumptions, Complexity
Miscellaneous information 64 --
-- 3
Title Communication Protocols
Miscellaneous information 74 --
-- 3.1
Title Balanced Sliding-window Protocol
Miscellaneous information 76 --
-- 3.2
Title A Timer-based Protocol
Miscellaneous information 85 --
-- 4
Title Routing Algorithms
Miscellaneous information 103 --
-- 4.1
Title Destination-based Routing
Miscellaneous information 105 --
-- 4.2
Title All-pairs Shortest-path Problem
Miscellaneous information 110 --
-- 4.3
Title Netchange Algorithm
Miscellaneous information 123 --
-- 4.4
Title Routing with Compact Routing Tables
Miscellaneous information 132 --
-- 4.5
Title Hierarchical Routing
Miscellaneous information 149 --
-- 5
Title Deadlock-free Packet Switching
Miscellaneous information 155 --
-- 5.2
Title Structured Solutions
Miscellaneous information 158 --
-- 5.3
Title Unstructured Solutions
Miscellaneous information 167 --
-- Part 2
Title Fundamental Algorithms
Miscellaneous information 179 --
-- 6
Title Wave and Traversal Algorithms
Miscellaneous information 181 --
-- 6.1
Title Definition and Use of Wave Algorithms
Miscellaneous information 182 --
-- 6.2
Title A Collection of Wave Algorithms
Miscellaneous information 190 --
-- 6.3
Title Traversal Algorithms
Miscellaneous information 202 --
-- 6.4
Title Time Complexity: Depth-first Search
Miscellaneous information 208 --
-- 7
Title Election Algorithms
Miscellaneous information 227 --
-- 7.2
Title Ring Networks
Miscellaneous information 232 --
-- 7.3
Title Arbitrary Networks
Miscellaneous information 245 --
-- 7.4
Title Korach-Kutten-Moran Algorithm
Miscellaneous information 260 --
-- 8
Title Termination Detection
Miscellaneous information 268 --
-- 8.2
Title Computation Trees and Forests
Miscellaneous information 276 --
-- 8.3
Title Wave-based Solutions
Miscellaneous information 284 --
-- 9
Title Anonymous Networks
Miscellaneous information 307 --
-- 9.2
Title Deterministic Algorithms
Miscellaneous information 317 --
-- 9.3
Title A Probabilistic Election Algorithm
Miscellaneous information 323 --
-- 9.4
Title Computing the Network Size
Miscellaneous information 327 --
-- 10
Title Snapshots
Miscellaneous information 335 --
-- 10.2
Title Two Snapshot Algorithms
Miscellaneous information 340 --
-- 10.3
Title Using Snapshot Algorithms
Miscellaneous information 344 --
-- 10.4
Title Application: Deadlock Detection
Miscellaneous information 349 --
-- 11
Title Sense of Direction and Orientation
Miscellaneous information 356 --
-- 11.2
Title Election in Rings and Chordal Rings
Miscellaneous information 364 --
-- 11.3
Title Computing in Hypercubes
Miscellaneous information 374 --
-- 11.4
Title Complexity-related Issues
Miscellaneous information 386 --
-- 12
Title Synchrony in Networks
Miscellaneous information 396 --
-- 12.2
Title Election in Synchronous Networks
Miscellaneous information 404 --
-- 12.3
Title Synchronizer Algorithms
Miscellaneous information 408 --
-- 12.4
Title Application: Breadth-first Search
Miscellaneous information 414 --
-- 12.5
Title Archimedean Assumption
Miscellaneous information 420 --
-- Part 3
Title Fault Tolerance
Miscellaneous information 425 --
-- 13
Title Fault Tolerance in Distributed Systems
Miscellaneous information 427 --
-- 13.1
Title Reasons for Using Fault-tolerant Algorithms
Miscellaneous information 427 --
-- 13.2
Title Robust Algorithms
Miscellaneous information 429 --
-- 13.3
Title Stabilizing Algorithms
Miscellaneous information 435 --
-- 14
Title Fault Tolerance in Asynchronous Systems
Miscellaneous information 437 --
-- 14.1
Title Impossibility of Consensus
Miscellaneous information 437 --
-- 14.2
Title Initially Dead Processes
Miscellaneous information 442 --
-- 14.3
Title Deterministically Achievable Cases
Miscellaneous information 445 --
-- 14.4
Title Probabilistic Consensus Algorithms
Miscellaneous information 451 --
-- 14.5
Title Weak Termination
Miscellaneous information 462 --
-- 15
Title Fault Tolerance in Synchronous Systems
Miscellaneous information 469 --
-- 15.1
Title Synchronous Decision Protocols
Miscellaneous information 470 --
-- 15.2
Title Authenticating Protocols
Miscellaneous information 481 --
-- 15.3
Title Clock Synchronization
Miscellaneous information 493 --
-- 16
Title Failure Detection
Miscellaneous information 505 --
-- 16.2
Title Solving Consensus with a Weakly Accurate Detector
Miscellaneous information 510 --
-- 16.3
Title Eventually Weakly Accurate Detectors
Miscellaneous information 511 --
-- 16.4
Title Implementation of Failure Detectors
Miscellaneous information 515 --
-- 17
Title Stabilization
Miscellaneous information 520 --
-- 17.2
Title Graph Algorithms
Miscellaneous information 526 --
-- 17.3
Title Methodology for Stabilization
Miscellaneous information 535 --
Title A Pseudocode Conventions
Miscellaneous information 551 --
-- B
Title Graphs and Networks
Miscellaneous information 556.
520 ## - SUMMARY, ETC.
Summary, etc. Distributed algorithms have been the subject of intense development over the last twenty years. The second edition of this successful textbook provides an up-to-date introduction both to the topic, and to the theory behind the algorithms. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, whilst the coverage is sufficiently deep to make it useful for practising engineers and researchers. The author concentrates on algorithms for the point-to-point message passing model, and includes algorithms for the implementation of computer communication networks. Other key areas discussed are algorithms for the control of distributed applications (wave, broadcast, election, termination detection, randomized algorithms for anonymous networks, snapshots, deadlock detection, synchronous systems), and fault-tolerance achievable by distributed algorithms. The two new chapters on sense of direction and failure detectors are state-of-the-art and will provide an entry to research in these still-developing topics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Electronic data processing
General subdivision Distributed processing
Form subdivision Congresses.
9 (RLIN) 4596
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer algorithms
Form subdivision Congresses.
9 (RLIN) 4597
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Print version:
International Standard Book Number 9780521794831
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1017/CBO9781139168724">https://doi.org/10.1017/CBO9781139168724</a>
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eTextbook

No items available.