Practical PRAM Programming
Published on 22. December 2000
Book
Hardback
XXVI, 572 pages
978-0-471-35351-5 (ISBN)
Description
Although PRAM (Parallel Random Access Memory) is a well-known topic in parallel computing, its practical application has rarely been explored. This groundbreaking work changes all that. Written by world experts on this technology, it explains how to use PRAM to design algorithms for parallel computers and includes a number of PRAM implementations. Readers can also use the book as a self-study guide to parallel programming in general.
Reviews / Votes
"the book is excellent for its target audience..." (Application Development Advisor, April 2001) "...researchers - deal with theoretical and practical aspects of parallel programming in the parallel random access machine..." (SciTech Book News, Vol. 25, No. 4, December 2001)More details
Series
Language
English
Place of publication
New York
United States
Publishing group
John Wiley and Sons Ltd
Target group
College/higher education
Professional and scholarly
Illustrations
glossary, references
Dimensions
Height: 24.2 cm
Width: 16.5 cm
Weight
958 gr
ISBN-13
978-0-471-35351-5 (9780471353515)
Schweitzer Classification
Persons
JORG KELLER, PhD, is an associate professor of computer engineering at Universitat Hagen, Germany, investigating the use of commercial microprocessors in PRAM emulations. CHRISTOPH W. KEsLER, PhD, is an assistant professor in the computer science department at the University of Trier, Germany. His primary research is on the design and implementation of parallel programming languages. JESPER LARSSON TRAFF, PhD, is a research staff member with NEC Europe Ltd. He has worked extensively on the PAD library for the SB-PRAM while at the Max-Planck-Institut fur Informatik, Saarbrucken, Germany.
Content
The PRAM model of parallel computation; PRAM emulation; an emulation of a PRAM in hardware; fork; implementation of fork; parallel algorithmic paradigms and programming techniques; a library of basic PRAM algorithms; an example application.