Distributed algorithms : (Record no. 15985)

MARC details
000 -LEADER
fixed length control field 02477nam a2200229Ia 4500
003 - CONTROL NUMBER IDENTIFIER
control field NULRC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20250520102819.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 250520s9999 xx 000 0 und d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780262026772
040 ## - CATALOGING SOURCE
Transcribing agency NULRC
050 ## - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA 76.58 .F65 2013
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Fokkink, Wan
Relator term author
245 #0 - TITLE STATEMENT
Title Distributed algorithms :
Remainder of title an intuitive approach /
Statement of responsibility, etc. Wan Fokkink
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Cambridge, Massachusetts :
Name of publisher, distributor, etc. The MIT Press,
Date of publication, distribution, etc. c2013
300 ## - PHYSICAL DESCRIPTION
Extent x, 231 pages :
Other physical details illustrations ;
Dimensions 23 cm.
365 ## - TRADE PRICE
Price amount USD37.07
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes bibliographical references and index.
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note I Message Passing; 2 Preliminaries; 3 Snapshots; 4 Waves; 5 Deadlock Detection; 6 Termination Detection; 7 Garbage Collection; 8 Routing; 9 Election; 10 Anonymous Networks; 11 Synchronous Networks; 12 Crash Failures; 13 Byzantine Failures; 14 Mutual Exclusion; II Shared Memory; 15 Preliminaries; 16 Mutual Exclusion II; 17 Barriers; 18 Self-Stabilization; 19 Online Scheduling; Pseudocode Descriptions; References; Index.
520 ## - SUMMARY, ETC.
Summary, etc. "This book offers students and researchers a guide to distributed algorithms that emphasizes examples and exercises rather than the intricacies of mathematical models. It avoids mathematical argumentation, often a stumbling block for students, teaching algorithmic thought rather than proofs and logic. This approach allows the student to learn a large number of algorithms within a relatively short span of time. Algorithms are explained through brief, informal descriptions, illuminating examples, and practical exercises. The examples and exercises allow readers to understand algorithms intuitively and from different perspectives. Proof sketches, arguing the correctness of an algorithm or explaining the idea behind fundamental results, are also included. An appendix offers pseudocode descriptions of many algorithms. Distributed algorithms are performed by a collection of computers that send messages to each other or by multiple software threads that use the same shared memory. The algorithms presented in the book are for the most part "classics, " selected because they shed light on the algorithmic design of distributed systems or on key issues in distributed computing and concurrent programming. Distributed Algorithms be used in courses for upper-level undergraduates or graduate students in computer science, or as a reference for researchers in the field."
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element DISTRIBUTED ALGORITHMS -- TEXTBOOKS
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Library of Congress Classification
Koha item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection Home library Current library Shelving location Date acquired Source of acquisition Cost, normal purchase price Total checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
    Library of Congress Classification     Machine Learning LRC - Main National University - Manila General Circulation 06/14/2017 Purchased - Amazon 37.07   GC QA 76.58 .F65 2013 NULIB000013744 05/20/2025 c.1 05/20/2025 Books