The Characteristics of Parallel Algorithms

Jamieson, Leah, Dennis Gannon, and Robert J. Douglass, editors

ISBN 10: 0262100363 / ISBN 13: 9780262100366

Published by The MIT Press, 1987

About this Item

Hardcover; MIT Press Scientific Computation Series; surplus library copy with the usual stampings; reference number taped to spine; light shelf wear, light fading to cover; otherwise in good condition with clean text, tight binding. Seller Inventory # 43171

Bibliographic Details

Title: The Characteristics of Parallel Algorithms

Publisher: The MIT Press

Publication Date: 1987

Binding: Hardcover

Condition: UsedGood

About this title

Synopsis:

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 Characteristics of Parallel Algorithms is included in the Scientific Computation Series, edited by Dennis Gannon.

About the Author:

Robert Douglass head of Machine Intelligence and part of the Department of Electrical Engineering at Purdue University.