Introduction to Distributed Algorithms
- Publisher's listprice GBP 66.00
-
33 402 Ft (31 812 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 3 340 Ft off)
- Discounted price 30 062 Ft (28 631 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
33 402 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 2, Revised
- Publisher Cambridge University Press
- Date of Publication 28 September 2000
- ISBN 9780521794831
- Binding Paperback
- No. of pages612 pages
- Size 244x191x33 mm
- Weight 1228 g
- Language English 0
Categories
Short description:
The second edition of this successful textbook provides an up-to-date introduction both to distributed algorithms and to the theory behind them.
MoreLong description:
Distributed algorithms have been the subject of intense development over the last twenty years. The second edition of this successful textbook provides an up-to-date introduction both to the topic, and to the theory behind the algorithms. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, whilst the coverage is sufficiently deep to make it useful for practising engineers and researchers. The author concentrates on algorithms for the point-to-point message passing model, and includes algorithms for the implementation of computer communication networks. Other key areas discussed are algorithms for the control of distributed applications (wave, broadcast, election, termination detection, randomized algorithms for anonymous networks, snapshots, deadlock detection, synchronous systems), and fault-tolerance achievable by distributed algorithms. The two new chapters on sense of direction and failure detectors are state-of-the-art and will provide an entry to research in these still-developing topics.
"...an excellent overview of available techniques." Computing Reviews
Table of Contents:
Preface; 1. Introduction: distributed systems; Part I. Protocols: 2. The model; 3. Communication protocols; 4. Routing algorithms; 5. Deadlock-free packet switching; Part II. Fundamental Algorithms: 6. Wave and traversal algorithms; 7. Election algorithms; 8. Termination detection; 9. Anonymous networks; 10. Snapshots; 11. Sense of direction and orientation; 12. Synchrony in networks; Part III. Fault Tolerance: 13. Fault tolerance in distributed systems; 14. Fault tolerance in asynchronous systems; 15. Fault tolerance in synchronous systems; 16. Failure detection; 17. Stabilization; Part IV. Appendix A: pseudocode conventions; Appendix B: graphs and networks; References; Index.
More
