Nonsequential and Distributed Programming with Go: Synchronization of Concurrent Processes: Communication - Cooperation - Competition

by Christian Maurer

Overview

After a short chapter on basic aspects of software engineering and its realization in Go, this book introduces to nonsequential and distributed programming with Go. It systematically presents basic concepts for the synchronization and communication of concurrent processes. These include locks, semaphores, fairness and deadlocks, monitors, local and network-wide message passing, networks as graphs, network exploration, distributed depth and breadth first search, and the selection of a leader in networks. In order to make readers familiar with the concepts, the author always takes up the same classic examples. This makes learning easier, because the concepts presented can be compared more easily with the language resources.

The algorithms are formulated in the Go programming language, which can be used to express numerous synchronization concepts. Due to its simple syntax, Go also offers the advantage that readers without prior knowledge can follow the basic concepts. The chapters on locks, semaphores, monitors and network-wide message passing also present some basic approaches to programming in C and Java. All source texts are available online.

In the 4th edition of the textbook, which is aimed at students of computer science, some errors have been corrected, smaller extensions have been included and adjustments due to a change to Go have been made.

Product Details

ISBN-13:	9783658297817
Publisher:	Springer Fachmedien Wiesbaden
Publication date:	01/20/2021
Edition description:	1st ed. 2021
Pages:	404
Product dimensions:	6.61(w) x 9.45(h) x (d)

About the Author

Dipl. Math. Dr.rer.nat. Christian Maurer studied in Berlin and earned his doctorate in mathematics at the University of Bremen. He worked for a long time as a research assistant and assistant professor of mathematics at Freie Universität Berlin, then for a short time as head of computer science at a Berlin high school and finally, until his retirement, as head of teacher training at the Department of Mathematics and Computer Science at Freie Universität Berlin. During this time - and even after his retirement - he was a lecturer for computer science.

Table of Contents

Introduction.- Packages, Interfaces and Abstract Datatypes.- Locks.- Semaphores.- The Baton Algorithm.- Universal Critical Sections.- Fairness.- Deadlocks.- Monitors.- Universal Monitors.- Message Passing.- Comparison of the Previous Language Constructs.- Netwide Message Passing.- Universal Far Monitors.- Networks as Graphs.- Heartbeat Algorithms.- Leader Election Algorithms.- Further Literature.