====== Week 1 ======

~~NOTOC~~

  * Introductions
  * Course overview (syllabus)

===== Lecture Notes =====

  * Lecture notes: {{ cs377-lect01.pdf |PDF}}
    * A familiar problem: findMax
  * Challenge: O(1) parallel max?
    * it can be done! 
    * with the right assumptions, processors, and disregard for efficiency! :-) 
/***
    * {{findmax-constant-time.pdf}}
***/
  * Timely CACM Point/Counterpoint article: [[https://cacm.acm.org/magazines/2022/9/263793-on-the-model-of-computation-counterpoint/fulltext|On the Model of Computation: Counterpoint: Parallel Programming Wall and Multicore Software Spiral: Denial Hence Crisis]]

===== Assignments =====

  * First programming assignment: {{assign-1.pdf|PDF}}
    * implement 3 versions of findMax in C
    * use the Vim editor to type in your program (see sidebar for Vim resources)
    * be sure to consult and follow the General Programming Assignment Guide {{ cs377-prog-assign-guide.pdf |PDF}}
    * due: next Thu, Jan 29 

  * Read for next class: 
    * [[http://queue.acm.org/detail.cfm?id=1095421|Software and the Concurrency Revolution]] (ACM Queue, 3(7), Sep. 2005)
    * written summary due next class: Mon
      * just one page, single-sided (don't go crazy)
      * pick a few things that got your attention and are worth discussing  :-)
    * we will discuss this article in class

  * Ben-Ari Text:
    * Chapters 1 and 2 for next week