|
|
Distributed Systems: An Algorithmic Approach (Computer and Information Sciences)
|
You are here:
Home > Computer Books > Distributed Systems > Item

|
Distributed Systems: An Algorithmic Approach (Computer and Information Sciences)
|

by Sukumar Ghosh
Sales Rank : 731838
|
|
|
|
Hardcover: 424 pages
Publisher: Chapman & Hall/CRC; 1 edition November 22, 2006
Language: English
ISBN-10: 1584885645
ISBN-13: 978-1584885641
Product Dimensions:
10 x 7 x 1.1 inches
Shipping Weight: 1.8 pounds
Product Review
I have been teaching distributed systems and distributed algorithms-related courses at the graduate level for over 15 years and it is the first time I have come across a book of a favorable context, right measure and length on this topic. This is a formal book on distributed systems using distributed algorithms approach yet it has a lot of practical concern. It is very concise, right up to the point, says it all but not a single sentence more. … Algorithms are presented in a simple style along with short and sound proofs in this book, which make it very comfortable to follow. … I think this is the best currently available book on distributed algorithms. After purchasing this book slightly after the beginning of the semester, I ended up modifying all my notes for a current distributed algorithms course to reflect the contents of this book. —K. Erciyes, Izmir Institute of Technology, Turkey
Product Description
Most applications in distributed computing center around a set of common subproblems. Distributed Systems: An Algorithmic Approach presents the algorithmic issues and necessary background theory that are needed to properly understand these challenges. Achieving a balance between theory and practice, this book bridges the gap between theoreticians and practitioners. With a set of exercises featured in each chapter, the book begins with background information that contains various interprocess communication techniques and middleware services, followed by foundational topics that cover system models, correctness criteria, and proof techniques. The book also presents numerous important paradigms in distributed systems, including logical clocks, distributed snapshots, deadlock detection, termination detection, election, and several graph algorithms. The author then addresses failures and fault-tolerance techniques in diverse applications, such as consensus, transactions, group communication, replicated data management, and self-stabilization. He concludes with an exploration of real-world issues, including distributed discrete-event simulation and security, sensor networks, and peer-to-peer networks. By covering foundational matters of distributed systems and their relationships to real-world applications, Distributed Systems provides insight into common distributed computing subproblems,
|
|
|
|