Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Acerca de este artículo
Product Identifiers
PublisherMIT Press
ISBN-100262026775
ISBN-139780262026772
eBay Product ID (ePID)175244300
Product Key Features
Number of Pages248 Pages
Publication NameDistributed Algorithms : an Intuitive Approach
LanguageEnglish
Publication Year2013
SubjectSystems Architecture / Distributed Systems & Computing, Programming / Algorithms, Algebra / General
TypeTextbook
Subject AreaMathematics, Computers
AuthorWan Fokkink
FormatHardcover
Dimensions
Item Height0.7 in
Item Weight22.4 Oz
Item Length9.3 in
Item Width8.1 in
Additional Product Features
Intended AudienceCollege Audience
LCCN2013-015173
Dewey Edition23
IllustratedYes
Dewey Decimal004.36
SynopsisA comprehensive guide to distributed algorithms that emphasizes examples and exercises rather than mathematical argumentation. 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 can be used in courses for upper-level undergraduates or graduate students in computer science, or as a reference for researchers in the field.