Introduction to parallel algorithms and architectures : arrays, trees, hypercubes / F. Thomson Leighton.

By: Leighton, Frank ThomsonMaterial type: TextTextPublisher: San Mateo, Calif. : M. Kaufmann Publishers, c1992Description: xviii, 831 p. : ill. ; 24 cmISBN: 1558601171; 9781558601178Subject(s): Parallel algorithms | Parallel processing (Electronic computers)Additional physical formats: Online version:: Introduction to parallel algorithms and architectures.DDC classification: 004/.35 LOC classification: QA76.58 | .L45 1992Other classification: 54.51 | DAT 216f | DAT 516f | DAT 530f | ST 130 | ST 151 | *68-01 | 68Q10 | 68Q80 | 68W15
Contents:
Elementary sorting and counting -- Integer arithmetic -- Matrix algorithms -- Retiming and systolic conversion -- Graph algorithms -- Sorting revisited -- Packet routing -- Image analysis and computational geometry -- Higher-dimensional arrays -- The two-dimensional mesh of trees -- Elementary O(log N)-step algorithms -- Integer arithmetic -- Matrix algorithms -- Graph algorithms -- Fast evaluation of straight-line code -- Higher-dimensional meshes of trees -- The hypercube -- The butterfly, cube-connected-cycles, and Beneš network -- The shuffle-exchange and de Bruijn graphs -- Packet-routing algorithms -- Sorting -- Simulating a parallel random access machine -- The fast Fourier transform -- Other hypercubic networks.
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode
Book University of Texas At Tyler
Stacks - 3rd Floor
QA76.58 .L45 1992 (Browse shelf) Available 0000000814509

Includes bibliographical references (p. [785]-801) and indexes.

Elementary sorting and counting -- Integer arithmetic -- Matrix algorithms -- Retiming and systolic conversion -- Graph algorithms -- Sorting revisited -- Packet routing -- Image analysis and computational geometry -- Higher-dimensional arrays -- The two-dimensional mesh of trees -- Elementary O(log N)-step algorithms -- Integer arithmetic -- Matrix algorithms -- Graph algorithms -- Fast evaluation of straight-line code -- Higher-dimensional meshes of trees -- The hypercube -- The butterfly, cube-connected-cycles, and Beneš network -- The shuffle-exchange and de Bruijn graphs -- Packet-routing algorithms -- Sorting -- Simulating a parallel random access machine -- The fast Fourier transform -- Other hypercubic networks.

There are no comments on this title.

to post a comment.