Please make sure that your presentation meets the requirements as discussed in the first meeting. In particular, your presentation must not exceed the time limit of 20 minutes and not fall below 15 minutes. Also, do not forget to rehearse your talk sufficiently.
A summary of the key points of a good presentations were discussed in the first meeting. Please go through those slides before preparing your presentation. As a general advice, try to convey the basic idea of the paper your read and present this idea such that your colleagues can easily follow. This may require you to include tutorial material.
1. [Herlihy93] Maurice Herlihy, J. Eliot B. Moss: Transactional memory: architectural support for lock-free data structures Proceedings of the 20th annual international symposium on Computer architecture San Diego, California, United States Pages: 289 - 300 Year of Publication: 1993
2. [Shavit95] Nir Shavit, Dan Touitou, Software transactional memory Annual ACM Symposium on Principles of Distributed Computing Pages: 204 - 213 Year of Publication: 1995
3. [Herlihy06] Maurice Herlihy, Victor Luchangco, Mark Moir A flexible framework for implementing software transactional memory Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications, Portland, Oregon, USA Pages: 253 - 262 Year of Publication: 2006
4. [ Armstrong96 ] Armstrong, J." Erlang - A survey of the language and its industrial applications In INAP'96. The 9'th Exhibitions and Symposium on Industrial Applications of Prolog. 16-18, October 1996. Hino, Tokyo Japan.
5. [ Chamberlain00 ] Bradford L. Chamberlain, Sung-Eun Choi, E. Christopher Lewis, Calvin Lin, Lawrence Snyder, Derrick Weathersby: ZPL: A Machine Independent Programming Language for Parallel Computers. IEEE Trans. Software Eng. (TSE) 26(3):197-211 (2000)
6. [ Benton04 ] Nick Benton, Luca Cardelli, Cidric Fournet: Modern concurrency abstractions for C#. ACM Trans. Program. Lang. Syst. 26(5): 769-804 (2004)
7. [ Harris03] Tim Harris, Keir Fraser: Language support for lightweight transactions. OOPSLA 2003: 388-402
8. [ Martin06 ] Milo M. K. Martin, Colin Blundell, E. Lewis: Subtleties of Transactional Memory Atomicity Semantics. Computer Architecture Letters 5(2): (2006)
9. [Bacon00] David F. Bacon, Robert E. Strom, Ashis Tarafdar: Guava: a dialect of Java without data races. OOPSLA 2000: 382-400
10. [Manson05] Jeremy Manson, William Pugh, Sarita V. Adve: The Java memory model. POPL 2005: 378-391
11. [Rajwar05] Ravi Rajwar, Maurice Herlihy, Konrad K. Lai: Virtualizing Transactional Memory. ISCA 2005: 494-505
12. [Saha06] Bratin Saha, Ali-Reza Adl-Tabatabai, Richard L. Hudson, Chi Cao Minh, Ben Hertzberg: McRT-STM: a high performance software transactional memory system for a multi-core runtime. PPOPP 2006: 187-197
13. [Grossman06] Dan Grossman, Jeremy Manson, William Pugh: What do high-level memory models mean for transactions? Memory System Performance and Correctness 2006: 62-69
14. [ Ni07] Yang Ni, Vijay Menon, Ali-Reza Adl-Tabatabai, Antony L. Hosking, Richard L. Hudson, J. Eliot B. Moss, Bratin Saha, Tatiana Shpeisman: Open nesting in software transactional memory. PPOPP 2007: 68-78
15. [Wang07] Cheng Wang, Wei-Yu Chen, Youfeng Wu, Bratin Saha, Ali-Reza Adl-Tabatabai: Code Generation and Optimization for Transactional Memory Constructs in an Unmanaged Language. CGO 2007: 34-48
16. [Ziarek08] Lukasz Ziarek, Adam Welc, Ali-Reza Adl-Tabatabai, Vijay Menon, Tatiana Shpeisman, Suresh Jagannathan: A Uniform Transactional Execution Environment for Java. ECOOP 2008: 129-154
17. [Charles05] Philippe Charles, Christian Grothoff, Vijay A. Saraswat, Christopher Donawa, Allan Kielstra, Kemal Ebcioglu, Christoph von Praun, Vivek Sarkar: X10: an object-oriented approach to non-uniform cluster computing. OOPSLA 2005: 519-538
18. [Gummaraju08] Jayanth Gummaraju, Joel Coburn, Yoshio Turner, Mendel Rosenblum: Streamware: programming general-purpose multicore processors using streams. 297-307
19. [Linderman08] Michael D. Linderman, Jamison D. Collins, Hong Wang, Teresa H. Meng: Merge: a programming model for heterogeneous multi-core systems. 287-296
20. [Cherem07] Sigmund Cherem, Radu Rugina: A Practical Escape and Effect Analysis for Building Lightweight Method Summaries. CC 2007: 172-186
21. [Kulkarni07] Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, L. Paul Chew: Optimistic parallelism requires abstractions. PLDI 2007: 211-222
22. [ Welc04 ] Adam Welc, Suresh Jagannathan, Antony L. Hosking: Transactional Monitors for Concurrent Objects. ECOOP 2004: 519-542
23. [ Halstead85 ] Robert H. Halstead Jr.: Multilisp: A Language for Concurrent Symbolic Computation. ACM Trans. Program. Lang. Syst. 7(4): 501-538 (1985)
24. [ Welc05 ] Adam Welc, Suresh Jagannathan, Antony L. Hosking: Safe futures for Java. OOPSLA 2005: 439-453
25. [ Navabi08 ] Armand Navabi, Xiangyu Zhang, Suresh Jagannathan: Quasi-static scheduling for safe futures. PPOPP 2008: 23-32
26. [ Ryoo08 ] Shane Ryoo, Christopher I. Rodrigues, Sara S. Baghsorkhi, Sam S. Stone, David B. Kirk, Wen-mei W. Hwu: Optimization principles and application performance evaluation of a multithreaded GPU using CUDA. 73-82
| Student | Topic | Paper | Date of Presentation | Assistant |
|---|---|---|---|---|
| N.N. | 1 | Herlihy93 | Oct 20 | Mathias Payer |
| P. Huber | 2 | Shavit95 | Oct 20 | Zoltan Majo / Mathias Payer |
| S. Wuestholz | 3 | Herlihy06 | Oct 20 | Albert Noll / Zoltan Majo |
| M. Luder | 4 | Armstrong96 | Oct 27 | Oliver Trachsel |
| Th. Weibel | 5 | Chamberlain00 | Oct 27 | Albert Noll |
| L. Hansen | 6 | Benton04 | Oct 27 | Thomas Gross |
| M. Volery | 7 | Harris03 | Nov 3 | Michael Pradel / Mathias Payer |
| L. Silva | 9 | Bacon00 | Nov 3 | Michael Pradel |
| I. Seidl | 10 | Manson05 | Nov 3 | Albert Noll |
| M. Kolly | 11 | Rajwar05 | Nov 10 | Mathias Payer |
| J. Schoch | 12 | Saha06 | Nov 10 | Mathias Payer |
| S. Bhardwaj | 14 | Ni07 | Nov 10 | Mathias Payer |
| M. Schmid | 13 | Grossman06 | Nov 17 | Zoltan Majo |
| S. Geiger | 15 | Wang07 | Nov 17 | Zoltan Majo / Mathias Payer |
| M. Staempfli | 16 | Ziarek08 | Nov 17 | Mathias Payer |
| T. Heinzen | 17 | Charles05 | Nov 24 | Albert Noll |
| D. Muellhaupt | 18 | Gummaraju08 | Nov 24 | Thomas Gross |
| S. Manco | 19 | Linderman08 | Nov 24 | Albert Noll |
| D. Furrer | 20 | Cherem07 | Dec 1 | Thomas Gross |
| P. Wolfensperger | 21 | Kulkarni07 | Dec 1 | Thomas Gross |
| C. Oberholzer | 22 | Welc04 | Dec 1 | Stephanie Balzer |
| J. Welti | 23 | Halstead85 | Dec 8 | Stephanie Balzer |
| N. Kazmin | 24 | Welc05 | Dec 8 | Oliver Trachsel |
| R. Buffat | 25 | Navabi08 | Dec 8 | Oliver Trachsel |
| C. Geiger | 26 | Ryoo08 | Dec 15 | Thomas Gross |
Here are more detailed tasks:
1 week before your talk you must show your slides to the instructor or an assistant.
1 week before the talk you must show three questions to the instructor or an assistant. These questions will be answered by the other students in the seminar to demonstrate that they read the paper. The questions should check that the other students read the paper - not that they memorized all details, or memorized all steps of a proof, etc.
The slides and/or questions may have to be modified based on feedback by the instructor or an assistant.
All students (except the speaker) must answer a brief quiz at the start of each meeting. The topic of the quiz is the contents of the paper to be presented. The quiz attempts to check that everyone has read the paper; the quiz is prepared by the presenter.
Your grade is determined by: your understanding of the paper (10), your presentation (10), the questions you prepare for the rest of the seminar (10), your handling of questions/discussion after your presentation (10), and your participation in disucssions (10).
You must turn in (electronically) a copy of the slides no later than 1 week after the talk. We accept slides in PowerPoint and PDF format.