====== Week 2 ======

~~NOTOC~~

  * 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: Fri, Feb 1, 11:59pm
    * electronically, via submit377
    * no printouts
    * questions? comments?
      * C? Vim?
      * VLAs? vs malloc? \\ \\ 

  * Article discussion: 
    * [[http://queue.acm.org/detail.cfm?id=1095421|Software and the Concurrency Revolution]] (ACM Queue, 3(7), Sep. 2005)
    * written summary due: today
      * just one page, single-sided (don't go crazy)
      * pick a few things that got your attention and are worth discussing  :-) \\ \\ 


  * O(1) parallel max?
    * first: PRAM model: 
      * Parallel random-access machine
      * CRCW, CREW, ERCW, EREW
      * O(1) find max exploits CRCW
    * with thanks to Dr. Charles Hughes, University of Central FL
    * {{ :courses:cs377-201951:findmax-constant-time.pdf |PDF}}
  * Synchronization: Finding the Max of an Array  {{ :courses:cs377-201951:findmax.pdf |PDF}} \\ \\ 

  * Ben-Ari slides: see link in sidebar

===== Homework =====

  * Written HW: Ben-Ari p. 39: 
    * Exercises 2, 3, and 4
    * Due: next Fri, Feb 8