9780262100366

The Characteristics of Parallel Algorithms

by ; ;
  • ISBN13:

    9780262100366

  • ISBN10:

    0262100363

  • Format: Hardcover
  • Copyright: 1987-05-01
  • Publisher: Mit Pr

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $49.50 Save up to $12.37
  • Buy Used
    $37.13
    Add to Cart Free Shipping

    USUALLY SHIPS IN 2-4 BUSINESS DAYS

Supplemental Materials

What is included with this book?

Summary

Although there has been a tremendous growth of interest in parallel architecture and parallel processing in recent years, comparatively little work has been done on the problem of characterizing parallelism in programs and algorithms. This book, a collection of original papers, specifically addresses that topic. The editors and two dozen other contributors have produced a work that cuts across numerical analysis, artificial intelligence, and database management, speaking to questions that lie at the heart of current research in these and many other fields of knowledge: How much commonality in algorithm structure is there across problem domains? What attributes of algorithms are the most important in dictating the structure of a parallel algorithm? How can algorithms be matched with languages and architectures? Their book provides an important starting place for a comprehensive taxonomy of parallel algorithms. The authors are all in the Department of Electrical Engineering at Purdue University. Leah H. Jamieson is a professor, Dennis Gannon an associate professor, and Robert Douglass head of Machine Intelligence. The Characteristics of Parallel Algorithmsis included in the Scientific Computation Series, edited by Dennis Gannon.

Rewards Program

Write a Review