DD2451, Parallel and Distributed Computing, Pardis, 2011

Instructions

Each presentation has 15 minutes available in total. This includes 3 minutes for questions and discussion. So you should prepare fpr 12 minutes with little margin either way. Do a dry run with some friends.

For a good presentation think about what we listeners would like/need to know: Why should we care? What has been done? How does this relate to what was known before? What is new and interesting? What is the main contribution? Is there a key idea or novelty that deserves to be brought out? It may be a good idea to not try to cover everything in the paper in detail, and instead focus attention on some specific aspect. Think about the audience.

Presentation Schedule

The below schedule is final except for the last session.

Friday Nov 18, 10-12, V33:

1. Jacob Nordgren: "Efficient system-enforced deterministic parallelism", Aviram, Weng, Hu, Ford, OSDI'10
2. Erik Övelius: A. Al-Shishtawy, T. Jamal Khan, and V. Vlassov, Robust, fault-tolerant majority based key-value store supporting multiple consistency levels", to appear, 17-th IEEE Int Conf on Parallel and Distributed Systems (IEEE ICPADS 2011), Dec 2011.
3. Christoffer Hirsimaa A universal construction for wait-free transaction friendly data structures, Chuong, Phong and Ellen, Faith and Ramachandran, Vijaya, Proc SPAA'10
4. Attilio Picoco, Amdahl's Law in Multicore Era, Mark D. Hill, University of Wisconsin-Madison Michael R. Marty, Google, IEEE Computer vol 41 issue 7, pp 33-38, 2008
5. Agnes Skattman Udd: Biagio Cosenza, Gennaro Cordasco, Rosario De Chiara and Vittorio Scarano: Distributed Load Balancing for Parallel Agent-based Simulations, PDP2011 - 19th Euromicro International Conference on Parallel, Distributed and Network-Based Computing
6. Erik Helin, Sharing memory robustly in message-passing systems av Hagit Attya, Amotz Bar-Noy och Danny Dolev, JACM Volume 42 Issue 1, Jan. 1995
7. Paul Adenot: Hopscotch Hashing, by Herlihy, Maurice and Shavit, Nir and Tzafrir, Moran, DISC '08

Wednesday 23 Nov, 15-17, V23:

1. Tobias Eriksson Efficient and Scalable Multiprocessor Fair Scheduling
   Using Distributed Weighted Round-Robin (Li, Baumberger, Hahn),
   PPOPP'09
2. Adam Renberg: J. Halpern, Y. Moses: Knowledge and common knowledge in a distributed
   environment, Journal of the ACM (JACM) Volume 37 Issue 3, July 1990
3. Peter Boström Yehuda Afek, Adam Morrison and Guy Wertheim.
   From Bounded to Unbounded Concurrency Objects and Back, PODC 2011
   
4. Alexander Samuelsson:
   A Dynamic Elimination-Combining Stack Algorithm, by Gal Bar-Nissan, Danny Hendler, and Adi Suissa. CORR abs-1106-630
5. Miguel Pais: DeCandia et al, Dynamo: Amazon's Highly Available Key-value Store, SOSP'07
6. Gustav Hedin: Zyulkyarov et al, Atomic Quake: Using Transactional Memory in an Interactive Multiplayer Game Server, PPoPP 2009
7. Björn Hegerfors: Skiplist-Based Concurrent Priority Queues by Itay Lotan and Nir Shavit, IPDPS'00

Thursday 1 Dec, 10-12, D34:

1. Corentin Valleroy: Lee, S., Jeon, M., Kim, D. and Sohn, A. Partition Parallel Radix Sort. Journal of Parallel and Distributed Computing. Pages: 656 - 668, 2002
2. Emma Lindqvist: M. Goldmann, G. Kreitz, Measurements on the Spotify Peer-Assisted Music-on-Demand Streaming System, Proc P2P'11
3. Linus Wallgren: Shlomi Dolev, Amos Israeli and Shlomo Moran, Self-stabilization of dynamic systems assuming only read/write atomicity,D istributed Computing
   Volume 7, Number 1, 3-16, 1993
4. Yogesh Garg: Vibhor Bhatt Chien-Chung Huang, Group Mutual Exclusion in O(log n) RMR, in Proc PODC'10
5. Tobias Widén: Roger Dingledine, Nick Mathewson, Paul Syverson, Tor: the second-generation onion router, in SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium
6. Joel Petterson: Grace: safe multithreaded programming for C/C++ av Emery D. Berger, Ting Yang, Tongping Liu & Gene Novark, OOPSLA'09
7. Guillermo Rodrígues Cano: W. Golab, Xiaozhou Li, Mehul A. Shah, Analyzing Consistency Properties for Fun and Profit, PODC'11

Tuesday 6 Dec, 10-12, Q31

1. Mathilde Guinoiseau: Dan Dobre, Rachid Guerraoui, Matthias Majuntke,Neeraj Suri and Marko Vukolic, The Complexity of Robust Atomic Storage, PODC'11
2. Amaru Cuba Gyllensten: The round complexity of distributed sorting, av Boaz Patt-Shamir, PODC'11
3. Anders Sjöqvist: H. Sundell, P. Tsigas, Lock-free and Practical Deques using Single-Word Compare-And-Swap, OPODIS 2004
4. Alexander Takacs: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees, Maleq Khan and Gopal Pandurangan, DISC 2008
5. Benjamin Greschbach: S. Frischknecht, S. Holzer and R. Wattenhofer: Networks Cannot Compute Their Diameter in Sublinear Time, SODA 2012
6. Adhiraj Somani: Lock-free Dynamically Resizable Arrays, Damian Dechev, Peter Pirkelbauer, and Bjarne Stroustrup
7. Erik Helin, Sharing memory robustly in message-passing systems av Hagit Attya, Amotz Bar-Noy och Danny Dolev, JACM Volume 42 Issue 1, Jan. 1995