Go to Dana Petcu's homepage

PARALLEL COMPUTING (in Romanian):

Schedule:

  1. Lecture 1: Notions and motivation.
  2. Lecture 2: Hardware organization and classification.
  3. Lecture 3: Performance measurements.
  4. Lecture 4: Paradigms.
  5. Lecture 5: Theoretical models. Shared memory access.
  6. Lecture 6: Shared memory.
  7. Lecture 7: Inter-connection networks.
  8. Lecture 8: Routing.
  9. Lecture 9: Message passing.
  10. Lecture 10: Building parallel algorithms (I).
  11. Lecture 11: Building parallel algorithms (II).
  12. Lecture 12: Associative operations and sorting.
  13. Lecture 13: Operations with integers, lists, trees and graphs.
  14. Lecture 14: Linear algebra.

Previous lectures are concerning with:
  1. parallel computer architecture
  2. parallel computing in numerical analysis

For Post-Universitary Students:
  1. short and last presentation is available also in a compressed form
  2. previous presentations are available here
  3. short introduction in Java

Labs: C, C++ with PVM and MPI.

PVM is shortly presented here.