All students should provide one short paragraph identifying exactly one strength or one weakness of the approach described in the week's reading.
+ +<%= Disqus::embed( + "https://odin.cse.buffalo.edu/teaching/cse-662/2017fa/feedback/06-scansharing.html", + "cse662.2017fa.feedback.06" +) %> \ No newline at end of file diff --git a/src/teaching/cse-662/2017fa/index.md b/src/teaching/cse-662/2017fa/index.md index 042652dc..fad587d6 100644 --- a/src/teaching/cse-662/2017fa/index.md +++ b/src/teaching/cse-662/2017fa/index.md @@ -103,9 +103,9 @@ After the taking the course, students should be able to: * **Oct. 23** : Legorithmics [ [paper](http://infoscience.epfl.ch/record/186017/files/main-final.pdf) ] * **Oct. 25 - Oct. 27** : Checkpoint 2 Reviews * **Oct. 30 - Nov. 3** : *Luke Ziarek: Software-Transactional Memory* [ [paper](http://dl.acm.org.gate.lib.buffalo.edu/citation.cfm?id=1133985) | [feedback](feedback/05-softwaretransactionalmem.html) ] -* **Nov. 06** : Streaming [ [paper](http://www.cs.cornell.edu/johannes/papers/2007/2007-CIDR-Cayuga.pdf) ] +* **Nov. 06** : Streaming [ [paper](http://www.cs.cornell.edu/johannes/papers/2007/2007-CIDR-Cayuga.pdf) | [Notes](slides/2017-11-05-Cayuga.pdf) ] * **Nov. 08 - Nov. 10** : Student Project Presentations -* **Nov. 13** : Scan Sharing [ [paper](http://dl.acm.org.gate.lib.buffalo.edu/citation.cfm?id=1807326) ] +* **Nov. 13** : Scan Sharing [ [paper](http://dl.acm.org.gate.lib.buffalo.edu/citation.cfm?id=1807326) | [feedback](feedback/06-scansharing.html) ] * **Nov. 15 - Nov. 17** : Student Project Presentations * **Nov. 20** : Declarative Games [ [paper](https://infoscience.epfl.ch/record/166858/files/31-sigmod2007_games.pdf) ] * **Nov. 22 - Nov. 24** : **Fall Break**