Parallel Algorithms

C. Xavier

ISBN 10: 0471251828 / ISBN 13: 9780471251828

Published by Wiley Aug 1998, 1998

About this Item

Neuware - Parallel algorithms Made EasyThe 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.

Seller Inventory # 9780471251828

Bibliographic Details

• Title: Parallel Algorithms
• Publisher: Wiley Aug 1998
• Publication Date: 1998
• Language: English
• ISBN 10: 0471251828
• ISBN 13: 9780471251828
• Binding: Buch
• Condition: Neu
• Dimensions: 235W x 157H x 27D millimeters 235 millimeters width by 157 millimeters height by 27 millimeters depth
• Weight: 775 grams

About this title

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.

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.