Foundations of parallel programming
Subtitle: a machine-independent approach
By: Ted G. Lewis.
Publisher: IEEE Computer Society Press
Published: 1993
Place of publication: Los Alamitos, Calif
Language: eng
Number of pages: 282
Subjects: Parallel programming (Computer science)
Notes: Includes bibliographical references and index.
Table of contents: title: Preface
pagenum: vii; label: 1
title: Models and Measures of Parallelism
pagenum: 1; label: 1.1
title: Processors, Memories, and Networks
pagenum: 2; label: 1.2
title: Parallel Programming Paradigms
pagenum: 7; label: 1.3
title: Performance Models
pagenum: 12; label: 1.3.1
title: Estimating Execution Times
pagenum: 15; label: 1.3.2
title: The Gantt Chart Model
pagenum: 18; label: 1.4
title: Keywords and Concepts
pagenum: 20; label: 2
title: Principles of Concurrency
pagenum: 26; label: 2.1
title: Processes
pagenum: 27; label: 2.2
title: Properties of Flow-Correct Processes
pagenum: 31; label: 2.3
title: Timing Diagrams
pagenum: 33; label: 2.4
title: Interleave Matrix Analysis
pagenum: 35; label: 2.5
title: Bounded Buffers
pagenum: 41; label: 2.6
title: Path Expressions
pagenum: 43; label: 2.7
title: Keywords and Concepts
pagenum: 49; label: 3
title: Axioms of Flow-Correctness
pagenum: 53; label: 3.1
title: Flow-Correctness in Parallel Constructs
pagenum: 54; label: 3.2
title: Axioms of Data Dependency
pagenum: 57; label: 3.2.1
title: The Flow-Correctness Checking Strategy
pagenum: 57; label: 3.2.2
title: The Axioms of Flow-Correctness
pagenum: 58; label: 3.3
title: Iteration Space
pagenum: 61; label: 3.4
title: Keywords and Concepts
pagenum: 64; label: 4
title: Performance Analysis
pagenum: 68; label: 4.1
title: Sequential Program Graphs
pagenum: 69; label: 4.2
title: Parallel Program Graphs
pagenum: 74; label: 4.3
title: Communication Patterns in Parallel Programs
pagenum: 78; label: 4.3.1
title: Ring Pattern
pagenum: 79; label: 4.3.2
title: Binary Tree Pattern
pagenum: 81; label: 4.3.3
title: M-ary Tree Patterns
pagenum: 83; label: 4.4
title: Keywords and Concepts
pagenum: 85; label: 5
title: The Data Parallel Fan
pagenum: 90; label: 5.1
title: The Fan
pagenum: 91; label: 5.2
title: Performance Analysis
pagenum: 93; label: 5.3
title: Flow-Correctness Analysis
pagenum: 95; label: 5.4
title: Applications of Fan
pagenum: 98; label: 5.4.1
title: Matrix Calculations
pagenum: 99; label: 5.4.2
title: Gaussian Elimination
pagenum: 100; label: 5.4.3
title: Applications with Early Termination
pagenum: 106; label: 5.4.4
title: Applications of the Constrained Fan
pagenum: 109; label: 5.4.5
title: Parallel Sorting
pagenum: 112; label: 5.5
title: Keywords and Concepts
pagenum: 120; label: 6
title: The Reduction Tree
pagenum: 123; label: 6.1
title: Divide-and-Conquer Parallelism
pagenum: 124; label: 6.1.1
title: Flow-Correctness of Trees
pagenum: 128; label: 6.1.2
title: Mapping an Array of Processes onto a Tree
pagenum: 131; label: 6.1.3
title: Performance of Trees
pagenum: 132; label: 6.2
title: Applications of Trees
pagenum: 133; label: 6.2.1
title: Fundamental Algorithms
pagenum: 133; label: 6.2.2
title: Parallel Statistics
pagenum: 136; label: 6.2.3
title: String Searching with a Tree
pagenum: 138; label: 6.3
title: Keywords and Concepts
pagenum: 140; label: 7
title: The Independent-Loop Par
pagenum: 143; label: 7.1
title: The Par
pagenum: 144; label: 7.1.1
title: MIMD Par
pagenum: 146; label: 7.1.2
title: The Conditional Par
pagenum: 146; label: 7.1.3
title: The Counting Par
pagenum: 147; label: 7.2
title: Performance Analysis
pagenum: 151; label: 7.3
title: Heuristic Scheduling
pagenum: 152; label: 7.4
title: Flow-Correctness Analysis
pagenum: 154; label: 7.5
title: Conditions for Flow-Correctness
pagenum: 158; label: 7.6
title: Applications of Par
pagenum: 158; label: 7.6.1
title: Spectral Analysis
pagenum: 159; label: 7.6.2
title: A Faster Solution to \(Ax = b\)
pagenum: 162; label: 7.6.3
title: Another Way to Sort
pagenum: 164; label: 7.7
title: Keywords and Concepts
pagenum: 167; label: 8
title: The Dependent-Loop Pipe
pagenum: 171; label: 8.1
title: Pipe Parallelism
pagenum: 172; label: 8.2
title: Three Kinds of Pipes
pagenum: 175; label: 8.2.1
title: Conditional Pipe
pagenum: 178; label: 8.2.2
title: Counting Pipe
pagenum: 181; label: 8.3
title: Flow Correctness of Pipe
pagenum: 186; label: 8.4
title: Classification of Loops
pagenum: 187; label: 8.5
title: Performance of Pipe
pagenum: 188; label: 8.6
title: Applications of Pipe
pagenum: 192; label: 8.6.1
title: Solution to Vandermonde Linear System
pagenum: 192; label: 8.6.2
title: Merging Two Lists
pagenum: 195; label: 8.6.3
title: Finding Perfect Hashing Functions
pagenum: 198; label: 8.7
title: Keywords and Concepts
pagenum: 201; label: 9
title: The Client-Server Model
pagenum: 205; label: 9.1
title: Clients and Servers
pagenum: 206; label: 9.2
title: Classes, Objects, and Servers
pagenum: 209; label: 9.3
title: Syntactic Structure of Objects
pagenum: 210; label: 9.4
title: Synchronization of Objects
pagenum: 214; label: 9.5
title: Bounded Buffer Problem Revisited
pagenum: 216; label: 9.6
title: Matrix Algebra Revisited
pagenum: 222; label: 9.7
title: Keywords and Concepts
pagenum: 224; label: 10
title: Software-Implemented Fault-Tolerance
pagenum: 227; label: 10.1
title: Software Implemented Fault-Tolerance
pagenum: 228; label: 10.2
title: Voting
pagenum: 229; label: 10.2.1
title: Redundant I/O
pagenum: 232; label: 10.2.2
title: Alternative Algorithms
pagenum: 233; label: 10.2.3
title: Stochastic Algorithms
pagenum: 234; label: 10.3
title: Backup/Restore
pagenum: 235; label: 10.4
title: The Backup Construct
pagenum: 235; label: 10.5
title: The Domino Effect
pagenum: 237; label: 10.5.1
title: Rollback Propagation
pagenum: 237; label: 10.5.2
title: Implementing Recovery
pagenum: 240; label: 10.6
title: Keywords and Concepts
pagenum: 242; label: 11
title: Programming in the Large
pagenum: 245; label: 11.1
title: The Basic Building Blocks
pagenum: 246; label: 11.1.1
title: Fan, Par, Pipe, Tree
pagenum: 248; label: 11.1.2
title: Client-Server Notation
pagenum: 250; label: 11.1.3
title: Fault Tolerance
pagenum: 252; label: 11.2
title: Complete Programs
pagenum: 252; label: 11.2.1
title: Bitonic Sort
pagenum: 254; label: 11.2.2
title: Client-Server Back Substitution
pagenum: 260; label: 11.3
title: Performance Visualization
pagenum: 260; label: 11.4
title: Keywords and Concepts
pagenum: 263; label: Appendix
title: Summary of Flow-Control Axioms
pagenum: 266; title: Summary of Performance Model Parameters
pagenum: 267; title: Summary of Parallel Programming Constructs
pagenum: 268; title: Client-Server Model and Method Call
pagenum: 273; title: Fault Tolerance
pagenum: 275; title: Index
pagenum: 277