UW-Madison Logo

UW Operating Systems
  Systems Seminar

Spring 2008

The operating systems seminar is held every other Monday afternoon from 4:00 - 5:00 PM in Computer Sciences & Statistics room 2310 (alternating with the security seminar ).

Keeping up-to-date with current research is a critical task for both students and faculty. A weekly seminar is a fun and social way to keep in touch with other's work. At the seminar, you can eat a few cookies, chitchat about the finer points of mutual exclusion, and exchange ideas with students and faculty working in your field. The seminar schedule is a mix of original research being carried out at the University of Wisconsin, visitors to our department who will update us on their work, and short presentations and discussions led by current UW students of current operating systems papers.

To subscribe to our mailing list, please visit the mailman page at https://lists.cs.wisc.edu/mailman/listinfo/os-seminar The list traffic is about one or two messages per week to announce the next seminar, and the occasional newsworthy item about operating systems. Questions about the seminar and arrangements may be directed to Haryadi Gunawi (haryadi @ [thisServer]).

Schedule

Date
Topic and Speaker
Monday
February 18th
4:00 PM
2310 CS&S
Parity Lost and Parity Regained

This is a practice talk for FAST '08. The full paper can be downloaded here: [pdf]

RAID storage systems protect data from storage errors, such as data corruption, using a set of one or more integrity techniques, such as checksums. The exact protection offered by certain techniques or a combination of techniques is sometimes unclear. We introduce and apply a formal method of analyzing the design of data protection strategies. Specifically, we use model checking to evaluate whether common protection techniques used in parity-based RAID systems are sufficient in light of the increasingly complex failure modes of modern disk drives. We evaluate the approaches taken by a number of real systems under single-error conditions, and find flaws in every scheme. In particular, we identify a parity pollution problem that spreads corrupt data (the result of a single error) across multiple disks, thus leading to data loss or corruption. We further identify which protection measures must be used to avoid such problems. Finally, we show how to combine real-world failure data with the results from the model checker to estimate the actual likelihood of data loss of different protection strategies.

Monday
February 27th
4:00 PM
4310 CS&S
Virtual Machine-Provided Context Sensitive Page Mappings

This is a practice talk for VEE '08. The full paper can be downloaded here: [pdf]

Context sensitive page mappings provide different mappings from virtual addresses to physical page frames depending on whether a memory reference occurs in a data or instruction context. Such differences can be used to modify the behavior of programs that reference their executable code in a data context. Previous work has demonstrated several applications of context sensitive page mappings, including protection against buffer-overrun attacks and circumvention of self-checksumming codes. We extend context sensitive page mappings to the virtual machine monitor, allowing operation independent of the guest operating system. Our technique takes advantage of the VMM's role in enforcing protection between guest operating systems to interpose on guest OS memory management operations and selectively introduce context sensitive page mappings.

We describe extensions to the Xen hypervisor that support context sensitive page mappings in unmodified guest operating systems. We demonstrate the utility of our technique in a case study by instrumenting and modifying self-checksumming tamper-resistant binaries. We further demonstrate that context sensitive page mappings can be provided by the VMM without incurring extensive overhead. Our measurements indicate only minor performance penalties stem from use of this technique. We suggest several further applications of VMM-provided context sensitive page mappings, including OS hardening and protection of processes from malicious applications.

Archive of Old Talks

Instructions to Speakers

  • Two weeks before your talk, mail a title and abstract to the seminar coordinators.
  • Plan to speak for forty-five minutes and answer questions for fifteen. (Shorter practice talks are also welcome.)
  • You may use whatever medium you prefer. We will provide a Linux/Windows machine, a digital projector, and an analog projector.
  • After your talk, mail a copy of your slides (.ps or .ppt) to the coordinators to be archived.
  • Speakers should bring cookies or a snack to share!
  • Suggestions for Giving a Good (or a Bad) Talk

  • by Mark D. Hill
  • by David A. Patterson
  • by David Messerschmit
  • by David Stock
  • by Bruce Donald
  • by Peyton et. al.
  • by Ian Parberry
  •   Maintained by Haryadi S. Gunawi and the OS faculty.