Items related to Introduction to Parallel Algorithms (Wiley Series on...

Introduction to Parallel Algorithms (Wiley Series on Parallel and Distributed Computing) - Hardcover

Xavier, C.; Iyengar, S. S.

 
9780471251828: Introduction to Parallel Algorithms (Wiley Series on Parallel and Distributed Computing)

Synopsis

Parallel algorithms Made Easy

The complexity of today's applications coupled with the widespread use of parallel computing has made the design and analysis of parallel algorithms topics of growing interest. This volume fills a need in the field for an introductory treatment of parallel algorithms-appropriate even at the undergraduate level, where no other textbooks on the subject exist. It features a systematic approach to the latest design techniques, providing analysis and implementation details for each parallel algorithm described in the book. Introduction to Parallel Algorithms covers foundations of parallel computing; parallel algorithms for trees and graphs; parallel algorithms for sorting, searching, and merging; and numerical algorithms. This remarkable book:

  • Presents basic concepts in clear and simple terms
  • Incorporates numerous examples to enhance students' understanding
  • Shows how to develop parallel algorithms for all classical problems in computer science, mathematics, and engineering
  • Employs extensive illustrations of new design techniques
  • Discusses parallel algorithms in the context of PRAM model
  • Includes end-of-chapter exercises and detailed references on parallel computing.

This book enables universities to offer parallel algorithm courses at the senior undergraduate level in computer science and engineering. It is also an invaluable text/reference for graduate students, scientists, and engineers in computer science, mathematics, and engineering.

"synopsis" may belong to another edition of this title.

About the Author

C. XAVIER teaches in the Department of Computer Science at St. Xavier College in Palayamkottai, India. He has published numerous papers on parallel algorithms and more than ten computer science textbooks.

S. S. IYENGAR is Professor and Chairman of the Department of Computer Science at Louisiana State University. He has published several books and more than 220 papers on high-performance algorithms and data structures and has headed research projects for such organizations as the Office of Naval Research, the National Aeronautics and Space Administration, the National Science Foundation, and others. He is a Fellow of the IEEE for research contributions to data structures and algorithms and received the University Distinguished Faculty Award.

From the Back Cover

Discusses the subject in four parts: foundation of parallel computing; parallel algorithms for trees and graphs; parallel algorithms for sorting, searching, and merging; and numerical algorithms. Provides the reader with step-by-step methods for developing parallel algorithms.

  • Covers analysis and implementation of the parallel algorithms.
  • Presents parallel algorithms in the context of PRAM (Parallel Array Manipulation Algorithm) model.
  • Clearly explains the material, using elaborate illustrations, numerous examples, and detailed references for each chapter.

From the Inside Flap

Parallel algorithms Made Easy

The complexity of today's applications coupled with the widespread use of parallel computing has made the design and analysis of parallel algorithms topics of growing interest. This volume fills a need in the field for an introductory treatment of parallel algorithms-appropriate even at the undergraduate level, where no other textbooks on the subject exist. It features a systematic approach to the latest design techniques, providing analysis and implementation details for each parallel algorithm described in the book. Introduction to Parallel Algorithms covers foundations of parallel computing; parallel algorithms for trees and graphs; parallel algorithms for sorting, searching, and merging; and numerical algorithms. This remarkable book:
* Presents basic concepts in clear and simple terms
* Incorporates numerous examples to enhance students' understanding
* Shows how to develop parallel algorithms for all classical problems in computer science, mathematics, and engineering
* Employs extensive illustrations of new design techniques
* Discusses parallel algorithms in the context of PRAM model
* Includes end-of-chapter exercises and detailed references on parallel computing.

This book enables universities to offer parallel algorithm courses at the senior undergraduate level in computer science and engineering. It is also an invaluable text/reference for graduate students, scientists, and engineers in computer science, mathematics, and engineering.

"About this title" may belong to another edition of this title.