Tomas Plachetka

Concurrent and Distributed Programming and Systems 2, 2020/2021

Thursday 11:30-14:00 online

The evaluation of work during the semester (homeworks) forms 50% of the final grade, at least 40% are required.

Lectures

• OCCAM
  • Slides
  • G. Jones, M.Goldsmith: Programming in OCCAM 2
  • Inmos OCCAM libraries
  • KROC/OccamPI
• Unix process creation, communication and synchronisation
  • fork(), exit(). Memory mapping, mmap(), munmap.
  • Shared memory, shm*(). Semaphores (named, system-wide).
  • Pipes, named pipes (FIFO).
  • Message queues (IPC).
  • Signals.
  • Network communication (TCP/IP sockets). External data representation (XDR).
• Socket communication
• HPC, High-Performance Computing
  • Top 500 HPC clusters
  • Beowulf clusters (low-cost parallel computing)
• Channel and point-to-point communication
  • Channel communication, a general framework for point-to-point communication (SOFSEM 2006). Slides.
• PVM, Parallel Virtual Machine
  • PVM home (ORNL)
  • PVM book
• MPI, Message Passing Interface
  • MPI Forum
  • MPI 3.1 specification
  • MPI 2.2 specification
  • MPI 1.3 specification
  • MPICH
• Thread-safety in PVM and MPI

Homeworks

• Homework 1: smokers, 1D Life in OCCAM.
• Homework 2: smokers, 1D Life (see HW1) in Unix, using fork() and an inter-process communication mechanism.
• Homework 3: implement 1D Life in C/PVM.
• Homework 4: implement 1D Life in C/MPI.