Student Class Presentation
A successful delivery of the presentation will earn an extra credit of up to 5%.
Each student may consider to make an optional class presentation. If you intend
to make the presentation, you need to inform the instructor
no later than Feb 28th (the earlier the better).
You will work with the instructor to identify an appropriate date for your
presentation. You are encouraged to find the topic of your presentation on your
own (as long as it is related to parallel and distributed systems).
You can also choose the presentation topic from the list of suggested readings below.
Regardless of your choice of the topic, the instructor will be available to help you
prepare for the presentation. Your presentation (and questions/answers) should
approximately take half the time of a class (about 37 minutes).
Suggested readings (reverse chronologically ordered):
If you cannot access a paper from the publisher's site directly, you should be able
to search online to find additional copies of the paper.
- Top 500 Supercomputing sites
- The datacenter as a computer: An introduction to the design of warehouse-scale machines, Barroso, Clidaras, and Holzle. Morgan and Claypool, 2013.
- Scaling memcache at Facebook, Nishtala, Fugal, Grimm, Kwiatkowski, Lee, Li, McElroy, Paleczny, Peek, Saab, Stafford, Tung, and Venkataramani. 10th USENIX Symposium on Networked Systems Design and Implementation, 2013.
- Power containers: An OS facility for fine-grained power and energy management on multicore servers, Shen, Shriraman, Dwarkadas, Zhang, and Chen. 18th International Conference on Architectural Support for Programming Languages and Operating Systems, 2013.
- Debunking the 100X GPU vs. CPU myth: An evaluation of throughput computing on CPU and GPU, Lee, Kim, Chhugani, Deisher, Kim, Nguyen, Satish, Smelyanskiy, Chennupaty, Hammarlund, Singhal, and Dubey. 37th International Symposium on Computer Architecture, 2010
- FAWN: A fast array of wimpy nodes, Andersen, Franklin, Kaminsky, Phanishayee, Tan, and Vasudevan. 22nd ACM Symposium on Operating Systems Principles, 2009.
- Bigtable: A distributed storage system for structured data, Chang, Dean, Ghemawat, Hsieh, Wallach, Burrows, Chandra, Fikes, and Gruber. 7th USENIX Symposium on Operating Systems Design and Implementation, 2006.
- The Java memory model, Manson, Pugh, and Adve. 32nd ACM Symposium on Principles of Programming Languages, 2005.
- MapReduce: Simplified data processing on large clusters, Dean and Ghemawat. 6th USENIX Symposium on Operating Systems Design and Implementation, 2004.
- The Google file system, Ghemawat, Gobioff, and Leung. 19th ACM Symposium on Operating Systems Principles, 2003.
- Capriccio: Scalable threads for Internet services, Behren, Condit, Zhou, Necula, and Brewer. 19th ACM Symposium on Operating Systems Principles, 2003.
- GPFS: A shared-disk file system for large computing clusters, Schmuck and Haskin. First USENIX Conference on File and Storage Technologies, 2002.
- A Survey of Rollback-Recovery Protocols in Message-Passing Systems, Elnozahy, Alvisi, Wang, and Johnson, ACM Computing Surveys, 2002.
- The costs and limits of availability for replicated services, Yu and Vahdat. 18th ACM Symposium on Operating Systems Principles, 2001.
- The Sun fireplane system interconnect, Charlesworth. Supercomputing Conference, 2001.
- Practical Byzantine fault tolerance, Castro and Liskov. First USENIX Symposium on Operating Systems Design and Implementation, 1999.
- Flash: An Efficient and Portable Web Server, Pai, Druschel, and Zwaenepoel. USENIX Annual Technical Conference, 1999.
- Locality-aware request distribution in cluster-based network servers, Pai, Aron, Banga, Svendsen, Druschel, Zwaenepoel, and Nahum. 8th International Conference on Architectural Support for Programming Languages and Operating Systems, 1998.
- TreadMarks: Shared Memory Computing on Networks of Workstations, Amza, Cox, Dwarkadas, Keleher, Lu, Rajamony, Yu, and Zwaenepoel. IEEE Computer, 1996.
- Transactional memory: Architectural support for lock-free data structures, Herlihy and Moss. 20th International Symposium on Computer Architecture, 1993.
- Memory consistency and event ordering in scalable shared-Memory multiprocessors, Gharachorloo, Lenoski, Laudon, Gibbons, Gupta, and Hennessy. 17th International Symposium on Computer Architecture, 1990.
- The performance implications of thread management alternatives for shared-memory multiprocessors, Anderson, Lazowska, and Levy. IEEE Transactions on Computers, 1989.
- Scale and performance in a distributed file system, Howard, Kazar, Menees, Nichols, Satyanarayanan, Sidebotham, and West. ACM Transactions on Computer Systems, 1988.
- Implementing remote procedure calls, Birrell and Nelson. ACM Transactions on Computer Systems, 1984.