30-Apr-2004: More specific information is now available on the paper review project. Note that you must write your review by next Wednesday, and be ready to discuss the papers during next Friday's lecture.
25-Apr-2004: The last four papers will we read can be found on the papers page. These are written by a cast of familiar characters and have been submitted for publication to a conference. We will be doing our own evaluation of them. You should read and be familiar with all of them, but on Monday (April 26) you will be assigned to provide a full review of one specific paper. We will then meet on the final day of classes (May 7) and discuss the papers and reviews, and decide which papers we would choose to publish.
21-Apr-2004: Read Hertz, Blackburn, McKinley, Moss, and Stefanovic's, Error-Free Garbage Collection Traces: How to Cheat and Not Get Caught, for Friday, April 23. This paper will be presented by the lead author!
16-Apr-2004: Read Berger, McKinley, Blumofe, and Wilson's, Hoard: A Scalable Memory Allocator for Multithreaded Applications for Monday, April 19.
12-Apr-2004: Read Berger, Zorn, and McKinley's, Reconsidering Custom Memory Allocation for Wednesday, April 14.
5-Apr-2004: Read Johnstone and Wilson's, The Memory Fragmentation Problem: Solved? for Wednesday, 7-Apr-2004.
26-Mar-2004: Read Papathanasiou and Scott's, Energy Efficient Prefetching and Caching, for Monday, 29-Mar-2004. This is a pre-publication version of this paper, so I cannot post it. Instead, you can find it on our systems at:
/scratch/projects/cs40/public/PS:EEPC.pdf
15-Mar-2004: Read Wang, Reiher, Popek, and Kuenning's, Conquest: Better Performance Through A Disk/Persistent-RAM Hybrid File System", for Monday, 22-Mar-2004.
5-Mar-2004: Read Zhang and Ghose's, yFS: A Journaling File System Design for Handling Large Data Sets with Reduced Seeking for Monday, 8-Mar-2004.
1-Mar-2004: Read Rosenblum and Ousterhout's, The Design and Implementation of a Log-Structure File System for Wednesday, 3-Mar-2004.
20-Feb-2004: Read Megiddo and Modha's, ARC: A Self-Tuning, Low Overhead Replacement Cache for Monday, 23-Feb-2004. Not surprisingly, this paper describes ARC, an advancement on LIRS.
18-Feb-2004: Read Jiang and Zhang's, LIRS: An Efficient Low Inter-reference Recency Set Replacement Policy to Improve Buffer Cache Performance for Friday, 20-Feb-2004. This paper describes and evaluates the LIRS replacement policy.
16-Feb-2004: Read Lee, et al.'s, On the Existence of a Spectrum of Policies That Subsumes The Least Recently Used (LRU) and Least Frequently Used (LFU) Policies for Wednesday, 18-Feb-2004. This paper describes and evaluates the LRFU replacement policy.
15-Feb-2004: Read Smaragdakis, Kaplan, and Wilson's EELRU: Simple and Efficient Adaptive Page Replacement for Monday, 16-Feb-2004. This paper describes and evaluates the EELRU page replacement policy.
10-Feb-2004: Read Glass and Cao's Adaptive Page Replacement Based on Memory Reference Behavior for Friday, 13-Feb-2004. This paper describes and evaluates the replacement policy SEQ. Note that we may discuss this paper on Friday, or on Monday the 16th.
2-Feb-2004: Read Kaplan (yes, me), Smaragdakis, and Wilson's Trace Reduction for Virtual Memory Simulations for Wednesday, 4-Feb-2004. Of primary interest are the algorithms (how does it work), the comparison to Stack Deletion, and the methods of evaluation (do you believe the results?).
2-Feb-2004: Continue with Section 5 of Uhlig and Mudge. Due today. (Sorry for the late posting, although in my defense, it was annouced at the end of class on Friday...)
26-Jan-2004: Read Uhlig and Mudge's survey, Trace Driven Memory Simulation through Section 4. Due Wednesday, 28-Jan-2004, for class discussion.