Beschreibung
Produktdetails
Einband
Gebundene Ausgabe
Erscheinungsdatum
23.05.2002
Verlag
John Wiley & Sons IncSeitenzahl
448
Maße (L/B/H)
24,4/16,2/2,5 cm
Gewicht
744 g
Auflage
1. Auflage
Sprache
Englisch
ISBN
978-0-471-03600-5
As distributed systems become increasingly available, the need for a fundamental discussion of the subject has grown. Designed for first-year graduate students and advanced undergraduates as well as practicing computer engineers seeking a solid grounding in the subject, this well-organized text covers the fundamental concepts in distributed computing systems such as time, state, simultaneity, order, knowledge, failure, and agreement in distributed systems.
Departing from the focus on shared memory and synchronous systems commonly taken by other texts, this is the first useful reference based on an asynchronous model of distributed computing, the most widely used in academia and industry. The emphasis of the book is on developing general mechanisms that can be applied to a variety of problems. Its examples-clocks, locks, cameras, sensors, controllers, slicers, and synchronizers-have been carefully chosen so that they are fundamental and yet useful in practical contexts.
The text's advantages include:
* Emphasizes general mechanisms that can be applied to a variety of problems
* Uses a simple induction-based technique to prove correctness of all algorithms
* Includes a variety of exercises at the end of each chapter
* Contains material that has been extensively class tested
* Gives instructor flexibility in choosing appropriate balance between practice and theory of distributed computing
Noch keine Bewertungen vorhanden
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.
Kurze Frage zu unserer Seite
Vielen Dank für Ihr Feedback
Wir nutzen Ihr Feedback, um unsere Produktseiten zu verbessern. Bitte haben Sie Verständnis, dass wir Ihnen keine Rückmeldung geben können. Falls Sie Kontakt mit uns aufnehmen möchten, können Sie sich aber gerne an unseren Kund*innenservice wenden.
zum Kundenservice