東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Nonsequential and distributed progra...

Maurer, Christian.

FindBook

Google Book

Amazon

博客來

Nonsequential and distributed programming with Go = synchronization of concurrent processes /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Nonsequential and distributed programming with Go/ by Christian Maurer.
其他題名:	synchronization of concurrent processes /
作者:	Maurer, Christian.
出版者:	Berlin, Heidelberg :Springer Berlin Heidelberg : : 2025.,
面頁冊數:	xx, 424 p. :ill. (some col.), digital ;24 cm.
內容註:	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 -- Traversing Algorithms -- Leader Election Algorithms.
Contained By:	Springer Nature eBook
標題:	Computer programming. -
電子資源:	https://doi.org/10.1007/978-3-662-70929-0
ISBN:	9783662709290

Nonsequential and distributed programming with Go = synchronization of concurrent processes /
Maurer, Christian.

Nonsequential and distributed programming with Gosynchronization of concurrent processes /[electronic resource] :by Christian Maurer. - Second edition. - Berlin, Heidelberg :Springer Berlin Heidelberg :2025. - xx, 424 p. :ill. (some col.), digital ;24 cm.

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 -- Traversing Algorithms -- Leader Election Algorithms.

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. Besides a number of error corrections and smaller updates, in this second edition the nanouniverse nU is replaced with the microuniverse μU. This allows for beautiful animations in many places, which are not possible with the nanouniverse due to a lack of the necessary support for inputs and outputs; e.g. in the chapters on fairness, messages, farMonitors, traversals and election.

ISBN: 9783662709290

Standard No.: 10.1007/978-3-662-70929-0doiSubjects--Uniform Titles:

Lotus Go.
Subjects--Topical Terms:

527209
Computer programming.

LC Class. No.: QA76.6

Dewey Class. No.: 005.11

Nonsequential and distributed programming with Go = synchronization of concurrent processes /
LDR:03170nmm a2200361 a 4500 001 2413681
003 DE-He213
005 20250702130311.0
006 m d
007 cr nn 008maaau
008 260205s2025 gw s 0 eng d
020 $a 9783662709290 $q (electronic bk.)
020 $a 9783662709283 $q (paper)
024 7 $a 10.1007/978-3-662-70929-0 $2 doi
035 $a 978-3-662-70929-0
040 $a GP $c GP
041 1 $a eng $h ger
050 4 $a QA76.6
072 7 $a UMX $2 bicssc
072 7 $a COM051010 $2 bisacsh
072 7 $a UMX $2 thema
082 0 4 $a 005.11 $2 23
090 $a QA76.6 $b .M453 2025
100 1 $a Maurer, Christian. $3 3489404
240 1 0 $a Nichtsequentielle und Verteilte Programmierung mit Go. $l English
245 1 0 $a Nonsequential and distributed programming with Go $h [electronic resource] : $b synchronization of concurrent processes / $c by Christian Maurer.
250 $a Second edition.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2025.
300 $a xx, 424 p. : $b ill. (some col.), digital ; $c 24 cm.
338 $a online resource $b cr $2 rdacarrier
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 -- Traversing Algorithms -- Leader Election Algorithms.
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 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. Besides a number of error corrections and smaller updates, in this second edition the nanouniverse nU is replaced with the microuniverse μU. This allows for beautiful animations in many places, which are not possible with the nanouniverse due to a lack of the necessary support for inputs and outputs; e.g. in the chapters on fairness, messages, farMonitors, traversals and election.
630 0 0 $a Lotus Go. $3 3489405
650 0 $a Computer programming. $3 527209
650 0 $a Programming languages (Electronic computers) $3 606806
650 0 $a Data structures (Computer science) $3 527210
650 0 $a Computer logic. $3 840463
650 0 $a Algorithms. $3 536374
650 1 4 $a Programming Language. $3 3538935
650 2 4 $a Compilers and Interpreters. $3 3592044
650 2 4 $a Programming Techniques. $3 892496
650 2 4 $a Software Management. $3 2139173
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-3-662-70929-0
950 $a Professional and Applied Computing (SpringerNature-12059)