Monday, April 15, 2013

• TimeStream: Reliable Stream Computation in the Cloud

  Zhengping Qian (Microsoft Research Asia), Yong He (South China University of Technology), Chunzhi Su, Zhuojie Wu, and Hongyu Zhu (Shanghai Jiaotong University), Taizhi Zhang (Peking University), Lidong Zhou (Microsoft Research Asia), Yuan Yu (Microsoft Research Silicon Valley), and Zheng Zhang (Microsoft Research Asia)

• Optimus: A Dynamic Rewriting Framework for Execution Plans of Data-Parallel Computation

  Qifa Ke, Michael Isard, and Yuan Yu (Microsoft Research Silicon Valley)

• BlinkDB: Queries with Bounded Errors and Bounded Response Times on Very Large Data

  Sameer Agarwal (University of California, Berkeley), Barzan Mozafari (Massachusetts Institute of Technology), Aurojit Panda (University of California, Berkeley), Henry Milner (University of California, Berkeley), Samuel Madden (Massachusetts Institute of Technology), and Ion Stoica (University of California, Berkeley)

• IFDB: Decentralized Information Flow Control for Databases

  David Schultz and Barbara Liskov (MIT CSAIL)

• Process Firewalls: Protecting Processes During Resource Access

  Hayawardh Vijayakumar (The Pennsylvania State University), Joshua Schiffman (Advanced Micro Devices), and Trent Jaeger (The Pennsylvania State University)

• Resolving the conflict between generality and plausibility in verified computation

  Srinath Setty, Benjamin Braun, Victor Vu, and Andrew J. Blumberg (UT Austin), Bryan Parno (Microsoft Research Redmond), and Michael Walfish (UT Austin)

• ChainReaction: A Causal+ Consistent Datastore based on Chain Replication

  Sergio Almeida, Joao Leitao, and Luıs Rodrigues (INESC-ID, Instituto Superior Tecnico, Universidade Tecnica de Lisboa)

• Augustus: Scalable and Robust Storage for Cloud Applications

  Ricardo Padilha and Fernando Pedone (University of Lugano, Switzerland)

• MDCC: Multi-Data Center Consistency

  Tim Kraska, Gene Pang, and Michael Franklin (UC Berkeley), Samuel Madden (MIT), and Alan Fekete (University of Sydney)

• Conversion: Multi-Version Concurrency Control for Main Memory Segments

  Timothy Merrifield and Jakob Eriksson (University of Illinois at Chicago)

• Whose Cache Line Is It Anyway? Operating System Support for Live Detection and Repair of False Sharing

  Mihir Nanavati, Mark Spear, Nathan Taylor, Shriram Rajagopalan, Dutch T. Meyer, William Aiello, and Andrew Warfield (University of British Columbia)

• Adaptive Parallelization of Web Search

  Myeongjae Jeon (Rice University), Yuxiong He (Microsoft Research), Sameh Elnikety (Microsoft Research), Alan L. Cox and Scott Rixner (Rice University)

Tuesday, April 16, 2013

• Mizan: A System for Dynamic Load Balancing in Large-scale Graph Processing

  Zuhair Khayyat, Karim Awara, and Amani Alonazi (King Abdullah University of Science and Technology), Hani Jamjoom and Dan Williams (IBM T. J. Watson Research Center, Yorktown Heights), and Panos Kalnis (King Abdullah University of Science and Technology)

• MeT: Workload aware elasticity for NoSQL

  Francisco Cruz, Francisco Maia, Miguel Matos, Rui Oliveira, Joao Paulo, Jose Pereira, and Ricardo Vilaca (HASLab / INESC TEC and U. Minho)

• Presto: Distributed Machine Learning and Graph Processing with Sparse Matrices

  Shivaram Venkataraman (UC Berkeley), Erik Bodzsar (University of Chicago), and Indrajit Roy, Alvin AuYoung, and Robert S. Schreiber (HP Labs)

• RadixVM: Scalable address spaces for multithreaded applications

  Austin T. Clements, Frans Kaashoek, and Nickolai Zeldovich (MIT CSAIL)

• Failure-Atomic msync(): A Simple and Efficient Mechanism for Preserving the Integrity of Durable Data

  Stan Park (University of Rochester), Terence Kelly (HP Labs), and Kai Shen (University of Rochester)

• Composing OS extensions safely and efficiently with Bascule

  Andrew Baumann (Microsoft Research), Dongyoon Lee (University of Michigan), Pedro Fonseca (MPI Software Systems), and Jacob R. Lorch, Barry Bond, Reuben Olinsky, and Galen C. Hunt (Microsoft Research)

• Hypnos: Understanding and Treating Sleep Conflicts in Smartphone

  Abhilash Jindal, Abhinav Pathak, Y. Charlie Hu, and Samuel Midkiff (Purdue University)

• Prefetching Mobile Ads: Can advertising systems afford it?

  Prashanth Mohan (UC Berkeley) and Suman Nath and Oriana Riva (Microsoft Research)

• Maygh:Building a CDN from client web browsers

  Liang Zhang, Fangfei Zhou, Alan Mislove, and Ravi Sundaram (Northeastern University)

• A Compiler-level Intermediate Representation based Binary Analysis and Rewriting System

  Kapil Anand, Matthew Smithson, Khaled Elwazeer, Aparna Kotha, Jim Gruen, Nathan Giles, and Rajeev Barua (University of Maryland, College Park)

Wensday, April 17, 2013

• hClock: Hierarchical QoS for Packet Scheduling in a Hypervisor

  Jean-Pascal Billaud and Ajay Gulati (VMware, Inc.)

• RapiLog: Reducing System Complexity Through Verification

  Gernot Heiser, Etienne Le Sueur, Adrian Danis, and Aleksander Budzynowski (NICTA and UNSW) and Tudor-Ioan Salomie and Gustavo Alonso (ETH Zurich)

• Application Level Ballooning for Efficient Server Consolidation

  Tudor-Ioan Salomie, Gustavo Alonso, and Timothy Roscoe (ETH Zurich) and Kevin Elphinstone (UNSW and NICTA)

• Omega: flexible, scalable schedulers for large compute clusters

  Malte Schwarzkopf (University of Cambridge Computer Laboratory), Andy Konwinski (University of California Berkeley), and Michael Abd-el-Malek and John Wilkes (Google Inc.)

• Choosy: Max-Min Fair Sharing for Datacenter Jobs with Constraints

  Ali Ghodsi, Matei Zaharia, Scott Shenker, and Ion Stoica (UC Berkeley)

• CPI2: CPU performance isolation for shared compute clusters

  Xiao Zhang, Eric Tune, Robert Hagmann, Rohit Jnagal, vrigo Gokhale, and John Wilkes (Google, Inc.)