INTRODUCTION TO PARALLEL COMPUTING: DESIGN AND ANALYSIS OF ALGORITHMS
Vipin Kumar, Ananth Grama, Anshul Gupta, and George Karypis
ISBN: 0-8053-3170-0.  Hardcover.  597 pp.  (c) 1994
Benjamin-Cummings  Addison-Wesley Publishing Company

Information about this book is  available through ftp from 
the site ftp.cs.umn.edu.
Login as anonymous, use your e-mail address as password,
and change directory to users/kumar/book.

You can also reach this directory via
www home page at http://project/web/users/kumar/book.html


The following supplementary material is available in this directory:

FILE/SUBDIRECTORY         DESCRIPTION
~~~~~~~~~~~~~~~         ~~~~~~~~~~~

bookinfo                General Information about the book
order-info              Ordering Information
errata                  Errata sheets for first and second printings
figures                 PostScript files of all figures in the book
pseudo                  Files containing all programs/pseudocodes in the book
suppl-probs.ps          Additional exercises/projects/exams etc.
table-of-contents       ASCII file of table of contents
table-of-contents.ps    PostScript file of table of contents
tables                  Files containing all the tables of the book

--------------------------------------------------------------------
TO ORDER, PLEASE VISIT YOUR LOCAL TECHNICAL BOOKSTORE OR 
contact Addison-Wesley Publisher:

U.S. TELEPHONE ORDERS: Call 800/447-2226

CANADIAN ORDERS: Call 416/447-5101

INTERNATIONAL ORDERS: Call 617/944-3700 and ask how to contact 
              the International Office closest to you.


Instructors can order a complimentary  examination copy from
a local Addison-Wesley / Benjamin-Cummings college sales representative
or by dialing  
1-800-552-2499  (USA)
800-463-0536 (Canada)  

*************************************************************

FEATURES

* Presents parallel algorithms in terms of a small set of 
  basic data communication operations, greatly simplifying 
  the design and understanding of these algorithms. 

* Emphasizes practical issues of performance, efficiency, 
  and scalability.

* Provides a self-contained discussion of the basic concepts 
  of parallel computer architectures.

* Covers algorithms for scientific computation, such as 
  dense and sparse matrix computations, linear system 
  solving, finite elements, and FFT.

* Discusses algorithms for combinatorial optimization, 
  including branch-and-bound, unstructured tree search, and 
  dynamic programming.

* Incorporates various parallel programming models and 
  languages as well as illustrative examples for 
  commercially-available computers.


SOLUTIONS MANUAL (33171-9)

Solution manual contains solutions to most of the problems in the book.

*********************************************************************
REVIEWER QUOTES

Here are some excerpts from a review of my textbook that appeared in
the summer 1994 issue of the IEEE Parallel and Distributed Technology Magazine.


This is the best of the books I have seen on parallel algorithms.  It 
has good coverage, examples, and figures, and is quite well written.S
     --Gregory Andrews, University of Arizona

INTRODUCTION TO PARALLEL COMPUTING: DESIGN AND ANALYSIS OF ALGORITHMS is 
excellent overall.  The problem sets are the best I have seen in a book 
of this kind.S
     --John Gustafson, Ames Laboratory

The book is far and away the best treatment of this material I have 
found.S
     --Dirk Grunwald, University of Colorado


``It is the BEST TEXT on this subject I have yet found,
and will sit next to Sedgewick's Algorithms books, Press et al's
Numerical Recipes, and Knuth's magnum opus on my shelves.   ....
Kumar et al.'s concentration
on the complexity analysis of parallel algorithms for meshes and
hypercubes makes it the best foundation for a graduate course on
parallel algorithms that I have yet seen, and a good reference for
practitioners who need some inspiration.''
 - IEEE Parallel and Distributed Technology Magazine Book Review
             (by Gregory Wilson)

*************************************************************
SUPPLEMENTARY MATERIAL for the TEXT

This is to announce  the availability of supplementary material and
other information regarding the text book "INTRODUCTION TO PARALLEL
COMPUTING: DESIGN  AND  ANALYSIS  OF  ALGORITHMS" (by Kumar, Grama,
Gupta  and Karypis, Publisher:  Benjamin  Cummings, November 93) by
anonymous ftp.

The  following  supplementary  material  is currently available via
anonymous  ftp  from  the sites ftp.cs.umn.edu:users/kumar/book and
bc.aw.com:bc/kumar:

a) Postscript files  containing the figures, tables and pseudocodes
in the text.
b) Errata sheet. 

If you would like to receive  more  information  on how to retrieve
these,  or about the book in general, or be added to a mailing list
announcing  updates  and additional  material  on the book, you can
send E-MAIL to book-vk@cs.umn.edu.

Solutions  to  problem  sets  in  the  book  are  available  in  an 
instructors  guide  directly from Benjamin/Cummings (or contact your
local Addison Wesley / Benjamin/Cummings representative).