MARC details
000 -LEADER |
fixed length control field |
02976mam a2200289 a 4500 |
CONTROL NUMBER |
control field |
1448388 |
DATE AND TIME OF LATEST TRANSACTION |
control field |
20150602162906.0 |
FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
930804s1994 nyua b 001 0 eng |
LIBRARY OF CONGRESS CONTROL NUMBER |
LC control number |
93029813 |
INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9780070495463 |
DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
004.35 |
Item number |
QUI |
MAIN ENTRY--PERSONAL NAME |
Personal name |
Quinn, Michael J. |
Fuller form of name |
(Michael Jay) |
9 (RLIN) |
6599 |
TITLE STATEMENT |
Title |
Parallel computing: |
Remainder of title |
theory and practice / |
Statement of responsibility, etc |
Michael J. Quinn. |
EDITION STATEMENT |
Edition statement |
2nd ed. |
PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
Place of publication, distribution, etc |
New Delhi : |
Name of publisher, distributor, etc |
TMH, |
Date of publication, distribution, etc |
2012, c1994. |
PHYSICAL DESCRIPTION |
Extent |
xvii, 446 p. : |
Other physical details |
ill. ; |
Dimensions |
25 cm. |
SERIES STATEMENT |
Series statement |
McGraw-Hill series in computer science. Networks--parallel and distributed computing |
GENERAL NOTE |
General note |
Rev. ed. of: Designing efficient algorithms for parallel computers. c1987. |
BIBLIOGRAPHY, ETC. NOTE |
Bibliography, etc |
Includes bibliographical references (p. 391-433) and index. |
FORMATTED CONTENTS NOTE |
Formatted contents note |
1. Introduction -- 2. PRAM Algorithms -- 3. Processor Arrays, Multiprocessors, and Multicomputers -- 4. Parallel Programming Languages -- 5. Mapping and Scheduling -- 6. Elementary Parallel Algorithms -- 7. Matrix Multiplication -- 8. The Fast Fourier Transform -- 9. Solving Linear Systems -- 10. Sorting -- 11. Dictionary Operations -- 12. Graph Algorithms -- 13. Combinatorial Search -- App. A Graph Theoretic Terminology -- App. B Review of Complex Numbers -- App. C Parallel Algorithm Design Strategies. |
SUMMARY, ETC. |
Summary, etc |
This text provides an exceptional introduction to parallel computing by balancing theory and practice. The emphasis is on designing, analyzing and implementing parallel algorithms suitable for execution on real parallel computers. Early chapters set the stage by introducing key concepts, illustrating fundamental parallel algorithms, and describing ways to incorporate high-level parallelism into hardware and software. |
SUMMARY, ETC. |
Summary, etc |
Later chapters explore the development of parallel algorithms for matrix multiplication, the fast Fourier transform, solving linear systems, sorting, searching, graph theoretic problems, and combinatorial search. Numerous graphs illustrate the speedups that can be achieved on actual parallel hardware by implementing the parallel algorithms developed in the text. As a result, students learn how to make efficient use of emerging parallel computer technology. |
SUMMARY, ETC. |
Summary, etc |
. |
SUMMARY, ETC. |
Summary, etc |
A number of additional features make this book distinctive: it surveys some of the most popular parallel computer architectures, including Thinking Machines' CM-5, Intel's Paragon XP/S, and the Sequent Symmetry; it covers some of the most popular parallel programming languages, including Fortran 90, C*, Linda and OCCAM; a glossary of parallel computing terminology contains all the terms defined in the text; more than 200 exercises cover the gamut from proofs to programming assignments; the exceptionally large bibliography provides ample opportunities for further study; and Library of Congress call numbers simplify access to frequently cited journals and proceedings. |
SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Parallel computers. |
9 (RLIN) |
6600 |
ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
Dewey Decimal Classification |
Item type |
Books |