Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes / Edition 1

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $59.45
Usually ships in 1-2 business days
(Save 26%)
Other sellers (Hardcover)
  • All (10) from $59.45   
  • New (2) from $204.24   
  • Used (8) from $59.45   
Close
Sort by
Page 1 of 1
Showing 1 – 1 of 2
Note: Marketplace items are not eligible for any BN.com coupons and promotions
$204.24
Seller since 2014

Feedback rating:

(227)

Condition:

New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

New
Brand New Item.

Ships from: Chatham, NJ

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
Page 1 of 1
Showing 1 – 1 of 2
Close
Sort by

Overview

This seminal work presents the only comprehensive integration of significant topics in computer architecture and parallel algorithms. The text is written for designers, programmers, and engineers who need to understand these issues at a fundamental level in order to utilize the full power afforded by parallel computation. It will also be an important resource for students and researchers. Writing for an advanced general audience, the author assumes few prerequisites while developing an elegant narrative of fundamental issues in parallel computation and applied algorithm design.

The text is organized broadly by classes of network architectures and secondly by application domain. Emphasis is placed on developing a working knowledge of the essential paradigms of parallel computation, with techniques that are largely architecture independent. Basing the discussions on dominant communication networks that are the architectural basis of most parallel computing, the author describes the capabilities and limitations of the network architectures, as well as their use in solving specific algorithmic problems.

This organization draws upon the reader’s intuition by beginning with the most elementary and natural implementations. Starting with the simplest connection pattern of all—the linear array—and demonstrating its power with a number of illustrative applications, each subsequent algorithm is introduced using the simplest network on which it can be implemented. Throughout, the discussions consider the practical restrictions on hardware, with examples drawn from real implementations on commercially available machines. The thorough discussions and illuminating exercises offer significant insights about the subtleties that are the essence of parallel computing. The result for readers will be an in-depth understanding of parallel algorithms and architecture not available from any other source.

Read More Show Less

Editorial Reviews

Booknews
A text for an introductory course at the late undergraduate or early graduate level, as well as for designers, programmers, and engineers, based on the author's courses at MIT over the past eight years. The text covers the structure and relationships between the dominant network architectures, as well as the fastest and most efficient parallel algorithms for a wide variety of problems. It assumes only a general technical background (although familiarity with algorithms or programming would be helpful), and includes some 750 problems. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

  • ISBN-13: 9781558601178
  • Publisher: Elsevier Science & Technology Books
  • Publication date: 12/28/1991
  • Edition number: 1
  • Pages: 831
  • Product dimensions: 7.65 (w) x 9.52 (h) x 2.26 (d)

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)