WIN $150 GIFT VOUCHERS: ALADDIN'S GOLD

Close Notification

Your cart does not contain any items

$128.95

Paperback

Not in-store but you can order this
How long will it take?

QTY:

English
Cambridge University Press
21 July 2005
The foundations of parallel computation, especially the efficiency of computation, are the concern of this book. Distinguished international researchers have contributed fifteen chapters which together form a coherent stream taking the reader who has little prior knowledge of the field to a position of being familiar with leading edge issues. The book may also function as a source of teaching material and reference for researchers. The first part is devoted to the Parallel Random Access Machine (P-RAM) model of parallel computation. The initial chapters justify and define the model, which is then used for the development of algorithm design in a variety of application areas such as deterministic algorithms, randomisation and algorithm resilience. The second part deals with distributed memory models of computation. The question of efficiently implementing P-RAM algorithms within these models is addressed as are the immensely interesting prospects for general purpose parallel computation.
Edited by:   , ,
Series edited by:   , ,
Imprint:   Cambridge University Press
Country of Publication:   United Kingdom
Volume:   4
Dimensions:   Height: 243mm,  Width: 170mm,  Spine: 24mm
Weight:   705g
ISBN:   9780521017602
ISBN 10:   0521017602
Series:   Cambridge International Series on Parallel Computation
Pages:   448
Publication Date:  
Audience:   Professional and scholarly ,  Undergraduate
Format:   Paperback
Publisher's Status:   Active
1. Structural parallel algorithmics Uzi Vishkin; 2. PRAM models and fundamental parallel algorithmic techniques: part I Paul G. Spirakis and Alan Gibbons; 3. PRAM models and fundamental parallel algorithmic techniques: part II Paul G. Spirakis; 4. Efficient parallel graph algorithms Vijaya Ramachandran; 5. Some parallel geometric algorithms Colm O'Dunlaing; 6. Parallel algorithms for string pattern matching Costas S. Iliopoulos; 7. Design of parallel matrix algorithms D. J. Evans; 8. Dependable parallel computing on unreliable parallel machines Z. M. Kedem, K. V. Palem, A. Raghunathan and P. G. Spirakis; 9. P-completeness Jacobo Toran; 10. Introduction to distributed memory models of parallel computation Alan Gibbons; 11. Network orientation Gerard Tel; 12. Special purpose parallel computing W. F. McColl; 13. General purpose parallel computing W. F. McColl; 14. Complexity models for all-purpose parallel computation Andrew Chin; 15. Implementing sparse BLAS primitives on concurrent/vector processors H. A. G. Wijshoff.

Reviews for Lectures in Parallel Computation

...of most interest to advanced computer scientists (for whom it could be a very good reference)..could be used for self-instruction, or as a text-book for an advanced graduate course...a must for theoretical computer scientists whose interests are in the foundations of parallel computing. IEEE Parallel & Distributed Technology


See Also