[Picture: emblem]

Parallel Algorithms

Parallel Algorithms is activity of the PARALLEL TEMPUS project.

Available kind of materials:

Overview

  1. [Document(tar.gz)] [Transparencies(tar.gz)] Parallel Processing Fundamentals by István Erényi
    Document (part 1, 6 pages ps.gz 60k, part 2, 19 pages ps.gz 384k, part 3, 21 pages ps.gz 409k, part 4, 12 pages ps.gz 264k, part 5, 8 pages ps.gz 99k, cover doc 19k)
    Transparencies (part 1, 27 slides ps.gz 242k, part 2, 8 slides ps.gz 20k, part 3, 13 slides ps.gz 61k, part 4, 35 slides ps.gz 303k, part 5, 45 slides ps.gz 323k)
    1. Basic Techniques
    2. Parallel Computer Models
    3. Basic Communication Operations
    4. Performance and Scalability
  2. [Document(ps.gz)] [Transparencies(ps.gz)] Numerical Algorithms, System of Linear Equations by István Vassányi
    Document (27 pages Gzipped Postscript 262k)
    Transparencies (18 slides Gzipped Postscript 126k)
    Abstract (HTML)
    1. Dense Matrix Algorithms
    2. Partitioning of Matrice
    3. Matrix Transposition
    4. Matrix Vector Multiplication
    5. Matrix Multiplication
    6. Solving Systems of Linear Equations
    7. Operational Considerations
    8. Iterative Methods
    9. Finite Element Method
    10. Direct Methods
    11. Multigrid Methods
  3. [Document(ps.gz)] [Transparencies(ps.gz)] Data-Parallel Fine-Grain Algorithms by István Rényi
    Document (29 pages Gzipped Postscript 247k, Zipp Winword 160k)
    Transparencies (53 slides Gzipped Postscript 116k, Powerpoint 274k)
    1. Arrays and Fine Grain Algorithms
    2. Locally Recursive and Globally Recursive Algorithms
    3. Mapping Algorithms onto Array Structures
    4. Graph-Based Design Metodology
    5. Optimization Problem
    6. Application Examples
  4. Geometric Algorithms by Z. Fazekas
    1. Concex-Hull Problem
    2. Intersection of Convex Sets
    3. Plane Sweeping
    4. Parallel Prefix Algorithm
    5. Visibility Problems
    6. Dominance Counting
  5. [Document(ps.gz)] [Transparencies(ps.gz)] Sorting Algorithms by Tibor Fadgyas
    Document (7 pages Gzipped Postscript 26k)
    Transparencies (15 slides Gzipped Postscript 44k)
    1. Generals
    2. Sorting Networks
    3. Bitonic Sort
    4. Bitonic Sort on Hypercube
    5. Bitonic Sort on Mesh
    6. Bubble Sort and its Variants
    7. Quicksort
  6. [Document(ps.gz)] [Transparencies(ps.gz)] Graph Algorithms by Tibor Fadgyas
    Document (13 pages Gzipped Postscript 32k, LaTeX 49k)
    Transparencies (17 slides Gzipped Postscript 48k)
    1. Graph Definitions, Representations
    2. Basic Graph Problems
    3. Matrix Techniques
    4. Connected Components
    5. Transitive Closure of a Graph
    6. Single Source Shortest Path
    7. All Pairs Shortest Path
    8. Matrix Algorithm
    9. Floyd Algorithm
    10. Hard Problems
  7. [Document(ps.gz)] [Transparencies(ps.gz)] Discrete Optimization Problems by Tibor Fadgyas
    Document (16 pages Gzipped Postscript 46k, LaTeX 35k)
    Transparencies (16 slides Gzipped Postscript 46k, LaTeX 35k)
    1. Basic techniques
    2. Parallel Depth-First Search (DFS)
    3. Parallel Best-First Search
    4. Speedup Anomalies in Parallel Search Algorithms
  8. [Document(ps.gz)] [Transparencies(ps.gz)] Dynamic Programming by Tibor Fadgyas
    Document (22 pages Gzipped Postscript 58k)
    Transparencies (46 slides Gzipped Postscript 68k, LaTeX 32k)
    1. Serial Monadic DP Formulations
    2. Nonserial Monadic DP Formulations
    3. Serial Polyadic DP Formulations
    4. Nonserial Polyadic DP Formulations
[DoA] [TEMPUS] [MODIFY] [PARALLEL] [DOWNLOAD] [UPLOAD] [SEARCH] [FEEDBACK]