Nonsequential and distributed programming with Go : synchronization of concurrent processes: communication - cooperation - competition / Christian Maurer.
2021
QA76.6
Linked e-resources
Linked Resource
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Nonsequential and distributed programming with Go : synchronization of concurrent processes: communication - cooperation - competition / Christian Maurer.
ISBN
9783658297824 (electronic bk.)
3658297824 (electronic bk.)
9783658297817
3658297824 (electronic bk.)
9783658297817
Published
Wiesbaden : Springer, [2021]
Language
English
Description
1 online resource (xxiv, 404 pages) : illustrations (some color)
Item Number
10.1007/978-3-658-29782-4 doi
Call Number
QA76.6
Dewey Decimal Classification
005.1/1
Summary
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 exchange, 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 exchange 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. 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. This book is a translation of the original German edition "Nichtsequentielle und Verteilte Programmierung mit Go" by Christian Maurer, published by Springer Fachmedien Wiesbaden in 2019. The translation was done with the help of artificial intelligence (machine translation by the service DeepL.com). A subsequent human revision was done primarily in terms of content, so that the book will read stylistically different from a conventional translation. Springer Nature works continuously to further the development of tools for the production of books and on the related technologies to support the authors.
Bibliography, etc. Note
Includes bibliographical references and index.
Access Note
Access limited to authorized users.
Digital File Characteristics
text file
PDF
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed March 10, 2021).
Available in Other Form
Print version: 9783658297817
Print version: 9783658297831
Print version: 9783658297831
Linked Resources
Record Appears in
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.
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.