skip to content
Introduction to parallel processing : algorithms and architectures Preview this item
ClosePreview this item
Checking...

Introduction to parallel processing : algorithms and architectures

Author: Behrooz Parhami
Publisher: New York : Plenum Press, ©1999.
Series: Plenum series in computer science.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Summary:

This explosive growth, linked with the expectation that performance will continue its exponential rise with each new generation of hardware and that (in stark contrast to software) computer hardware  Read more...

Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Additional Physical Format: Print version:
Parhami, Behrooz.
Introduction to parallel processing.
New York : Plenum Press, ©1999
(DLC) 98045719
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Behrooz Parhami
ISBN: 0306459701 9780306459702 0306469642 9780306469640 6610205124 9786610205127
OCLC Number: 228374866
Description: 1 online resource (xxi, 532 pages) : illustrations.
Contents: Cover --
Preface --
Table of Contents --
Part I. Fundamental Concepts --
Chapter 1. Introduction to Parallelism --
1.1. Why Parallel Processing? --
1.2. A Motivating Example --
1.3. Parallel Processing Ups and Downs --
1.4. Types of Parallelism: A Taxonomy --
1.5. Roadblocks to Parallel Processing --
1.6. Effectiveness of Parallel Processing --
Problems --
References and Suggested Reading --
Chapter 2. A Taste of Parallel Algorithms --
2.1. Some Simple Computations --
2.2. Some Simple Architectures --
2.3. Algorithms for a Linear Array --
2.4. Algorithms for a Binary Tree --
2.5. Algorithms for a 2D Mesh --
2.6. Algorithms with Shared Variables --
Problems --
References and Suggested Reading --
Chapter 3. Parallel Algorithm Complexity --
3.1. Asymptotic Complexity --
3.2. Algorithm Optimality and Efficiency --
3.3. Complexity Classes --
3.4. Parallelizable Tasks and the NC Class --
3.5. Parallel Programming Paradigms --
3.6. Solving Recurrences --
Problems --
References and Suggested Reading --
Chapter 4. Models of Parallel Processing --
4.1. Development of Early Models --
4.2. SIMD versus MIMD Architectures --
4.3. Global versus Distributed Memory --
4.4. The PRAM Shared-Memory Model --
4.5. Distributed-Memory or Graph Models --
4.6. Circuit Model and Physical Realizations --
Problems --
References and Suggested Reading --
Part II. Extreme Models --
Chapter 5. PRAM and Basic Algorithms --
5.1. PRAM Submodels and Assumptions --
5.2. Data Broadcasting --
5.3. Semigroup or Fan-In Computation --
5.4. Parallel Prefix Computation --
5.5. Ranking the Elements of a Linked List --
5.6. Matrix Multiplication --
Problems --
References and Suggested Reading --
Chapter 6. More Shared-Memory Algorithms --
6.1. Sequential Rank-Based Selection --
6.2. A Parallel Selection Algorithm --
6.3. A Selection-Based Sorting Algorithm --
6.4. Alternative Sorting Algorithms --
6.5. Convex Hull of a 2D Point Set --
6.6. Some Implementation Aspects --
Problems --
References and Suggested Reading --
Chapter 7. Sorting and Selection Networks --
7.1. What Is a Sorting Network --
7.2. Figures of Merit for Sorting Networks --
7.3. Design of Sorting Networks --
7.4. Batcher Sorting Networks --
7.5. Other Classes of Sorting Networks --
7.6. Selection Networks --
Problems --
References and Suggested Reading --
Chapter 8. Other Circuit-Level Examples --
8.1. Searching and Dictionary Operations --
8.2. A Tree-Structured Dictionary Machine --
8.3. Parallel Prefix Computation --
8.4. Parallel Prefix Networks --
8.5. The Discrete Fourier Transform --
8.6. Parallel Architectures for FFT --
Problems --
References and Suggested Reading --
Part III. Mesh-Based Architectures --
Chapter 9. Sorting on a 2D Mesh or Torus --
9.1. Mesh-Connected Computers --
9.2. The Shearsort Algorithm --
9.3. Variants of Simple Shearsort --
9.4. Recursive Sorting Algorithms --
9.5. A Nontrivial Lower Bound --
9.6. Achieving the Lower Bound --
Problems --
References and Suggested Reading --
Chapter 10. Routing on a 2D Mesh or Torus --
tidti
Series Title: Plenum series in computer science.
Responsibility: Behrooz Parhami.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/228374866> # Introduction to parallel processing : algorithms and architectures
    a schema:CreativeWork, schema:Book, schema:MediaObject ;
    library:oclcnum "228374866" ;
    library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nyu> ;
    schema:about <http://id.worldcat.org/fast/1052928> ; # Parallel processing (Electronic computers)
    schema:about <http://dewey.info/class/004.35/e21/> ;
    schema:bookFormat schema:EBook ;
    schema:copyrightYear "1999" ;
    schema:creator <http://viaf.org/viaf/55932739> ; # Behrooz Parhami
    schema:datePublished "1999" ;
    schema:description "Cover -- Preface -- Table of Contents -- Part I. Fundamental Concepts -- Chapter 1. Introduction to Parallelism -- 1.1. Why Parallel Processing? -- 1.2. A Motivating Example -- 1.3. Parallel Processing Ups and Downs -- 1.4. Types of Parallelism: A Taxonomy -- 1.5. Roadblocks to Parallel Processing -- 1.6. Effectiveness of Parallel Processing -- Problems -- References and Suggested Reading -- Chapter 2. A Taste of Parallel Algorithms -- 2.1. Some Simple Computations -- 2.2. Some Simple Architectures -- 2.3. Algorithms for a Linear Array -- 2.4. Algorithms for a Binary Tree -- 2.5. Algorithms for a 2D Mesh -- 2.6. Algorithms with Shared Variables -- Problems -- References and Suggested Reading -- Chapter 3. Parallel Algorithm Complexity -- 3.1. Asymptotic Complexity -- 3.2. Algorithm Optimality and Efficiency -- 3.3. Complexity Classes -- 3.4. Parallelizable Tasks and the NC Class -- 3.5. Parallel Programming Paradigms -- 3.6. Solving Recurrences -- Problems -- References and Suggested Reading -- Chapter 4. Models of Parallel Processing -- 4.1. Development of Early Models -- 4.2. SIMD versus MIMD Architectures -- 4.3. Global versus Distributed Memory -- 4.4. The PRAM Shared-Memory Model -- 4.5. Distributed-Memory or Graph Models -- 4.6. Circuit Model and Physical Realizations -- Problems -- References and Suggested Reading -- Part II. Extreme Models -- Chapter 5. PRAM and Basic Algorithms -- 5.1. PRAM Submodels and Assumptions -- 5.2. Data Broadcasting -- 5.3. Semigroup or Fan-In Computation -- 5.4. Parallel Prefix Computation -- 5.5. Ranking the Elements of a Linked List -- 5.6. Matrix Multiplication -- Problems -- References and Suggested Reading -- Chapter 6. More Shared-Memory Algorithms -- 6.1. Sequential Rank-Based Selection -- 6.2. A Parallel Selection Algorithm -- 6.3. A Selection-Based Sorting Algorithm -- 6.4. Alternative Sorting Algorithms -- 6.5. Convex Hull of a 2D Point Set -- 6.6. Some Implementation Aspects -- Problems -- References and Suggested Reading -- Chapter 7. Sorting and Selection Networks -- 7.1. What Is a Sorting Network -- 7.2. Figures of Merit for Sorting Networks -- 7.3. Design of Sorting Networks -- 7.4. Batcher Sorting Networks -- 7.5. Other Classes of Sorting Networks -- 7.6. Selection Networks -- Problems -- References and Suggested Reading -- Chapter 8. Other Circuit-Level Examples -- 8.1. Searching and Dictionary Operations -- 8.2. A Tree-Structured Dictionary Machine -- 8.3. Parallel Prefix Computation -- 8.4. Parallel Prefix Networks -- 8.5. The Discrete Fourier Transform -- 8.6. Parallel Architectures for FFT -- Problems -- References and Suggested Reading -- Part III. Mesh-Based Architectures -- Chapter 9. Sorting on a 2D Mesh or Torus -- 9.1. Mesh-Connected Computers -- 9.2. The Shearsort Algorithm -- 9.3. Variants of Simple Shearsort -- 9.4. Recursive Sorting Algorithms -- 9.5. A Nontrivial Lower Bound -- 9.6. Achieving the Lower Bound -- Problems -- References and Suggested Reading -- Chapter 10. Routing on a 2D Mesh or Torus -- tidti"@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/793911946> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/793911946#Series/plenum_series_in_computer_science> ; # Plenum series in computer science.
    schema:isSimilarTo <http://worldcat.org/entity/work/data/793911946#CreativeWork/introduction_to_parallel_processing> ;
    schema:name "Introduction to parallel processing : algorithms and architectures"@en ;
    schema:productID "228374866" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/228374866#PublicationEvent/new_york_plenum_press_1999> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/793911946#Agent/plenum_press> ; # Plenum Press
    schema:url <http://www.myilibrary.com?id=20512&ref=toc> ;
    schema:url <http://www.springerlink.com/openurl.asp?genre=book&isbn=978-0-306-45970-2> ;
    schema:url <http://proxy.library.carleton.ca/login?url=http://www.springerlink.com/openurl.asp?genre=book&isbn=978-0-306-45970-2> ;
    schema:url <http://www.myilibrary.com?id=20512> ;
    schema:url <https://ebookcentral.proquest.com/lib/ucm/detail.action?docID=196734> ;
    schema:url <http://proxy.library.carleton.ca/login?url=http://www.myilibrary.com?id=20512> ;
    schema:workExample <http://worldcat.org/isbn/9780306469640> ;
    schema:workExample <http://worldcat.org/isbn/9780306459702> ;
    schema:workExample <http://worldcat.org/isbn/9786610205127> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/228374866> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
    schema:name "New York" ;
    .

