ACM SIGARCH/SIGPLAN/SIGOPS ASPLOS Influential Paper AwardThe ASPLOS Influential Paper Award recognizes historical ASPLOS papers that have had major influence on the field. The Program Committee nominates highly influential papers from any ASPLOS conference that occurred ten or more conferences ago, with the final selections being made by the ASPLOS Steering Committee.
The Award is presented annually to the author(s) of paper(s) that appeared in the International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) ten or more ASPLOS conferences prior to the award year. The Award is presented at ASPLOS each year. The first award was made at the ASPLOS 2011 conference, selecting one paper from the first through sixth ASPLOS conferences, which ranged from 1982 through 1994. The papers are judged by their influence on the field, including research influence, industrial impact, or both. An award plaque of recognition is given to each author, and the authors will share a $1,000 prize. A public citation of each award is listed on the SIGARCH, SIGPLAN, and SIGOPS web sites.
The selection is made by the ASPLOS Steering Committee plus the General and Program Chairs of that year’s ASPLOS. The Steering Committee consists of the SIGARCH Chair and Past Chair, one representative each from SIGPLAN and SIGOPS, and the General and Program Chairs of the prior three ASPLOS conferences. Conflicts of interest (see below) are defined as being an author on a qualifying paper, if they have co-authored a paper with an author on a qualifying paper in the last 5 years, if they are from the same institution as an author on a qualifying paper, or if they are the dissertation advisor or advisee of an author on a qualifying paper.
The $1,000 prize and cost of the award plaques are funded from the conference budget each year.
The Selection Procedure
Papers are nominated by members of the ASPLOS Program Committee in the year the award is given. The ASPLOS Program Chair will send the list of nominated papers, with the number of votes to nominate each, to the ASPLOS Steering Committee Chair. Members of the selection committee may nominate additional papers if they do not have a conflict of interest (as defined above) on the paper they are nominating. The committee will identify the top set of about five candidate papers, and committee members should not advocate for a paper on which they have a conflict to reside in the top set. Once the top set of papers are identified, the committee will vote on which paper should receive the award, with committee members that are conflicted with a paper in the top set abstaining from the vote to that paper. The committee will then select the top one or more papers as the winner(s). Runner-up papers should be recorded by the Steering Committee for consideration in subsequent years. Nominated papers should be communicated from the Program Committee chair to the selection committee no more than one month after the Program Committee meeting, and the final selection should occur and be communicated to the ASPLOS Program Committee and General Chairs no more than two months after the Program Committee meeting. The recipients of the award should be notified no less than six weeks before the ASPLOS conference.
- Clearing the Clouds: a study of emerging scale-out workloads on modern hardware, ASPLOS 2012. Michael Ferdman, Almutaz Adileh, Onur Kocberber, Stavros Volos, Mohammad Alisafaee, Djordje Jevdjic, Cansu Kaynak, Adrian Daniel Popescu, Anastasia Ailamaki, Babak Falsafi.
- Learning from mistakes: a comprehensive study on real world concurrency bug characteristics, ASPLOS 2008. Soyeon Park, Eunsoo Seo, Yuanyuan Zhou.
- Rethinking the Library OS from the Top Down, ASPLOS 2011. Silas Boyd-Wickizer, Jon Howell, Reuben Olinsky, Galen C. Hunt.
- Design and evaluation of a compiler algorithm for prefetching, ASPLOSS 1992. Todd C. Mowry, Monica S. Lam, Anoop Gupta.
- A VLIW Architecture for a Trace Scheduling Compiler, ASPLOS 1987. Robert P. Colwell, Robert P. Nix, John J. O’Donnell, David B. Papworth, Paul K. Rodman.
- The Cache Performance and Optimizations of Blocked Algorithms, ASPLOS 1991. Monica S. Lam, Edward E. Rothberg, Michael E. Wolf.
- Improving the Accuracy of Dynamic Branch Prediction Using Branch Correlation, APLOS 1992. Shien-Tai Pan, Kimming So, Joseph T. Rahmeh.
- Value Locality and Load Value Prediction, ASPLOS 1996. Mikko H. Lipasti, Christopher B. Wilkerson, John Paul Shen.
- Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet, ASPLOS 2002. Philo Juang, Hidekazu Oki, Yong Wang, Margaret Martonosi, Li Shiuan Peh, and Daniel Rubenstein.
- A comparison of software and hardware techniques for x86 virtualization, ASPLOS 2006. Keith Adams, Ole Agesen.
2019 — Hoard: a scalable memory allocator for multithreaded applications, ASPLOS 2000. Emery D. Berger, Kathryn S. McKinley, Robert D. Blumofe, and Paul Wilson.
2018 — OceanStore: an architecture for global-scale persistent storage, ASPLOS 2000. John Kubiatowicz, David Bindel, Yan Chen, Steven Czerwinski, Patrick Eaton, Dennis Geels, Ramakrishna Gummadi, Sean Rhea, Hakim Weatherspoon, Westley Weimer, Chris Wells, and Ben Zhao.
2017 — Automatically characterizing large scale program behavior, ASPLOS 2002. Timothy Sherwood, Erez Perelman, Greg Hamerly, Brad Calder.
2016 — Limits of instruction-level parallelism, ASPLOS 1991. David W. Wall.
2015 — The case for a single-chip multiprocessors, ASPLOS 1996. Kunle Olukotun, Basem A. Nayfeh, Lance Hammond, Ken Wilson, and Kunyung Chang.
2014 — Secure program execution via dynamic information flow tracking, ASPLOS 2004. G. Edward Suh, Jae W. Lee, David Zhang and Srinivas Devadas.
2013 — Transactional lock-free execution of lock-based programs, ASPLOS 2002. Ravi Rajwar, James R. Goodman.
2012 — None given
2011 — The 801 Minicomputer, ASPLOS 1982. George Radin.