BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Parallel Algorithms

Parallel Algorithms

Parallel Algorithms Hardback - 2008

by Henri Casanova

Add to wish list
  • New
  • Hardback
New

Description

Hardback. New. Focusing on algorithms for distributed-memory parallel architectures, this book covers theoretical models of parallel computation, parallel algorithm design for homogeneous and heterogeneous platforms, complexity and performance analysis, and essential notions of scheduling.
Ask the seller a question Add to wish list
A$243.30
A$19.46 Delivery to USA
Standard delivery: 14 to 21 days
More delivery options
Ships from The Saint Bookstore (Merseyside, United Kingdom)
Biblio Top Seller
The BIBLIO Guarantee

Details

  • Title Parallel Algorithms
  • Author Henri Casanova
  • Binding Hardback
  • Edition INTERNATIONAL ED
  • Condition New
  • Pages 352
  • Volumes 1
  • Language ENG
  • Publisher CRC Press
  • Publication date 2008-07-01
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index, Table of Contents
  • Bookseller's Inventory # A9781584889458
  • ISBN 9781584889458 / 1584889454
  • Weight 1.45 lbs (0.66 kg)
  • Dimensions 9.3 x 6.4 x 0.9 in (23.62 x 16.26 x 2.29 cm)
  • Category Mathematics
  • Library of Congress subjects Parallel algorithms, Parallel programming (Computer science)
  • Library of Congress Catalogue Number 2008019142
  • Dewey Decimal Code 005.275
  • Quantity available 10

About The Saint Bookstore Merseyside, United Kingdom

Specialising in: Academic & Scholarly, Hard To Find Titles, Textbooks
Biblio member since 2018

The Saint Bookstore specialises in hard to find titles & also offers delivery worldwide for reasonable rates.

Terms of Sale: Refunds or Returns: A full refund of the price paid will be given if returned within 30 days in undamaged condition. If the product is faulty, we may send a replacement.

Browse books from The Saint Bookstore

Reader reviews for Parallel Algorithms

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

Focusing on algorithms for distributed-memory parallel architectures, Parallel Algorithms presents a rigorous yet accessible treatment of theoretical models of parallel computation, parallel algorithm design for homogeneous and heterogeneous platforms, complexity and performance analysis, and essential notions of scheduling. The book extracts fundamental ideas and algorithmic principles from the mass of parallel algorithm expertise and practical implementations developed over the last few decades.

In the first section of the text, the authors cover two classical theoretical models of parallel computation (PRAMs and sorting networks), describe network models for topology and performance, and define several classical communication primitives. The next part deals with parallel algorithms on ring and grid logical topologies as well as the issue of load balancing on heterogeneous computing platforms. The final section presents basic results and approaches for common scheduling problems that arise when developing parallel algorithms. It also discusses advanced scheduling topics, such as divisible load scheduling and steady-state scheduling.

With numerous examples and exercises in each chapter, this text encompasses both the theoretical foundations of parallel algorithms and practical parallel algorithm design.

About the author

Henri Casanova, Arnaud Legran, Yves Robert

Please wait a moment while we load the requested page.

tracking-