<http://experiment.worldcat.org/entity/work/data/793911946#Agent/plenum_press> # Plenum Press
    a bgn:Agent ;
    schema:name "Plenum Press" ;
    .

<http://experiment.worldcat.org/entity/work/data/793911946#Series/plenum_series_in_computer_science> # Plenum series in computer science.
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/228374866> ; # Introduction to parallel processing : algorithms and architectures
    schema:name "Plenum series in computer science." ;
    schema:name "Plenum series in computer science" ;
    .

<http://id.worldcat.org/fast/1052928> # Parallel processing (Electronic computers)
    a schema:Intangible ;
    schema:name "Parallel processing (Electronic computers)"@en ;
    .

<http://viaf.org/viaf/55932739> # Behrooz Parhami
    a schema:Person ;
    schema:familyName "Parhami" ;
    schema:givenName "Behrooz" ;
    schema:name "Behrooz Parhami" ;
    .

<http://worldcat.org/entity/work/data/793911946#CreativeWork/introduction_to_parallel_processing>
    a schema:CreativeWork ;
    rdfs:label "Introduction to parallel processing." ;
    schema:description "Print version:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/228374866> ; # Introduction to parallel processing : algorithms and architectures
    .

<http://worldcat.org/isbn/9780306459702>
    a schema:ProductModel ;
    schema:isbn "0306459701" ;
    schema:isbn "9780306459702" ;
    .

<http://worldcat.org/isbn/9780306469640>
    a schema:ProductModel ;
    schema:isbn "0306469642" ;
    schema:isbn "9780306469640" ;
    .

<http://worldcat.org/isbn/9786610205127>
    a schema:ProductModel ;
    schema:isbn "6610205124" ;
    schema:isbn "9786610205127" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.