Guide to Distributed Algorithms : Design, Analysis and Implementation Using Python / by K. Erciyes.

Format:

Book

Author/Creator:

Erciyes, K., Author.

Series:

Undergraduate Topics in Computer Science, 2197-1781

Language:

English

Subjects (All):

Algorithms.

Python (Computer program language).

Design and Analysis of Algorithms.

Python.

Local Subjects:

Design and Analysis of Algorithms.

Algorithms.

Python.

Physical Description:

1 online resource (XIV, 298 p. 115 illus., 2 illus. in color.)

Edition:

1st ed. 2025.

Place of Publication:

Cham : Springer Nature Switzerland : Imprint: Springer, 2025.

Summary:

The study of distributed algorithms provides the needed background in many real-life applications, such as: distributed real-time systems, wireless sensor networks, mobile ad hoc networks and distributed databases. The main goal of Guide to Distributed Algorithms is to provide a detailed study of the design and analysis methods of distributed algorithms and to supply the implementations of most of the presented algorithms in Python language, which is the unique feature of the book not found in any other contemporary books on distributed computing. Topics and features: Presents comprehensive design methods for distributed algorithms Provides detailed analysis for the algorithms presented Uses graph templates to demonstrate the working of algorithms Provides working Python code for most of the algorithms presented This unique textbook/study manual can serve as a comprehensive manual of distributed algorithms for Computer Science and non-CS majors as well as practitioners of distributed algorithms in research projects. Dr. K. Erciyes is a professor of Computer Engineering at Yaşar University, İzmir, Turkiye. His other publications include the Springer titles Distributed Graph Algorithms for Computer Networks, Distributed and Sequential Algorithms for Bioinformatics, Guide to Graph Algorithms, Distributed Real-Time Systems, Discrete Mathematics and Graph Theory and Algebraic Graph Algorithms.

Contents:

Part I: Background - 1. Introduction

2. Basic Concepts

3. Models

Part II: Fundamental Algorithms

4. Time Management

5. Distributed Mutual Exclusion

6. Distributed Snapshots and Global States

7. Coordination

8. Fault Tolerance

9. Consensus and Agreement

10. Multicast Communication and Message Ordering

11. Distributed Transactions and Replication

Part III: Distributed Graph Algorithms - 12. Trees and Traversals

13. Weighted Graphs

14. Graph Decomposition

Part IV: Applications

15. Mobile Ad hoc Networks

16. Wireless Sensor Networks. 17. The Internet and the Internet of Things.

Notes:

Description based on publisher supplied metadata and other sources.

ISBN:

3-031-79018-9

OCLC:

1517868372