Book by Barbosa Valmir C
"Sinopsis" puede pertenecer a otra edición de este libro.
-- David Nicol, Department of Computer Science, Dartmouth College -- Mamoru Maekawa, Professor, Graduate School of Information Systems, University of Electro-Communications, Tokyo " The strength of this book is its focus on practical problems in distributed computing. The book is very accessible---I would use it teaching a senior level course on distributed algorithms." -- David Nicol, Department of Computer Science, Dartmouth College " Barbosa makes the otherwise difficult subject of distributed algorithms very enjoyable and attractive to both students and researchers. The leading intuitive discussion of each algorithm is so very well organized and clearly written that a reader can, without the slightest effort, have a clear picture of it. An ideal textbook for an one-semester distributed algorithms course." -- Mamoru Maekawa, Professor, Graduate School of Information Systems, University of Electro-Communications, Tokyo & quot; The strength of this book is its focus on practical problems in distributed computing. The book is very accessible---I would use it teaching a senior level course on distributed algorithms.& quot; -- David Nicol, Department of Computer Science, Dartmouth College & quot; Barbosa makes the otherwise difficult subject of distributed algorithms very enjoyable and attractive to both students and researchers. The leading intuitive discussion of each algorithm is so very well organized and clearly written that a reader can, without the slightest effort, have a clear picture of it. An ideal textbook for an one-semester distributed algorithms course.& quot; -- Mamoru Maekawa, Professor, Graduate School of Information Systems, University of Electro-Communications, Tokyo "Barbosa makes the otherwise difficult subject of distributed algorithms very enjoyable and attractive to both students and researchers. The leading intuitive discussion of each algorithm is so very well organized and clearly written that a reader can, without the slightest effort, have a clear picture of it. An ideal textbook for an one-semester distributed algorithms course."--Mamoru Maekawa, Professor, Graduate School of Information Systems, University of Electro-Communications, Tokyo "The strength of this book is its focus on practical problems in distributed computing. The book is very accessible---I would use it teaching a senior level course on distributed algorithms."--David Nicol, Department of Computer Science, Dartmouth College
"An Introduction to Distributed Algorithms" takes up some of the main concepts and algorithms, ranging from basic to advanced techniques and applications, that underlie the programming of distributed-memory systems such as computer networks, networks of work-stations, and multiprocessors. Written from the broad perspective of distributed-memory systems in general it includes topics such as algorithms for maximum flow, programme debugging, and simulation that do not appear in more orthodox texts on distributed algorithms. Moving from fundamentals to advances and applications, ten chapters - with exercises and bibliographic notes - cover a variety of topics. These include models of distributed computation, information propagation, leader election, distributed snapshots, network synchronization, self-stability, termination detection, deadlock detection, graph algorithms, mutual exclusion, programme debugging and simulation. All of the algorithms are presented in a clear, template-based format for the description of message-passing computations among the nodes of a connected graph. Such a generic setting allows the treatment of problems originating from many different application areas. The main ideas and algorithms are described in a way that balances intuition and formal rigour - most are preceded by a general intuitive discussion and followed by formal statements as to correctness complexity or other properties.
"Sobre este título" puede pertenecer a otra edición de este libro.
GRATIS gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoLibrería: ThriftBooks-Dallas, Dallas, TX, Estados Unidos de America
Hardcover. Condición: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1.8. Nº de ref. del artículo: G0262024128I3N00
Cantidad disponible: 1 disponibles
Librería: Midtown Scholar Bookstore, Harrisburg, PA, Estados Unidos de America
Hardcover. Condición: Very Good. No dust jacket as issued Standard-sized. Nº de ref. del artículo: mon0000058596
Cantidad disponible: 1 disponibles
Librería: Phatpocket Limited, Waltham Abbey, HERTS, Reino Unido
Condición: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Nº de ref. del artículo: Z1-J-014-01562
Cantidad disponible: 1 disponibles
Librería: G. & J. CHESTERS, TAMWORTH, Reino Unido
Hardcover. Condición: Fine. 1st Edition. 366p, a Fine hardback with pictorial paper-covered boards so no dust-jacket called for [0262024128]. Nº de ref. del artículo: 74282
Cantidad disponible: 1 disponibles
Librería: Kloof Booksellers & Scientia Verlag, Amsterdam, Holanda
Condición: as new. Cambridge, MA: The MIT Press, 1996. Hardcover. 392 pp.- An Introduction to Distributed Algorithms takes up some of the main concepts and algorithms, ranging from basic to advanced techniques and applications, that underlie the programming of distributed-memory systems such as computer networks, networks of workstations, and multiprocessors. Written from the broad perspective of distributed-memory systems in general it includes topics such as algorithms for maximum flow, program debugging, and simulation that do not appear in more orthodox texts on distributed algorithms. Moving from fundamentals to advances and applications, ten chapters--with exercises and bibliographic notes--cover a variety of topics. These include models of distributed computation, information propagation, leader election, distributed snapshots, network synchronization, self- stability, termination detection, deadlock detection, graph algorithms, mutual exclusion, program debugging, and simulation. English text. Condition : as new. Condition : as new copy. ISBN 9780262024129. Keywords : , Electronic data processing. Nº de ref. del artículo: 263321
Cantidad disponible: 1 disponibles
Librería: Anybook.com, Lincoln, Reino Unido
Condición: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Clean from markings. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,900grams, ISBN:9780262024129. Nº de ref. del artículo: 8959805
Cantidad disponible: 1 disponibles
Librería: NEPO UG, Rüsselsheim am Main, Alemania
Condición: Sehr gut. 376 Seiten ex Library Book / aus einer wissenschafltichen Bibliothek / Sprache: Englisch Gewicht in Gramm: 969 23,5 x 18,4 x 2,6 cm, Gebundene Ausgabe. Nº de ref. del artículo: 367842
Cantidad disponible: 1 disponibles
Librería: dsmbooks, Liverpool, Reino Unido
hardcover. Condición: Very Good. Very Good. book. Nº de ref. del artículo: D8S0-3-M-0262024128-6
Cantidad disponible: 1 disponibles