國立虎尾科技大學 |

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

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Nonsequential and Distributed Programming with Go/ by Christian Maurer.
其他題名:	Synchronization of Concurrent Processes: Communication - Cooperation - Competition /
作者:	Maurer, Christian.
面頁冊數:	XXIV, 404 p. 34 illus., 2 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithm Analysis and Problem Complexity. -
電子資源:	https://doi.org/10.1007/978-3-658-29782-4
ISBN:	9783658297824

Nonsequential and Distributed Programming with Go = Synchronization of Concurrent Processes: Communication - Cooperation - Competition /
Maurer, Christian.

Nonsequential and Distributed Programming with GoSynchronization of Concurrent Processes: Communication - Cooperation - Competition /[electronic resource] :by Christian Maurer. - 1st ed. 2021. - XXIV, 404 p. 34 illus., 2 illus. in color.online resource.

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.

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.

ISBN: 9783658297824

Standard No.: 10.1007/978-3-658-29782-4doiSubjects--Topical Terms:

593923
Algorithm Analysis and Problem Complexity.

LC Class. No.: QA76.6-76.66

Dewey Class. No.: 005.11

Nonsequential and Distributed Programming with Go = Synchronization of Concurrent Processes: Communication - Cooperation - Competition /
LDR:04350nam a22003855i 4500 001 1052135
003 DE-He213
005 20210622033213.0
007 cr nn 008mamaa
008 220103s2021 gw | s |||| 0|eng d
020 $a 9783658297824 $9 978-3-658-29782-4
024 7 $a 10.1007/978-3-658-29782-4 $2 doi
035 $a 978-3-658-29782-4
050 4 $a QA76.6-76.66
072 7 $a UM $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UM $2 thema
082 0 4 $a 005.11 $2 23
100 1 $a Maurer, Christian. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1285351
245 1 0 $a Nonsequential and Distributed Programming with Go $h [electronic resource] : $b Synchronization of Concurrent Processes: Communication - Cooperation - Competition / $c by Christian Maurer.
250 $a 1st ed. 2021.
264 1 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer, $c 2021.
300 $a XXIV, 404 p. 34 illus., 2 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a 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.
520 $a 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.
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 669782
650 1 4 $a Programming Techniques. $3 669781
650 0 $a Algorithms. $3 527865
650 0 $a Computer logic. $3 786340
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Programming languages (Electronic computers). $3 1127615
650 0 $a Computer programming. $3 527822
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783658297817
776 0 8 $i Printed edition: $z 9783658297831
856 4 0 $u https://doi.org/10.1007/978-3-658-29782-4
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)