The Characteristics of parallel algorithms

Front Cover
Leah H Jamieson, Dennis Gannon, Robert J Douglass
Mit Press, 1987 - Parallel programming (Computer science) - 440 pages
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 Algorithms is included in the Scientific Computation Series, edited by Dennis Gannon.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Programming Paradigms for Nonshared Memory Parallel Computers
3
Chapter
15
Chapter 2
21
Copyright

15 other sections not shown

Common terms and phrases

Bibliographic information