MTU Cork Library Catalogue

Syndetics cover image
Image from Syndetics

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.
Material type: materialTypeLabelBookSeries: McGraw-Hill series in computer scienceNetworks--parallel and distributed computing: Publisher: New York : McGraw-Hill, c1994Edition: 2nd ed.Description: xvii, 446 p. : ill. ; 25 cm. + hbk.ISBN: 0070512949 .Subject(s): Parallel computersDDC classification: 004.35
Contents:
Introduction -- PRAM algorithms -- Processor arrays, multiprocessors and multicomputers -- Parallel programming languages -- Mapping and scheduling -- Elementary parallel algorithms -- Matrix multiplication -- The fast fourier transform -- Solving linear systems -- Sorting -- Dictionary operations -- Graph algorithms -- Combinatorial search.
Holdings
Item type Current library Call number Copy number Status Date due Barcode Item holds
General Lending MTU Bishopstown Library Store Item 004.35 (Browse shelf(Opens below)) 1 Available 00158295
General Lending MTU Bishopstown Library Lending 004.35 (Browse shelf(Opens below)) 1 Available 00086118
General Lending MTU Bishopstown Library Lending 004.35 (Browse shelf(Opens below)) 1 Available 00086117
Total holds: 0

Enhanced descriptions from Syndetics:

This book is approapriate for upper undergraduate/graduate courses in parallel processing, parallel computing or parallel algorithms, 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 provides practical insights into implementing parallel algorithms on actual parallel machines. The text includes coverage of matrix multiplications, the fast Fourier transform and combinatorial algorithms.

Rev. ed. of: Designing efficient algorithms for parallel computers. c1987.

Bibliography: (pages 391-433) and index.

Introduction -- PRAM algorithms -- Processor arrays, multiprocessors and multicomputers -- Parallel programming languages -- Mapping and scheduling -- Elementary parallel algorithms -- Matrix multiplication -- The fast fourier transform -- Solving linear systems -- Sorting -- Dictionary operations -- Graph algorithms -- Combinatorial search.

Powered by Koha