Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Concurrent scientific computing
van de Velde E., Springer-Verlag New York, Inc., New York, NY, 1994. Type: Book (9780387941950)
Date Reviewed: Feb 1 1995

Derived from lectures given since 1988 in a course on “Concurrent Scientific Computing” at the California Institute of Technology, this book uses a stepwise refinement approach to developing parallel computer programs. Using a modified version of the “UNITY notation,” Van de Velde presents several versions of the same algorithm using pseudocode with increasing amounts of implementation detail but always keeping to a general framework. His goal is to specify the pseudocode precisely enough for rigorous algorithmic analysis while avoiding much of the technical detail that would be necessary when using a programming language.

For those who are not familiar with UNITY, it may take a while to get used to this notation and, in particular, to the level of abstraction used in some of the more complicated algorithms. This approach seems to be an excellent way to get the key ideas across without having to go into specific parallel architectural dependences, however. The book is divided into 12 chapters:

  • The Basics

  • Vector and Matrix Operations

  • Iterative Methods

  • LU-Decomposition

  • QR-Decomposition

  • Tridiagonal Solvers

  • The Fast Fourier Transform

  • Poisson Solvers

  • Multigrid Methods

  • Domain Decomposition

  • Particle Methods

  • Computer Dependency

By using a stepwise approach to parallel program development, the author has produced a compact book that covers many topics of interest to students in concurrent scientific computing, while giving instructors a delightful and teachable textbook.

Reviewer:  David R. Kincaid Review #: CR118382
Bookmark and Share
 
Parallel Algorithms (G.1.0 ... )
 
 
Analysis Of Algorithms (I.1.2 ... )
 
 
Parallelism And Concurrency (F.1.2 ... )
 
 
Numerical Algorithms And Problems (F.2.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Parallel Algorithms": Date
Parallel algorithms in computational science
Heermann D., Burkitt A., Springer-Verlag New York, Inc., New York, NY, 1991. Type: Book (9780387534183)
Apr 1 1992
A parallel shortest augmenting path algorithm for the assignment problem
Balas E., Miller D., Pekny J., Toth P. (ed) Journal of the ACM 38(4): 985-1004, 1991. Type: Article
Sep 1 1992
An o(n log n) minimal spanning tree algorithmn for n points in the plane
Changm R., Lee R. BIT 26(1): 7-16, 1986. Type: Article
Nov 1 1987
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy