Parallel computing : theory and practice / Michael J. Quinn.
By: Quinn, Michael J. (Michael Jay)
.
Contributor(s): Quinn, Michael J. (Michael Jay). Designing efficient algorithms for parallel computers, 1987.
Material type:
BookSeries: McGraw-Hill computer science seriesNetworks--parallel and distributed computing: Publisher: New York : McGraw-Hill, c1994Edition: 2nd ed.Description: xvii, 446 p. : ill. ; 25 cm.Content type: text Media type: unmediated Carrier type: volumeISBN: 0071138005 (pbk); 9780071138000.Subject(s): Parallel computers | Mathematical theory of computation | Parallel processing | Parallel programmingDDC classification: 004.35 QUI Summary: Familiarizes readers with classical results in the theory of parallel computing and discusses problems encountered when implementing parallel algorithms on real parallel computers. The text includes coverage of matrix multiplications, the fast Fourier transform and combinatorial algorithms.
| Item type | Current library | Call number | Copy number | Status | Barcode | |
|---|---|---|---|---|---|---|
| General lending | MTU Kerry North Campus Library Ground Floor Main | 004.35 QUI (Browse shelf(Opens below)) | 1 | Available | 38888000437149 |
Browsing MTU Kerry North Campus Library shelves, Shelving location: Ground Floor Main Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 004.35 AND Concurrent programming : principles and practice / | 004.35 ATT Distributed computing : fundamentals, abstractions and advanced topics / | 004.35 BEO Beowulf cluster computing with Linux / | 004.35 QUI Parallel computing : theory and practice / | 004.36 GOL Client/server information systems : a business-oriented approach / | 004.36 ORF Instant CORBA / | 004.36 PRO Professional Team Foundation Server 2010 / |
Enhanced descriptions from Syndetics:
This book is approapriate for undergraduate courses in parallel processing and parallel computing, offered in Computer Science or Computer Engineering departments. Prerequisites include computer architecture and analysis of algorithms. This book familiarizes readers with classical results in the theory of parallel computing and explains reasons behind the growth of parallel computing, as well as obstacles that limit the effectiveness of parallelism. The text also discusses problems encountered when implementing parallel algorithms on real parallel computers, developing eight practical algorithm design strategies. Chapters on parallel algorithms are organized according to problem domain and separate chapters discuss matrix multiplications, the fast Fourier transform, solving systems of linear equations and combinatorial algorithms.
Rev. ed. of: Designing efficient algorithms for parallel computers. c1987.
Includes bibliographical references (p. 391-433) and index.
Familiarizes readers with classical results in the theory of parallel computing and discusses problems encountered when implementing parallel algorithms on real parallel computers. The text includes coverage of matrix multiplications, the fast Fourier transform and combinatorial algorithms.