Elements of Parallel Computing
Eric Aubanel
Sold by THE SAINT BOOKSTORE, Southport, United Kingdom
AbeBooks Seller since June 14, 2006
New - Soft cover
Condition: New
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Add to basketSold by THE SAINT BOOKSTORE, Southport, United Kingdom
AbeBooks Seller since June 14, 2006
Condition: New
Quantity: 1 available
Add to basketNew copy - Usually dispatched within 4 working days.
Seller Inventory # B9781498727891
Designed for introductory parallel computing courses at the advanced undergraduate or beginning graduate level, Elements of Parallel Computing presents the fundamental concepts of parallel computing not from the point of view of hardware, but from a more abstract view of algorithmic and implementation patterns. The aim is to facilitate the teaching of parallel programming by surveying some key algorithmic structures and programming models, together with an abstract representation of the underlying hardware. The presentation is friendly and informal. The content of the book is language neutral, using pseudocode that represents common programming language models.
The first five chapters present core concepts in parallel computing. SIMD, shared memory, and distributed memory machine models are covered, along with a brief discussion of what their execution models look like. The book also discusses decomposition as a fundamental activity in parallel algorithmic design, starting with a naive example, and continuing with a discussion of some key algorithmic structures. Important programming models are presented in depth, as well as important concepts of performance analysis, including work-depth analysis of task graphs, communication analysis of distributed memory algorithms, key performance metrics, and a discussion of barriers to obtaining good performance.
The second part of the book presents three case studies that reinforce the concepts of the earlier chapters. One feature of these chapters is to contrast different solutions to the same problem, using select problems that aren't discussed frequently in parallel computing textbooks. They include the Single Source Shortest Path Problem, the Eikonal equation, and a classical computational geometry problem: computation of the two-dimensional convex hull. After presenting the problem and sequential algorithms, each chapter first discusses the sources of parallelism then surveys parallel algorithms.
"About this title" may belong to another edition of this title.
Please order through the Abebooks checkout. We only take orders through Abebooks - We don't take direct orders by email or phone.
Refunds or Returns: A full refund of the purchase price will be given if returned within 30 days in undamaged condition.
As a seller on abebooks we adhere to the terms explained at http://www.abebooks.co.uk/docs/HelpCentral/buyerIndex.shtml - if you require further assistance please email us at orders@thesaintbookstore.co.uk
Most orders usually ship within 1-3 business days, but some can take up to 7 days.
| Order quantity | 7 to 28 business days | 7 to 28 business days |
|---|---|---|
| First item | US$ 20.39 | US$ 23.10 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.