Skip navigation
The Australian National University

COMP4300/6430: Lecture Notes

Date Lecture Notes
28: Tue May 21 Tour of NCI (more to follow)
28: Thu May 16 Quick Tour of OpenMP (1up)
26-27: Tue May 14 Map Reduce (1 up) Guest lecture by Jay Larson
25: Thu May 9 Complete High Productivity Languages
23-24: Tue May 7 Complete memory consistency discussion

High Productivity Languages
22: Thu May 2 We returned the mid-semester exam and discussed it.
20-21: Tue Apr 30 Xeon Phi and the Art of Accelerator Optimisation, guest lecture by James Barker (CSIRO Advanced Scientific Computing)
Thu Apr 25 ANZAC Day Holiday
Tue Apr 23 Mid-semester Exam!
19: Thu Apr 18 Mid-semester exam review lecture - no notes
17-18: Tue Apr 16 Threads and Tasks (1up)
16: Thu Mar 28 Memory Consistency Models (1up)
Memory consistency will take some time for you to fully appreciate, but it is fundamental to concurrent and distributed computing. It should also make you reconsider some of the initial material presented in COMP2310!
14-15: Tue Mar 26 Shared Memory; Programming (1up)
Note, Lab work related to this material will not begin until after the mid-semester break.
See: Chapter 6 of Lin and Synder, Chapter 8 of Wilkinson and Allen, Chapter 7 of Grama, Gupta, Karypis and Kumar
13: Thu Mar 21 Shared Memory Hardware, Complete and discuss links below.
See Chapter 2 of Lin and Synder and Chapter 2 of Grama, Gupta, Karypis and Kumar.
11-12: Tue Mar 19 Synchronous Computations/Barriers (1up)
See Chapter 6 Wilkinson and Allen.

Shared Memory; Hardware (1up)
See Chapter 2 of Lin and Synder and Chapter 2 of Grama, Gupta, Karypis and Kumar.
10: Thu Mar 14 Assignment 1 Discussion Have a look at this paper: Assignment1 Lecture, SUMMA Matrix Multiple Paper. Assignment 1 will be based around this and will be discussed in this lecture. You can download the final paper from the Wiley site if you are located on ANU campus network.
8-9: Tue Mar 12 Domain Decomposition (continued) (1up)
"PRAM" C code for scan operation and example output
See Chapter 4 Wilkinson and Allen; Chapter 3 of Grama, Gupta, Karypis and Kumar; Chapter 4 and 5 of Lin and Snyder.

Pipeline Decomposition (1up)
See Chapter 5 Wilkinson and Allen.
7: Thu Mar 7 Domain Decomposition (1up)
See Chapter 4 Wilkinson and Allen; Chapter 3 of Grama, Gupta, Karypis and Kumar; Chapter 4 and 5 of Lin and Snyder.
5-6: Tue Mar 5 Performance Models (1up)
Measuring and modeling performance. Mr Amdahl and more! See Chapter 3 of Lin and Synder and Chapter 5 of Grama, Gupta, Karypis and Kumar.

Embarassingly Parallel Problems (1up)
See Chapter 3 Wilkinson and Allen; Chapter 3 of Grama, Gupta, Karypis and Kumar; Chapter 4 and 5 of Lin and Snyder.
MPI visualization tools:
4: Thu Feb 28 Basic Message Passing (1up)
A quick introduction to MPI, there will be more in lab 1. See also Chapter 7 from the text "Principles of Parallel Programming" (copy of figures). Some references:
2-3: Tue Feb 26 Overview of Parallel Hardware (1up)
A quick review of single CPU hardware followed by an overview of parallel hardware issues. Material presented here will be picked up on in later lectures. For a very detailed discussion about single processor performance see the reference book by Bryant and O'Hallaron. Chapters 2 and 3 from Lin and Snyder contains an overview of single and multiple processor architectures similar to that outlined here. See also the lecture notes from Calvin Lin: "A success Story: ISA": more details of how parallelism is a key part of the instruction set architecture (ISA) of all modern chips Parallel Architectures

Basic Communications(1up)
This material lays the ground work for message passing and should make you appreciate the complexities of writing a good message passing library for a given platform. See parts of Chapter 2 and 4 in the book by Grama et al for more info.

1: Thu Feb 21 Unit Introduction 2up (5MB) (ppt version (8MB))

Updated:  16 May 2013 / Responsible Officer:   JavaScript must be enabled to display this email address. / Page Contact:   JavaScript must be enabled to display this email address.