Week 2

  • Readings for this week and next (from text):
    • Ben-Ari Ch 1: What is Concurrent Programming?
    • Ben-Ari Ch 2: The Concurrent Programming Abstraction

Discussion and Lecture Notes

  • Assignment 1
    • Due: Thu, Jan 29, 11:59pm
    • electronically, via submit377
    • no printouts
    • you are permitted (even encouraged) to work in pairs
    • questions? comments?
      • C? Vim?
      • dynamic allocation
        • VLAs (Variable Length Arrays)? vs
        • malloc and calloc?

  • Last time claimed: O(1) parallel max is possible! How?
    • PDF
    • PRAM, assumed CRCW, and $n^2$ processors
    • analysis: very fast—and very inefficient!
  • This time:
    • Synchronization: Finding the Max of an Array PDF

  • Ben-Ari slides: see link in sidebar

Homework

  • Written HW: (not Programming Assignment 2)
    • Ben-Ari p. 39:
    • Exercises 2, 3, and 4
    • Due: Thu, Feb 5