Concurrency and Memory Management Seminar, Winter 2010/2011
Time, Location: Th 10-12 in T04, Techno-Z. First seminar is on Th,
October 7, 2010.
Brief Overview: Why is concurrency so difficult to handle, on the
level of process execution as well as in program development? How can
we utilize emerging multicore hardware more effectively? What are the
tricks to manage complex systems including memory concurrently, in
parallel, and even incrementally? What is the difference anyway? Is
garbage collection the final answer to correct and efficient heap
management? If you are interested in these and other systems-related
questions, sign up for the concurrency and memory management seminar.
The seminar provides a unique opportunity to meet other students and
discuss hot topics in systems research. Pick a research paper (or
problem) provided in class (or propose some other recent paper), read
and understand it, and then share your experience with the group.
Goals of the seminar: Learn how to read, understand, and present top
research papers and their context.
Prerequisites: Background in basic programming language and operating
Requirements: Each student selects a research paper (or problem) and
gives a 45min presentation on the paper (or problem), and uploads the
presentation to the
Seminar language is English.
- Simon Kranzer presents the survey (book chapter): M. Moir and N. Shavit, "Concurrent data structures". In Handbook of Data Structures and Applications, D. Metha and S. Sahni Editors, pages 47-14 - 47-30, 2007. Chapman and Hall/CRC Press. Presentation: PresentationKranzer.pdf
- Martin Aigner presents the paper: Maurice Herlihy, Victor Luchangco, Mark Moir, "Obstruction-Free Synchronization: Double-Ended Queues as an Example," Distributed Computing Systems, International Conference on, p. 522, 23rd IEEE International Conference on Distributed Computing Systems (ICDCS'03), 2003.
- Andreas Unterweger presents the paper: David Gay, Rob Ennals, Eric Brewer, "Safe Manual Memory Management". In Proceedings of the 6th international symposium on Memory management (ISMM '07), pp. 2-14, 2007. Presentation: Unterweger_corr.pdf
- Alexander Baumgartner presents the paper: David Gay, Alex Aiken, "Memory Management with Explicit Regions". PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, pages 313 - 323, 1998. Presentation: ExplicitRegions98_v3.pdf
- Stephanie Stroka presents the paper: Samuel Z. Guyer, Kathryn S. McKinley, and Daniel Frampton, "Free-Me: A Static Analysis for Automatic Individual Object Reclamation". PLDI '06 Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation, Ottawa, Canada, June 10-16, 2006. Presentation: PresentationFreeMe.pdf
- Michael Lippautz presents the paper: Stephen M. Blackburn, Kathryn S. McKinley, "Immix: A Mark-Region Garbage Collector with Space Efficiency, Fast Collection, and Mutator Performance". PLDI '08 Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation, pages 22-32, 2008. Presentation: lippautz_immix.pdf
- Andreas Haas presents the paper: Hakan Sundell, Philippas Tsigas: "Fast and lock-free concurrent priority queues for multi-thread systems". Journal of Parallel and Distributed Computing, issue 65, pp. 609-627, 2005. Presentation: presentation.pdf (presentation.svg)
- Maria Martin Civiac presents the paper: Michael D. Bond. Kathryn S. McKinley: "Tolerating memory leaks".Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications, 2008. Presentation: MemoryLeaks_MariaMartin.pdf
- Hannes Payer presents the paper: D. Hendler, I. Incze, N. Shavit, M. Tzafrir: "Flat Combining and the Synchronization-Parallelism Tradeoff". Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, 2010. Presentation: FlatCombining_HannesPayer.pdf
Technical contact: Ana . Sokolova @ cs . uni-salzburg . at
Administrative contact: Petra . Kirchweger @ cs . uni-salzburg . at