Printer Friendly

Design and analysis of distributed algorithms.


Design and analysis of distributed algorithms.

Santoro, Nicola.



589 pages



Wiley series on parallel and distributed computing


Santoro (computer science, Carleton U., Canada) describes the general principles and techniques for creating algorithms in a distributed (networked) computing environment that are intended to ensure both correctness and efficiency. Requiring standard undergraduate knowledge of operating systems and algorithms, his text contains nine chapters covering distribute computing environments, basic problems and protocols, election protocols, message routing and shortest paths, distributed set operations, synchronous computations, computing in the presence of faults, detecting stable properties, and continuous computations.

([c]20062005 Book News, Inc., Portland, OR)
COPYRIGHT 2006 Book News, Inc.
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2006 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Publication:SciTech Book News
Article Type:Book Review
Date:Dec 1, 2006
Previous Article:101 pearls in refractive, cataract, and corneal surgery, 2d ed.
Next Article:Oozing the moon; a sky and night woods guide to the galaxy.

Related Articles
Computer architecture for machine perception; proceedings.
Parallel Architectures, Algorithms, and Networks: Proceedings.
Handbook of parallel computing and statistics.
Parallel Computing for Bioinformatics and Computational Biology: Models, Enabling Technologies, and Case Studies.
The RFF reader in environmental and resource policy, 2d ed.
Parallel and Distributed Systems: Proceedings, 2 vols.
Skillmasters expert ECG interpretation, 2d ed.
Parallel computing in electrical engineering; proceedings.
Albert R. Roberts and Kenneth R. Yeager, Foundations of Evidence Based Social Work Practice.

Terms of use | Copyright © 2018 Farlex, Inc. | Feedback | For webmasters