Distributed Computing Principles And - Applications M. L. Liu Pdf
Distributed Computing: Principles and Applications
by M. L. Liu is a seminal textbook designed to bridge the gap between theoretical distributed systems and practical, hands-on programming. First published by Pearson/Addison Wesley, it remains a foundational resource for undergraduate students and professionals looking to master the architecture of net-centric applications. Core Concepts and Philosophy
Part 1 (Chapters 1–3):
Establishes fundamental concepts, historical evolution, and different forms of computing (monolithic vs. parallel vs. distributed). Distributed Computing: Principles and Applications by M
- Algorithm Explanations: Rather than dense pseudo-code, the book often explains algorithms conceptually (e.g., the Bully Algorithm or Ring Algorithm for elections) using diagrams and flow descriptions.
- Programming Examples: The book leans heavily on the Java programming language for code snippets. This makes the concepts accessible to students who may find lower-level languages like C++ more cumbersome for network programming.
- Problem-Solving Focus: Each chapter typically ends with exercises that challenge the reader to apply principles to real-world scenarios, such as designing a chat server or a distributed file repository.
1. Fundamentals of Distributed Systems
3. The Fallacy of Homogeneity
is a foundational textbook designed for undergraduate students, emphasizing a practical "how-to" approach to distributed programming. While complete PDF copies are generally restricted by copyright, you can access substantial excerpts, such as the first and second chapters on Scribd Core Principles & Content Overview ResearchGate Academia.edu University websites (e.g.
- ResearchGate
- Academia.edu
- University websites (e.g., Nanyang Technological University, Singapore)
- A simple chat room using multicast sockets.
- A distributed bulletin board using RMI.
- A mutual exclusion demonstrator showing how to prevent race conditions across a network.
