Compact introduction to concurrent programming with Google Go Systematic overview of synchronization and communication of concurrent processes All Go source texts are available for download

Autorentext

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.

Zusammenfassung

Inhalt

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.