Posts tagged as:

algorithm

Topological Algorithms for Digital Image Processing

March 10, 2010 · 0 comments

41FlDR1a5eL. BO2,204,203,200 PIsitb sticker arrow click,TopRight,35, 76 AA240 SH20 OU01 Topological Algorithms for Digital Image Processing

Product Description

The work looks at basic topological algorithms, presenting their underlying theory and discussing their applications. The notations and terminologies used in the text introduce readers to the even wider variety that exists in the literature dealing with topological algorithms. Some of the basic terminology and fundamental concepts of digital topology are reviewed in the appendix, which also describes important areas of the field. [click to continue…]

Parallel Iterative Algorithms: From Sequential to Grid Computing

March 9, 2010 · 0 comments

519WcaExwPL. BO2,204,203,200 PIsitb sticker arrow click,TopRight,35, 76 AA240 SH20 OU01 Parallel Iterative Algorithms: From Sequential to Grid Computing

Product Description
Focusing on grid computing and asynchronism, Parallel Iterative Algorithms explores the theoretical and practical aspects of parallel numerical algorithms. Each chapter contains a theoretical discussion of the topic, an algorithmic section that fully details implementation examples and specific algorithms, and an evaluation of the advantages and drawbacks of the algorithms. Several exercises also appear at the end of most chapters.

The first two chapters introduce the general features of sequential iterative algorithms and their applications to numerical problems. The book then describes different kinds of parallel systems and parallel iterative algorithms. It goes on to address both linear and nonlinear parallel synchronous and asynchronous iterative algorithms for numerical computation, with an emphasis on the multisplitting approach. The final chapter discusses the features required for efficient implementation of asynchronous iterative algorithms.

Providing the theoretical and practical knowledge needed to design and implement efficient parallel iterative algorithms, this book illustrates how to apply these algorithms to solve linear and nonlinear numerical problems in parallel environments, including local, distant, homogeneous, and heterogeneous clusters.

Review
In Parallel Iterative Algorithms: From Sequential to Grid Computing, Bahi, Contassot-Vivier, and Couturier bring mathematical formalism to the study of parallel iterative solution techniques, creating a book that will be useful to those with a strong maths background who are making the transition into parallel scientific computing. … a great fit as a part of a graduate-level course on scientific computing in the math department, or for those already in scientific computing seeking to understand the key mathematical foundations of the analysis of iterative techniques. … The authors execute their mission well, making sure that they treat the mathematical theory of each method in just enough detail to be complete. … The combination of the theory and the implementation is valuable, and I found it illuminating to revisit algorithms I only knew at an implementation level from the mathematical perspective and to understand the reasons behind behaviors I had always taken as given. … a nice addition to your HPC bookshelf in that it brings a strong focus on mathematical formalism, which is often lacking in more computing-oriented approaches to numerical methods. … the book is loaded with citations, and readers looking for a different point of view or for more in depth material on a particular point will find a wealth of pointers to the literature.
—John West, HPCwire, February 2009

Product Details

Distributed Computing: Principles, Algorithms, and Systems

March 9, 2010 · 0 comments

51kxb4LLlWL. BO2,204,203,200 PIsitb sticker arrow click,TopRight,35, 76 AA240 SH20 OU01 Distributed Computing: Principles, Algorithms, and Systems

Product Description
Designing distributed computing systems is a complex process requiring a solid understanding of the design problems and the theoretical and practical aspects of their solutions. This comprehensive textbook covers the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. Broad and detailed coverage of the theory is balanced with practical systems-related issues such as mutual exclusion, deadlock detection, authentication, and failure recovery. Algorithms are carefully selected, lucidly presented, and described without complex proofs. Simple explanations and illustrations are used to elucidate the algorithms. Important emerging topics such as peer-to-peer networks and network security are also considered. With state-of-the-art algorithms, numerous illustrations, examples and homework problems, this textbook is suitable for advanced undergraduate and graduate students of electrical and computer engineering and computer science. Practitioners in data networking and sensor networks will also find this a valuable resource. Additional resources are available online at www.cambridge.org/9780521876346.

Book Description
Comprehensive textbook covering the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. For advanced undergraduate and graduate students of electrical and computer engineering and computer science. Also of interest to practitioners in data networking, wireless networking, and sensor networks. Additional resources online: www.cambridge.org/9780521876346. [click to continue…]

1