000			04669nam a2200409 i 4500
999			_c334775 _d334775 _x1
001			334775
003			ES-MaUEC
005			20230102114745.0
006			a|||| o|||| 00| 0
007			cr nn nnnaamaa
008			210119s2021 gw a o |||| 0|eng d
020			_a9783658297824
024	7		_a10.1007/978-3-658-29782-4 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.6 _b2021 EB
100	1		_aMaurer, Christian, _d1945- _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9678698
245	1	0	_aNonsequential and distributed programming with Go : _bsynchronization of concurrent processes : communication - cooperation - competition _cby Christian Maurer
250			_aFirst edition 2021
264		1	_aWiesbaden _bSpringer International Publising _c2021
300			_a1 recurso en línea (XXIV, 404 páginas) _b34 ilustraciones, 2 ilustraciones a color
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_atext file _bPDF _2rda
505	0		_aIntroduction -- 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	3		_aAfter 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.
988			_aSpringer_Computer_2021
650		7	_2embne _aProgramación de ordenadores _9139821
650		7	_2embne _9678605 _aLenguajes de programación
650		7	_2embne _9151535 _aEstructuras de datos (Informática)
710	2		_aSpringerLink
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-658-29782-4 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b05/2021 _dz _eb _zSI