Downloads & Free Reading Options - Results

An Introduction to Distributed Algorithms Barbosa C. Valmir The MIT Press, 1996 Preface Part 1 - Fundamentals Chapter 1 - Message-Passing Systems Chapter 2 - Intrinsic Constraints Chapter 3 - Models of Computation Chapter 4 - Basic Algorithms Chapter 5 - Basic Techniques Part 2 - Advances and Applications Chapter 6 - Stable Properties Chapter 7 - Graph Algorithms Chapter 8 - Resource Sharing Chapter 9 - Program Debugging Chapter 10 - Simulation Bibliography Author Index Subject Index List of Figures List of Listings This book presents an introduction to some of the main problems, techniques, and algorithms underlying the programming of distributed-memory systems, such as computer networks, networks of workstations, and multiprocessors. It is intended mainly as a textbook for advanced undergraduates or first-year graduate students in computer science and requires no specific background beyond some familiarity with basic graph theory, although prior exposure to the main issues in concurrent programming and computer networks may also be helpful. In addition, researchers and practitioners working on distributed computing will also find it useful as a general reference on some of the most important issues in the field.

An Introduction to Distributed Algorithms Barbosa C. Valmir The MIT Press, 1996 Preface Part 1 - Fundamentals Chapter 1 - Message-Passing Systems Chapter 2 - Intrinsic Constraints Chapter 3 - Models of Computation Chapter 4 - Basic Algorithms Chapter 5 - Basic Techniques Part 2 - Advances and Applications Chapter 6 - Stable Properties Chapter 7 - Graph Algorithms Chapter 8 - Resource Sharing Chapter 9 - Program Debugging Chapter 10 - Simulation Bibliography Author Index Subject Index List of Figures List of Listings This book presents an introduction to some of the main problems, techniques, and algorithms underlying the programming of distributed-memory systems, such as computer networks, networks of workstations, and multiprocessors. It is intended mainly as a textbook for advanced undergraduates or first-year graduate students in computer science and requires no specific background beyond some familiarity with basic graph theory, although prior exposure to the main issues in concurrent programming and computer networks may also be helpful. In addition, researchers and practitioners working on distributed computing will also find it useful as a general reference on some of the most important issues in the field.

An Introduction to Distributed Algorithms Barbosa C. Valmir The MIT Press, 1996 Preface Part 1 - Fundamentals Chapter 1 - Message-Passing Systems Chapter 2 - Intrinsic Constraints Chapter 3 - Models of Computation Chapter 4 - Basic Algorithms Chapter 5 - Basic Techniques Part 2 - Advances and Applications Chapter 6 - Stable Properties Chapter 7 - Graph Algorithms Chapter 8 - Resource Sharing Chapter 9 - Program Debugging Chapter 10 - Simulation Bibliography Author Index Subject Index List of Figures List of Listings This book presents an introduction to some of the main problems, techniques, and algorithms underlying the programming of distributed-memory systems, such as computer networks, networks of workstations, and multiprocessors. It is intended mainly as a textbook for advanced undergraduates or first-year graduate students in computer science and requires no specific background beyond some familiarity with basic graph theory, although prior exposure to the main issues in concurrent programming and computer networks may also be helpful. In addition, researchers and practitioners working on distributed computing will also find it useful as a general reference on some of the most important issues in the field.