Latest Update

Follow Us on Social Media

Call for Contributions

Call for papers





Main conference:

23rd International Conference on Architectural Support for  Programming Languages and Operating Systems

PDF Version

Abstract submissions      Aug 4, 2017
Full paper submissions  Aug 11, 2017
Author response             Oct 25-29, 2017
Notification                        Nov 13, 2017
Final copy deadline         Jan 19, 2018


ASPLOS is the premier forum for multidisciplinary systems research spanning computer architecture and hardware, programming languages and compilers, operating systems and networking. The ASPLOS 2018 will be held in Williamsburg, Virginia, a town that combines a rich slice of American Colonial and Revolutionary history with a modern college atmosphere. Like its predecessors, ASPLOS 2018 invites papers on ground-breaking research at the intersection of at least two ASPLOS disciplines: architecture, programming languages, operating systems, and related areas. Non-traditional topics are especially encouraged. The importance of cross-cutting research continues to grow as we grapple with the end of Dennard scaling, the explosion of big data, scales ranging from ultra-low power wearable devices to exascale parallel and cloud computers, the need for sustainability, and increasingly human-centered applications. ASPLOS embraces systems research that directly targets these new problems in innovative ways. The research may target diverse goals, such as performance, energy and thermal efficiency, resiliency, security, and sustainability. The review process will be sensitive to the challenges of multidisciplinary work in emerging areas.


Areas of interest include, but are not limited to:

      • Existing and emerging platforms at all scales, from embedded to cloud
      • Internet services, cloud computing, and datacenters
      • Multicore architectures and systems
      • Heterogeneous architectures and accelerators
      • Systems for enabling parallelism at an extreme scale
      • Programming models, languages, and compilation for all platforms
      • Managing, storing, and computing on big data
      • Virtualization and virtualized systems
      • Memory and storage technologies and architectures
      • Power, energy, and thermal management
      • Security, reliability, and availability
      • Verification and testing, and their impact on design
      • Support for approximations and approximate computing
      • Non-traditional computing systems



Call for Workshops/Tutorials

PDF Version

Call for Tutorial Proposals

Tutorial proposals are solicited for ASPLOS-2018, which will take place in Williamsburg, VA. Tutorials will be held on March 24, 2018 (Saturday) and March 25, 2018 (Sunday).
Proposals for both half- and full-day tutorials are solicited on any topic that is relevant to the ASPLOS audience. In previous years, tutorials seeking to achieve either of the following goals have been particularly successful:
Describe an important piece of research infrastructure.
Educate the community on an emerging topic.

Submission Procedures
Proposals should provide the following information:
Presenter(s) and contact information.
Proposed duration (full day, half day).
1-2 paragraph abstract suitable for tutorial publicity.
1 paragraph biography per presenter suitable for tutorial publicity.
1-3 page description (for evaluation). This should include:
Tutorial scope and objectives,
Topics to be covered,
Target audience,
If the tutorial has been held previously, the location (i.e., conference), date, and number of attendees.

Proposals should be submitted in PDF format via e-mail to Zhijia Zhao ( ) and Rajiv Gupta ( with the subject “ASPLOS2018 Tutorial Proposal”. Submissions will be acknowledged via e-mail.

Important Dates
Submission deadline: Monday, November 6, 2017
Notification:Monday, November 24th 2017



Call for Workshop Proposals

Workshop and tutorial proposals are solicited for ASPLOS-2018, Williamsburg, VA. Workshops will be held on March 24, 2018 (Saturday) and March 25, 2018 (Sunday).

Proposals in the interplay between programming languages, computer architecture, operating systems, and user interfaces to deal with power, performance, resilience, and programmer productivity issues in emerging areas such as datacenters and cloud computing, systems based on non-volatile memory technologies, large scale data analysis, smart infrastructure, and extreme scale computing are encouraged.

Please include in your proposal
Title of the workshop
Organizers and their affiliations
Sample call for papers
Duration – Half-Day or Full Day
Preferred Day – Saturday or Sunday
If the workshop was previously held, the location (conference), date, and number of attendees

Proposals should be submitted via e-mail to Zhijia Zhao ( and Rajiv Gupta ( with the subject “ASPLOS2018 Workshop Proposal”. Submissions will be acknowledged via e-mail.
Feel free to contact Zhijia and Rajiv if you have any questions about the suitability of a workshop for ASPLOS or for any other related matters.

Important Dates
Submission deadline: Monday, November 6, 2017
Notification:Monday, November 24th 2017

Call for Student Research Competition (SRC)

PDF Version

ACM Student Research Competition

Important Dates Abstract submission: 11:59pm PST Friday, December 8, 2017.

Acceptance notification: 11:59pm PST Friday, Feb 2, 2018.

ASPLOS is the premier forum for multidisciplinary systems research spanning computer architecture and hardware, programming languages and compilers, operating systems and networking, as well as applications and user interfaces. The ASPLOS 2018 will be held in Williamsburg, Virginia, a town that combines a rich slice of American Colonial and Revolutionary history with a modern college atmosphere.


The 23rd International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) invites participation in the ACM Student Research Competition (SRC). Sponsored by ACM and Microsoft Research, the SRC is a forum for undergraduates and graduate students to share their research results, exchange ideas, and improve their communication skills while competing for prizes. Students accepted to participate in the SRC are entitled to a travel grant (up to $500) to help cover travel expenses. The top 3 undergraduate and graduate winners will receive all of the following prizes:

1. Monetary prizes of $500, $300, and $200, respectively.

2. An award medal (gold, silver or bronze) and a one-year complimentary ACM membership with a subscription to ACM’s Digital Library.

3. The names of the winners and their placement will be posted on the ACM SRC web site.

4. In addition, the first place winner in each category (undergraduate, graduate) will receive an invitation to participate in the SRC Grand Finals, an on-line round of competitions among the first place winners of individual conference-hosted SRCs. The top three graduate and undergraduate Grand Finalists will receive an additional $500, $300, and $200, respectively, along with Grand Finalist medals (gold, silver, bronze). Grand Finalists and their advisors will be invited to the Annual ACM Awards Banquet for an all-expenses-paid trip, where they will be recognized for their accomplishments, along with other prestigious ACM award winners, including the winner of the Turing Award.

The SRC consists of two rounds: a poster session and a presentation session. A panel of judges will select a number of finalists from the poster session, who will be invited to the presentation session at ASPLOS 2018 and compete for the prizes. The evaluation will be concentrated on the quality of both visual and oral presentation, the research methods, and the significance of contribution. You can find more information on the ACM Student Research Competition site.


      A participant in the SRC must meet all following conditions:

  • The participant must submit an up to 800-word abstract outlining the content of a poster that is going to be presented during the competition.

  • The abstract must include the poster title, author names, affiliations, and the name of the academic advisor.

  • It should describe the research problem, motivation and background, techniques and results, and the prospect for clearly and concisely conveying the work in a poster format.

  • It should state the novelty and contributions of the work explicitly.

  • The submission deadline is December 8th, 2017 at 23:59 PST.

  • The abstract must have not appeared before. Novelty is one of the criteria for selection.

  • The abstract and the poster must be authored solely by the participant.

  • The participant can be from anywhere in the world, but must be an ACM student member, and must maintain an undergraduate or graduate student status as of December 8th, 2017.

  • In your submission, please indicate whether you are an undergraduate or a graduate student.

  • You may join ACM prior to entering. Basic student membership is $19 per year or less

For each accepted SRC poster, a one-page extended abstract in the ACM format will be included in the ASPLOS 2018 conference proceedings. The content, however, can be included in a future submission to other conferences or journals.

SRC Chair

Shuaiwen Leon Song (Pacific Northwest National Lab and College of William & Mary)

Yufei Ding (University of California, Santa Barbara)


SRC Committee
Shuaiwen (Leon) Song, PNNL & William Mary
Yufei Ding, University of California, Santa Barbara
Linhai Song, The Pennsylvania State University
Dorian Arnold, Emory University
Hung-Wei Tseng, North Carolina State University
Jiajia Li, Georgia Institute of Technology
Amanda Randles, Duke University
Daniel Wong, University of California, Riverside
Dongyoon Lee, Virginia Tech
Ang Li, Pacific Northwest National Lab
Huiyang Zhou, North Carolina State University
Kathryn Mohror, Lawrence Livermore National Laboratory
Xiaochen Guo, Lehigh University
Aparna Chandramowlishwaran, University of California, Irvine
Yingyan Lin, Rice University
Jishen Zhao, University of California, Santa Cruz
Yuxiong He, Microsoft


Submission Information

Extended abstracts of up to 800 words should be submitted through the following easychair link on or before December 8, 2017:

The ACM Student Research Competition at ASPLOS 2018 is sponsored by the ACM and Microsoft Research.

Call for WACI

After a brief hiatus in 2017, ASPLOS 2018 is looking for forward-looking, visionary, inspiring, far out and just plain amazing ideas for its next Wild and Crazy Ideas session. What we are aiming for is a session full of creativity presented in an exciting way. In case you have been to prior WACI sessions and noted comedy aspects to the presentations, please note that comedy is completely optional and is not part of the selection criteria.

We do not have a prescribed list of topics. Anything directly or indirectly related to computing systems is appropriate. If you are unsure whether a topic is appropriate, please get in touch with the WACI organizers via email.


Submission instructions:

You can submit either a 2-page abstract or a 6-minute video/narrated slide deck.
Please submit your materials here: .
Submission Deadline: 5:00pm EST, January 10, 2018

Michael Carbin (MIT)
Luis Ceze (University of Washington)

Call for Shadow PC Participation

23rd International Conference on Architectural Support for Programming Languages and Operating Systems

PDF Version

ASPLOS is organizing a shadow program committee for ASPLOS 2018. If you are interested in participating, please send an email to the shadow PC organizers: Johann Hauswald (University of Michigan, jahausw AT and Yunqi Zhang (University of Michigan, yunqi AT before July 31st, 2017. Please include a short paragraph describing your current research, areas of expertise, and publications: this will help us with selecting candidates and assigning papers for review. Feel free to reach out should you have any questions.


Being on a shadow PC is an excellent opportunity for systems researchers (PhD students, post-docs and new faculty members) to get experience in community service, i.e., program committee practices.

Shadow PC members are expected to write their own detailed and rigorous reviews for their assigned papers. We expect a review load of 15-20 papers per member. Members especially are also expected to attend a one-day shadow PC meeting in person which will coincide with the official PC meeting location (Chicago or Atlanta) and date. The reviews from the shadow PC will not impact the decisions of the main conference PC. Shadow PC co-chairs (Prof. Lingjia Tang and Prof. Thomas Wenisch) will lead the discussions at the shadow PC meeting, and other members of the main conference PC will also be invited to the meeting, making this an invaluable learning experience for the shadow PC members.

The ASPLOS shadow PC will follow the same timeline as the main PC ( We plan to have the shadow PC meeting a day after the conference PC meeting (November 11th, 2017).

Being a member of a shadow PC is a lot of work but also a great learning experience for a number of reasons:

  • Getting to know how a PC is run and how it operates.
  • Seeing how more experienced reviewers judge the same papers that you review.
  • Getting to see both strong and weak papers at the submission stage.
  • Submitting high quality reviews makes one a possible candidate for future PCs.
  • Discussing the papers with ASPLOS main PC members who will attend the shadow meeting.

Important Dates

  • Deadline to apply for shadow PC: July 31st, 2017
  • Shadow PC meeting: November 11th, 2017

Shadow PC Co-Chairs

  • Lingjia Tang, University of Michigan
  • Thomas Wenisch, University of Michigan


  • Johann Hauswald, University of Michigan
  • Yunqi Zhang, University of Michigan



23rd ACM International Conference on Architectural Support for Programming Languages and Operating Systems
Williamsburg, VA, U.S.A, March, 2018

This document provides instructions for submitting papers to the 23rd International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2018. In an effort to respect the efforts of reviewers and in the interest of fairness to all prospective authors, we request that all submissions to ASPLOS 2018 follow the formatting and submission rules detailed below. Submissions that violate these instructions may not be reviewed, at the discretion of the program chair, in order to maintain a review process that is fair to all potential authors. An example submission (formatted using the ASPLOS’18 submission format) that contains the submission and formatting guidelines can be downloaded from here: Sample PDF. The content of the document mirrors the submission instructions on this page.

Submission Site:

Please follow this link to submit your paper.
Abstract/paper registration deadline:
Aug 4, 2017 (11:59:59pm US eastern time)

Full paper submission deadline:
Aug 11, 2017 (11:59:59pm US eastern time)


  • Paper must be submitted in printable PDF format.
  • Text must be in a minimum 10pt (not 9pt) font.
  • Papers must be submitted in printable PDF format and should contain a maximum of 11 pages of single-spaced two-column text, including any appendixes, but not including references.
  • No page limit for references.
  • Each reference must specify all authors (no et al.).
  • Authors of all accepted papers will be required to give a lightning presentation (about 90s) and a poster in addition to the regular conference talk.
  • Proceedings will appear in the ACM digital library up to two weeks before the conference.

Paper Evaluation Objectives:

The committee will make every effort to judge each submitted paper on its own merits. There will be no target acceptance rate. We expect to accept a wide range of papers with appropriate expectations for evaluation — while papers that build on significant past work with strong evaluations are valuable, papers that open new areas with less rigorous evaluation are equally welcome and especially encouraged. Given the wide range of topics covered by ASPLOS, every effort will be made to find expert reviewers.

Paper Preparation Instructions

Paper Formatting

Papers must be submitted in printable PDF format and should contain a maximum of 11 pages of single-spaced two-column text, including any appendixes, but not including references. You may include any number of pages for references, but see below for more instructions. If you are using LATEX to typeset your paper, then we suggest that you use the template here: LATEX Template. (This sample PDF was prepared with that template.) If you are using a different software package to typeset your paper, then please adhere to the guidelines given in Table 1.

One exception is that authors may use the SIGPLAN style/class file here, but only with the 10pt body font option (9pt will be rejected) and modified as needed for the requirements of the references section below. This is marginally different from the specified template, but will be accepted due to its widespread use.

Please ensure that you include page numbers with your submission. This makes it easier for the reviewers to refer to different parts of your paper when they provide comments. Please ensure that your submission has a banner at the top of the title page, similar to this one, which contains the submission number and the notice of confidentiality. If using the template, just replace XXX with your submission number.

Table 1: Formatting guidelines for submission.
Field Value
File format PDF
Page limit 11 pages, not including references
Paper size US Letter 8.5in x 11in
Top margin 1in
Bottom margin 1in
Left margin 0.75in
Right margin 0.75in
Body 2-column, single-spaced
Separation between columns 0.25in
Body font 10pt
Abstract font 10pt, italicized
Section heading font 12pt, bold
Subsection heading font 10pt, bold
Caption font 9pt, bold
References 8pt, no page limit, list all authors’ names


Author List. Reviewing will be double blind; therefore, please do not include any author names on any submitted documents except in the space provided on the submission form. You must also ensure that the metadata included in the PDF does not give away the authors. If you are improving upon your prior work, refer to your prior work in the third person and include a full citation for the work in the bibliography. For example, if you are building on your own prior work in the papers [2, 3, 4], you would say something like: “While the authors of [2, 3, 4] did X, Y, and Z, this paper additionally does W, and is therefore much better.” Do NOT omit or anonymize references for blind review. There is one exception to this for your own prior work that appeared in IEEE CAL, workshops without archived proceedings, etc. as discussed later in this document.

Figures and Tables. Ensure that the figures and tables are legible. Please also ensure that you refer to your figures in the main text. Many reviewers print the papers in gray-scale. Therefore, if you use colors for your figures, ensure that the different colors are highly distinguishable in gray-scale.

References. There is no length limit for references. Each reference must explicitly list all authors of the paper. Papers not meeting this requirement will be rejected. Authors of NSF proposals should be familiar with this requirement. Knowing all authors of related work will help find the best reviewers. Since there is no length limit for the number of pages used for references, there is no need to save space here.

Paper Submission Instructions

Declaring Authors

Declare all the authors of the paper upfront. Addition/removal of authors once the paper is accepted will have to be approved by the program chair, since it potentially undermines the goal of eliminating conflicts for reviewer assignment.

Areas and Topics

ASPLOS emphasizes multidisciplinary research. Submissions should ideally emphasize synergy of two or more ASPLOS areas: architecture, programming languages, operating systems, and related areas (broadly interpreted). Authors should indicate these areas on the submission form as well as specific topics covered by the paper for optimal reviewer match. If you are unsure whether your paper falls within the scope of ASPLOS, please check with the program chair – ASPLOS is a broad, multidisciplinary conference and encourages new topics.

Declaring Conflicts of Interest

Authors must register all their conflicts on the paper submission site. Conflicts are needed to ensure appropriate assignment of reviewers. If a paper is found to have an undeclared conflict that causes a problem OR if a paper is found to declare false conflicts in order to abuse or “game” the review system, the paper may be rejected. Please declare a conflict of interest (COI) with the following for any author of your paper:

  • Your Ph.D. advisor(s), post-doctoral advisor(s), Ph.D. students, and post-doctoral advisees, forever.
  • Family relations by blood or marriage, or their equivalent, forever (if they might be potential reviewers).
  • People with whom you have collaborated in the last five years, including
    • co-authors of accepted/rejected/pending papers.
    • co-PIs of accepted/rejected/pending grant proposals.
    • funders (decision-makers) of your research grants, and researchers whom you fund.
  • People (including students) who shared your primary institution(s) in the last five years.

“Service” collaborations such as co-authoring a report for a professional organization, serving on a program committee, or co-presenting tutorials, do not themselves create a conflict of interest. Co-authoring a paper that is a compendium of various projects with no true collaboration among the projects does not constitute a conflict among the authors of the different projects. On the other hand, there may be others not covered by the above with whom you believe a COI exists, for example, close personal friends. Please report such COIs; however, you may be asked to justify them. Please be reasonable. For example, you cannot declare a COI with a reviewer just because that reviewer works on topics similar to or related to those in your paper. The PC Chair may contact co-authors to explain a COI whose origin is unclear. We hope to draw most reviewers from the PC and the ERC, but others from the community may also write reviews. Please declare all your conflicts (not just restricted to the PC and ERC). When in doubt, contact the program chair.

Concurrent Submissions and Workshops

By submitting a manuscript to ASPLOS’18, the authors guarantee that the manuscript has not been previously published or accepted for publication in a substantially similar form in any conference, journal, or workshop. The only exceptions are (1) workshops without archived proceedings such as in the ACM digital library (or where the authors chose not to have their paper appear in the archived proceedings), or (2) venues, such as IEEE CAL, where there is an explicit policy that such publication does not preclude longer conference submissions. These are not considered prior publications.  Technical reports and papers posted on public social media sites, Web pages, or online repositories, such as, are not considered prior publications either. In such exceptional cases, the submitted manuscript may ignore the above work to preserve author anonymity. This information must, however, be provided on the submission form – the program chair(s) will make this information available to reviewers if it becomes necessary to ensure a fair review. (This policy will be explicitly conveyed to the reviewers as well.)  The authors also guarantee that no paper that contains significant overlap with the contributions of the submitted paper will be under review for any other conference, journal, or workshop during the ASPLOS’18 review period. Violation of any of these conditions will lead to rejection.  As always, if you are in doubt, it is best to contact the program chair(s).  Finally, we also note that the ACM Plagiarism Policy ( covers a range of ethical issues concerning the misrepresentation of other works or one’s own work.

Early Access in the Digital Library

The ASPLOS’18 proceedings will be freely available via the ACM Digital Library for up to two weeks before and up to a month after the conference. Authors must consider any implications of this early disclosure of their work before submitting their papers.


Several ideas in this document and parts of the text have been taken from previous conferences, so we thank their program chairs.  In particular, John Carter (ASPLOS’17), Yuanyuan Zhou (ASPLOS’16), Sandhya Dwarkadas (ASPLOS’15), Sarita Adve (ASPLOS’14), Steve Keckler (ISCA’14), Christos Kozyrakis (MICRO’13), Margaret Martonosi (ISCA’13), Onur Mutlu (MICRO’12), and Michael L. Scott (ASPLOS’12)

Example References

[1] Leslie Lamport. LATEX: A Document Preparation System. Addison-Wesley, Reading, Massachusetts, 2nd Edition, 1994.

[2] Firstname1 Lastname1 and Firstname2 Lastname2. A very nice paper to cite. In Proceedings of the 33rd Annual ACM SIGPLAN Conference on Programming Language Design and Implementation, 2012.

[3] Firstname1 Lastname1, Firstname2 Lastname2, and Firstname3 Lastname3. Another very nice paper to cite. In Proceedings of the 22nd ACM Symposium on Operating Systems Principles, 2011.

[4] Firstname1 Lastname1, Firstname2 Lastname2, Firstname3 Lastname3, Firstname4 Lastname4, and Firstname5 Lastname5. Yet another very nice paper to cite, with many author names all spelled out. In Proceedings of the 38th Annual International Symposium on Computer Architecture, 2011.


Tutorials, Workshops and VEE

3/24 (Saturday)

Time Patriot Room Colony C Colony A Tiidewater D Colony B Colony D
7:00a-8:30p Breakfast (Colony E)
8:30a-10:00a Third Workshop on Cognitive Architectures (CogArch) 2nd Workshop on Hardware/Software Techniques for Minimizing Data Movement (Min-Move) Learning gem5 Tutorial (Gem5) BigDataBench: Big Data and AI Benchmarks (BigDataBench) Workshop on Inter-Disciplinary Research Challenges in Computer Systems (GrandChallenges)

*open to public

10:00a-10:30a Break (Colony E)
10:30a-12:00p Third Workshop on Cognitive Architectures (CogArch) 2nd Workshop on Hardware/Software Techniques for Minimizing Data Movement (Min-Move) Learning gem5 Tutorial (Gem5) BigDataBench: Big Data and AI Benchmarks (BigDataBench) Workshop on Inter-Disciplinary Research Challenges in Computer Systems
*open to public
12:00p-1:30p Lunch (Provided) @ Colony E
1:30p-3:30p Third Workshop on Cognitive Architectures (CogArch) ReQuEST: Reproducible Quality-Efficient Systems Tournament (ReQuEST) Learning gem5 Tutorial (Gem5) Accelerating Big Data Processing and Associated Deep Learning on Data Centers and HPC Clouds with Modern Architectures (BigData-DeepLearning-HPC) OpenPiton in Action – A Hands-on Tutorial with the Open Source Manycore Processor (OpenPiton) Workshop on Inter-Disciplinary Research Challenges in Computer Systems (GrandChallenges)

*open to public

 3:30p-4:00p Break (Colony E)
4:00p- Third Workshop on Cognitive Architectures (CogArch) ReQuEST: Reproducible Quality-Efficient Systems Tournament (ReQuEST) Learning gem5 Tutorial (Gem5) Accelerating Big Data Processing and Associated Deep Learning on Data Centers and HPC Clouds with Modern Architectures (BigData-DeepLearning-HPC) OpenPiton in Action – A Hands-on Tutorial with the Open Source Manycore Processor (OpenPiton) Workshop on Inter-Disciplinary Research Challenges in Computer Systems (GrandChallenges)

*open to public

3/25 (Sunday)

Time Allegheny Room BC Patriot Room Allegheny Room A Virginia F TideWater AB, Colony A, Colony B, Colony C
7:00a-8:30p Breakfast (Colony E)
8:30a-10:00a The Ninth Workshop on Big Data Benchmark, Performance Optimization, and Emerging Hardware (BPOE-9) Workshop on Approximate Computing Across the Stack (WAX) Workshop on Warehouse-scale Memory Systems (WAMS)) The 14th ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments (VEE) Workshop on Inter-Disciplinary Research Challenges in Computer Systems (GrandChallenges) *invitation only
10:00a-10:30a Break (Colony E)
10:30a-12:00p The Ninth Workshop on Big Data Benchmark, Performance Optimization, and Emerging Hardware (BPOE-9) Workshop on Approximate Computing Across the Stack (WAX) Workshop on Warehouse-scale Memory Systems (WAMS)) The 14th ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments (VEE) Workshop on Inter-Disciplinary Research Challenges in Computer Systems
(GrandChallenges) *invitation only
12:00p-1:30p Lunch (Provided) @ Colony E
1:30p-3:30p The Ninth Workshop on Big Data Benchmark, Performance Optimization, and Emerging Hardware (BPOE-9) Workshop on Approximate Computing Across the Stack (WAX) Energy Efficient Machine Learning and Cognitive Computing for Embedded Applications (EMC2) The 14th ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments (VEE) Workshop on Inter-Disciplinary Research Challenges in Computer Systems (GrandChallenges) *invitation only
 3:30p-4:00p Break (Colony E)
4:00p- The Ninth Workshop on Big Data Benchmark, Performance Optimization, and Emerging Hardware (BPOE-9) Workshop on Approximate Computing Across the Stack (WAX) Energy Efficient Machine Learning and Cognitive Computing for Embedded Applications (EMC2) The 14th ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments (VEE) Workshop on Inter-Disciplinary Research Challenges in Computer Systems (GrandChallenges) *invitation only

Main Conference

3/25 (Sunday)

6:00p – 8:30p Reception & SRC Posters (Virginia ABCD)

3/26 (Monday)

Session 1 — Virginia EF Session 2 — Piedmont Room
7a-8:15a Breakfast (Virginia ABCD)
8:15a-8:30a Opening by GC/PC chairs (Virginia EF)

Keynote 1 (Virginia EF): Hillery Hunter, IBM Fellow and Director, Accelerated Cognitive Infrastructure, IBM Research

Title: “AI productivity: Better hardware doesn’t work without better software”


The journey toward AI has been synergistically fueled by two key factors — availability of lots of data, and availability of lots of compute. Deep learning is one of the hottest areas of AI today and its success has been fueled by use of hardware accelerators, especially GPUs. Despite acceleration, the compute-intensity of deep learning training positions it as one of the few commercial areas of computing today where scientists wait for hours, days, even weeks to realize solutions to their optimization problems. We find in our work that many software packages and system implementations aren’t leveraging the full capability of today’s accelerators. Chip-System-Software co-design and co-optimization can result in dramatic efficiency improvements, and realize productivity gains for data scientists, freeing them up to focus on the fundamental science of deep learning — gaining accuracy, functionality, and generalizability of their models.


Hillery Hunter is an IBM Fellow and Director of the Accelerated Cognitive Infrastructure group at IBM’s T.J. Watson Research Center in Yorktown Heights, NY.

She is interested in cross-disciplinary technology topics, spanning silicon to system architecture to achieve new solutions to traditional problems. Her team currently pursues hardware-software co-optimization to take the wait time out of machine and deep learning problems. Her prior work was in the areas of DRAM main memory systems and embedded DRAM, and she gaine development experience serving as IBM’s server and mainframe DDR3-generation end-to-end memory power lead. In 2010, she was selected by the National Academy of Engineering for its Frontiers in Engineering Symposium, a recognition as one of the top young engineers in America.

Dr. Hunter received the Ph.D. degree in Electrical Engineering from the University of Illinois, Urbana-Champaign and is a member of the IBM Academy of Technology. Hillery was appointed as an IBM Fellow in 2017.

9:30a-10:10a Lightning talks — 20 talks (Virginia EF)
Chair: Zheng Zhang
10:10a-10:30a Break (Virginia Foyer) & Alibaba Talk (Allegheny)

New architectures
Chair: Josep Torrellas

In-MemoryData Parallel Processor

Daichi Fujiki (University of Michigan); Scott Mahlke (University of Michigan); Reetuparna Das (University of Michigan)

Hardware Multithreaded Transactions

Jordan Fix (Princeton University); Nayana P. Nagendra (Princeton University); Sotiris Apostolakis (Princeton University); Hansen Zhang (Princeton University); Sophie Qiu (Princeton University); David I. August (Princeton University)

Blasting Through The Front-End Bottleneck With Shotgun

Rakesh Kumar (Uppsala University, Sweden); Boris Grot (University of Edinburgh, UK); Vijay Nagarajan (University of Edinburgh, UK)

SlimNoC: A Low-Diameter On-Chip Network Topology for High Energy-Efficiency and Scalability

Maciej Besta (ETH Zurich); Syed Minhaj Hassan (Georgia Tech); Sudhakar Yalamanchili (Georgia Tech); Rachata Ausavarungnirun (CMU); Onur Mutlu (ETH Zurich); Torsten Hoefler (ETH Zurich)

Managed runtimes and dynamic translation
Chair: Lei Liu

Skyway: Connecting Managed Heaps in Distributed Big Data Systems

Khanh Nguyen (University of California, Irvine); Lu Fang (Facebook); Christian Navasca (University of California, Irvine);  Guoqing Harry Xu (University of California, Irvine); Brian Demsky (University of California, Irvine); Shan Lu (University of Chicago)

Espresso: Brewing Java For More Non-Volatility

Mingyu Wu (Shanghai Jiao Tong University); Ziming Zhao (Shanghai Jiao Tong University); Haoyu Li (Shanghai Jiao Tong University); Heting Li (Shanghai Jiao Tong University); Haibo Chen (Shanghai Jiao Tong University); Binyu Zang (Shanghai Jiao Tong University); Haibing Guan (Shanghai Jiao Tong University)

Enhancing Cross-ISA DBT Through Automatically Learned Translation Rules

Wenwen Wang (University of Minnesota at Twin Cities); Pen-Chung Yew (University of Minnesota at Twin Cities); Stephen McCamant (University of Minnesota at Twin Cities); Antonia Zhai (University of Minnesota at Twin Cities)

Gloss: Seamless Live Reconfiguration and Reoptimization of Stream Programs

Sumanaruban Rajadurai (National University of Singapore); Jeffrey Bosboom (MIT CSAIL); Weng-Fai Wong (National University of Singapore); Saman Amarasinghe (MIT CSAIL)

11:50a-1:00p Lunch (Virginia ABCD)

GPUs 1
Chair:Christopher J. Rossbach

Filtering Translation Bandwidth with Virtual Caching

Hongil Yoon (University of Wisconsin-Madison); Jason Lowe-Power (University of California, Davis); Gurindar S. Sohi (University of Wisconsin-Madison)

Automatic Hierarchical Parallelization of Linear Recurrences

Sepideh Maleki (Texas State University); Martin Burtscher (Texas State University)

Automatic matching of legacy code to heterogeneous APIs: An idiomatic approach

Philip Ginsbach (The University of Edinburgh); Toomas Remmelg (The University of Edinburgh); Michel Steuwer (University of Glasgow); Bruno Bodin (The University of Edinburgh); Christophe Dubach (The University of Edinburgh); Michael F. P. O’Boyle (The University of Edinburgh)

Performance management
Chair: James Larus

Understanding and Auto-Adjusting Performance-Sensitive Configurations

Shu Wang (University of Chicago); Chi Li (University of Chicago); William Sentosa (Bandung Institute of Technology); Henry Hoffmann (University of Chicago); Shan Lu (University of Chicago); Achmad Imam Kistijantoro (Bandung Institute of Technology)

SPECTR: Formal Supervisory Control and Coordination for Many-core Systems Resource Management

Amir M. Rahmani (University of California, Irvine and TU Wien); Bryan Donyanavard (University of California, Irvine); Tiago Mück (University of California, Irvine); Kasra Moazzemi (University of California, Irvine); Axel Jantsch (TU Wien); Onur Mutlu (ETH Zürich); Nikil Dutt (University of California, Irvine)

CALOREE: Learning Control for Predictable Latency and Low Energy

Nikita Mishra (University of Chicago); Connor Imes (University of Chicago); John D Lafferty (Yale); Henry Hoffmann (University of Chicago)

2:00p-2:20p Break (Virginia Foyer)

Programmable devices and co-processors
Chair: Satish Narayanasamy

Darwin: A Genomics Co-processor provides up to 15,000X acceleration on long read assembly

Yatish Turakhia (Stanford University); Gill Bejerano (Stanford University); William J. Dally (Stanford University)

Liquid Silicon: A Reconfigurable Memory-Oriented Computing Fabric with Scalable Multi-Context Support

Yue Zha (University of Wisconsin Madison); Jing Li (University of Wisconsin Madison)

Time Dilation and Contraction for Programmable Analog Devices with Jaunt

Sara Achour (MIT); Martin Rinard (MIT)

Mobile applications
Chair: Dongyoon Lee

Exploiting Dynamical Thermal Energy Harvesting for Reusing in Smartphone with Mobile Applications

Yuting Dai (College of Computer Science & Technology, Guizhou University); Tao Li (University of Florida); Benyong Liu (Guizhou University); Mingcong Song (University of Florida)

Static Detection of Event-based Races in Android Apps

Yongjian Hu (University of California, Riverside); Iulian Neamtiu (New Jersey Institute of Technology)

Potluck: Cross-application Approximate Deduplication for Computation-Intensive Mobile Applications

Peizhen Guo (Yale university); Wenjun Hu (Yale university)

3:20p-3:40p Break (Virginia Foyer) & Qualcomm Talk (Allegheny)
3:40p-5:30p Posters (Virginia ABCD) SRC talks (Piedmont until 4:40pm)
5:30p-7:00p Wild and crazy ideas (Virginia EF)

Chairs: Michael Carbin and Luis Ceze

After a brief hiatus in 2017, ASPLOS 2018 will present forward-looking, visionary, inspiring, far out, and just plain amazing ideas for its Wild and Crazy Ideas session. What we are aiming for is a session full of creativity presented in an exciting way.

WACI-note: Shyam Gollakota, Associate Professor at University of Washington, President of Jeeva Wireless Inc.

Title: “Internet Connectivity for the Next Billion Devices”


A grand challenge in computing has been to design interactive devices that can communicate, sense and compute without any batteries. I will present various harvesting and communication technologies that we introduced at UW over the past few years that can transform the way devices communicate with each other and open up possibilities for a whole range of new devices to be connecting ranging from battery-free phones to smart contact lens and even 3D printed plastic objects.


Shyam Gollakota is an Associate Professor of the Department of Computer Science & Engineering at the University of Washington where he leads the Networks and Mobile Systems Lab. He is also the President of Jeeva Wireless Inc. His research covers a range of topics, including computer networks, human-computer interaction, battery-free computing and mobile health. His work on ambient backscatter is being commercialized at Jeeva Wireless Inc. and ResMed Inc. has licensed his work on sleep apnea. He is the recipient of a 2015 National Science Foundation Career Award and an Alfred P. Sloan Fellowship. He was named as ACM SIGMOBILE Rockstar 2017, MIT Technology Review’s 35 Innovators Under 35, Popular Science 'brilliant 10', CNN’s Visionaries 2020 and twice to the Forbes’ 30 Under 30 list. His research has earned Best Paper awards at SIGCOMM, MOBICOM, NSDI and CHI and named as a MIT Technology Review Breakthrough technology of 2016 as well as Popular Science top innovations in 2015. He is an alumnus of MIT (Ph.D., 2013, winner of ACM doctoral dissertation award) and IIT Madras (2012).


How to Make Driving Awesome
Miguel Arroyo and Simha Sethumadhavan

Puddle: An Operating System for Reliable, High-Level Programming of Digital Microfluidic Devices
Max Willsey, Luis Ceze, and Karin Strauss

The Living Neuron Machine
Yuan Zeng, Zubayer Ibne Ferdous, Xiaochen Guo, Yevgeny Berdichevsky, and Zhiyuan Yan

F2P: Free to Program
Christian DeLozier

Migratory Trash Clouds
Emily Ruppel, Alexei Colin, and Brandon Lucia

WACI Test-of-Time Talk

To be annouced!

7:00p-8:00p Business meeting (Virginia EF)
8:00p- End of day

3/27  (Tuesday)

Session 1 — Virginia EF Session 2 — Piedmont Room
7a-8:30a Breakfast (Virginia ABCD)

Keynote 2 (Virginia EF): Fred Chong, Seymour Goodman Professor of Computer Architecture,
University of Chicago

Title: “Quantum Computing is Getting Real: Architecture, PL, and OS roles in Closing the Gap between Quantum Algorithms and Machines”


Quantum computing is at an inflection point, where 50-qubit (quantum bit) machines have been built, 100-qubit machines are just around the corner, and even 1000-qubit machines are perhaps only a few years away.  These machines have the potential to fundamentally change our concept of what is computable and demonstrate practical applications in areas such as quantum chemistry, optimization, and quantum simulation.

Yet a significant resource gap remains between practical quantum algorithms and real machines.  There is an urgent shortage of the necessary computer scientists to work on software and architectures to close this gap.

I will outline several grand research challenges in closing this gap, including programming language design, software and hardware verification, defining and perforating abstraction boundaries, cross-layer optimization, managing parallelism and communication, mapping and scheduling computations, reducing control complexity, machine-specific optimizations, learning error patterns, and many more. I will also describe the resources and infrastructure available for starting research in quantum computing and for tackling these challenges.


Fred Chong is the Seymour Goodman Professor in the Department of Computer Science at the University of Chicago. He is also Lead Principal Investigator for the EPiQC Project (Enabling Practical-scale Quantum Computing), an NSF Expedition in Computing. Chong received his Ph.D. from MIT in 1996 and was a faculty member and Chancellor’s fellow at UC Davis from 1997-2005. He was also a Professor of Computer Science, Director of Computer Engineering, and Director of the Greenscale Center for Energy-Efficient Computing at UCSB from 2005-2015. He is a recipient of the NSF CAREER award and 6 best paper awards. His research interests include emerging technologies for computing, quantum computing, multicore and embedded architectures, computer security, and sustainable computing.


9:30a-10:10a Lightning talks –20 talks (Virginia EF)
Chair: Zheng Zhang
10:10a-10:30a Break (Virginia Foyer)

Memory 1
Chair: Dan Tsafrir

SOFRITAS: Serializable Ordering-Free Regions for Increasing Thread Atomicity Scalably

Christian DeLozier (University of Pennsylvania); Ariel Eizenberg (University of Pennsylvania); Brandon Lucia (Carnegie Mellon University); Joseph Devietti (University of Pennsylvania)

DAMN: Overhead-Free IOMMU Protection for Networking

Alex Markuze (Technion); Igor Smolyar (Technion); Adam Morrison (Tel Aviv University); Dan Tsafrir (Technion & VMware Research)

Processing In-Memory for Google Consumer Workloads

Amirali Boroumand (Carnegie Mellon University); Saughata Ghose (Carnegie Mellon University); Youngsok Kim (Seoul National University); Rachata Ausavarungnirun (Carnegie Mellon University); Rahul Thakur (Google); Eric Shiu (Google); Allan Knies (Google); Aki Kuusela (Google); Daehyun Kim (Google); Parthasarathy Ranganathan (Google); Onur Mutlu (ETH Zurich, Carnegie Mellon University)

Watching for Software Inefficiencies with WITCH

Shasha Wen (College of William and Mary); Xu Liu (College of William and Mary); John Byrne (Hewlett Packard Labs); Milind Chabbi (Hewlett Packard Labs)

Program analysis
Chair: Shan Lu

Optimistic Hybrid Analysis: Accelerating Dynamic Analysis through Predicated Static Analysis

David Devecsery (University of Michigan); Peter M. Chen (University of Michigan); Satish Narayanasamy (University of Michigan); Jason Flinn (University of Michigan)

Statistical Reconstruction of Class Hierarchies in Binaries

Omer Katz (Technion); Noam Rinetzky (Tel Aviv University); Eran Yahav (Technion)

Sulong, and Thanks For All the Bugs: Finding Errors in C Programs by Abstracting from the Native Execution Model

Manuel Rigger (Johannes Kepler University Linz, Austria) ; Roland Schatz (Oracle Labs, Austria); Rene Mayrhofer (Johannes Kepler University Linz, Austria); Matthias Grimmer (Oracle Labs, Austria); Hanspeter Mössenböck (Johannes Kepler University Linz, Austria)

FirmUp: Precise Static Detection of Common Vulnerabilities in Firmware

Yaniv David (Technion); Nimrod Partush (Technion); Eran Yahav (Technion)

11:50a-1:00p Lunch (Virginia ABCD)

Concurrency and parallelism
Chair: Hank Hoffmann

Frightening small children and disconcerting grown-ups: Concurrency in the Linux kernel

Jade Alglave (University College London); Luc Maranget (INRIA); Paul E. McKenney (IBM Corporation); Andrea Parri (Scuola Superiore Sant’Anna); Alan Stern (Harvard University)

FCatch: Automatically detecting time-of-fault bugs in cloud systems

Haopeng Liu (University of Chicago); Xu Wang (Beihang University); Guangpu Li (University of Chicago); Shan Lu (University of Chicago); Feng Ye (Huawei US R&D Center); Chen Tian (Huawei US R&D Center)

Unconventional Parallelization of Nondeterministic Applications

Enrico Armenio Deiana (Northwestern University); Vincent St-Amour (Northwestern University); Peter Dinda (Northwestern University); Nikos Hardavellas (Northwestern University); Simone Campanoni (Northwestern University)


Neural networks
Chair: Adrian Sampson

Bridging the Gap Between Neural Networks and Neuromorphic Hardware with A Neural Network Compiler

Yu Ji (Tsinghua University); YouHui Zhang (Tsinghua University); WenGuang Chen (Tsinghua University); Yuan Xie (UCSB)

MAERI: Enabling Flexible Dataflow Mapping over DNN Accelerators via Reconfigurable Interconnects

Hyoukjun Kwon (Georgia Institute of Technology); Ananda Samajdar (Georgia Institute of Technology); Tushar Krishna (Georgia Institute of Technology)

VIBNN: Hardware Acceleration of Bayesian Neural Networks

Ruizhe Cai (Syracuse University); Ao Ren (Syracuse University); Ning Liu (Syracuse University); Caiwen Ding (Syracuse University); Luhao Wang (University of Southern California); Xuehai Qian (University of Southern California); Massoud Pedram (University of Southern California); Yanzhi Wang (Syracuse University)


Chair: Jayneel Gandhi

LTRF: A Latency Tolerant Register File Architecture for GPUs

Mohammad Sadrosadati (ETH Zurich, Sharif University of Technology); Amirhossein Mirhosseini (University of Michigan); Borna Ehsani (Karlsruhe Institute of Technology, Sharif University of Technology); Hamid Sarbazi-Azad (Sharif University of Technology, IPM); Mario Paulo Drumond (EPFL); Babak Falsafi (EPFL); Rachata Ausavarungnirun (CMU); Onur Mutlu (ETH Zurich, CMU)

Redesigning the GPU Memory Hierarchy to Support Multi-Application Concurrency

Rachata Ausavarungnirun (Carnegie Mellon University); Vance Miller (UT Austin); Joshua Landgraf (UT Austin); Saugata Ghose (Carnegie Mellon University); Jayneel Gandhi (VMware Research Group); Adwait Jog (College of William and Mary); Chris Rossbach (UT Austin and VMware Research Group); Onur Mutlu (ETH Zurich and Carnegie Mellon University)

Sugar: Secure GPU Acceleration in Web Browsers

Zhihao Yao (UC Irvine); Zongheng Ma (UC Irvine); Ardalan Amiri Sani (UC Irvine); Aparna Chandramowlishwaran (UC Irvine)

Chair: John Carter

SmoothOperator: Combating Power Fragmentation and Improving Power Utilization in Large-scale Datacenters

Chang-Hong Hsu (University of Michigan, Ann Arbor); Qingyuan Deng (Facebook, Inc.); Jason Mars (University of Michigan, Ann Arbor); Lingjia Tang (University of Michigan, Ann Arbor)

WSMeter: A Performance Evaluation Methodology for Google’s Production Warehouse-Scale Computers

Jaewon Lee (Seoul National University)
Changkyu Kim (Google)
Kun Lin (Google)
Liqun Cheng (Google)
Rama Govindaraju (Google)
Jangwoo Kim (Seoul National University)

DAC: Data-Aware Auto-Tuning High Dimensional Configurations of In-memory Cluster Computing

Zhibin Yu (Shenzhen Institute of Advanced Technology, Chinese Academy of Science); Zhendong Bei (Shenzhen Institute of Advanced Technology, Chinese Academy of Science); Xuehai Qian (University of Southern California)

3:00p-7:00p Excursion
7:00p-9:00p Banquet with Dean Shostak’s Crystal Concert (Virginia ABCD)
9:00p- End of day

3/28 (Wednesday)

Session 1 — Virginia EF Session 2 — Piedmont Room
7a-8:30a Breakfast (Virginia ABCD)
8:30a-9:00a Lightning talks — 16 talks (Virginia EF)
Chair: Zheng Zhang

Irregular apps and graphs
Chair: Martha Kim

An Event-Triggered Programmable Prefetcher for Irregular Workloads

Sam Ainsworth (University of Cambridge); Timothy M. Jones (University of Cambridge)

Minnow: Lightweight Offload Engines for Worklist Management and Worklist-Directed Prefetching

Dan Zhang (The University of Texas at Austin); Xiaoyu Ma (Google); Michael Thomson (The University of Texas at Austin); Derek Chiou (Microsoft)

Wonderland: A Novel Abstraction-Based Out-Of-Core Graph Processing System

Mingxing Zhang (Tsinghua University); Yongwei Wu (Tsinghua University); Youwei Zhuo (University of Southern California); Xuehai Qian (University of Southern California); Chenyin Huan (Tsinghua University); Kang Chen (Tsinghua University)

Transforming Irregular Graphs for GPU-Friendly Graph Processing

Amir Sabet (University of California, Riverside); Junqiao Qiu (University of California, Riverside); Zhijia Zhao (University of California, Riverside)


Memory 2
Chair: Steve Blackburn

Devirtualizing virtual memory for heterogeneous systems

Swapnil Haria (University of Wisconsin-Madison); Mark D. Hill (University of Wisconsin-Madison); Mike M. Swift (University of Wisconsin-Madison)

LATR: Lazy Translation Coherence

Mohan Kumar (Georgia Institute of Technology); Steffen Maass (Georgia Institute of Technology); Sanidhya Kashyap (Georgia Institute of Technology); Jan Vesely (Rutgers University); Zi Yan (Rutgers University); Taesoo Kim (Georgia Institute of Technology); Abhishek Bhattacharjee (Rutgers University); Tushar Krishna (Georgia Institute of Technology)

Reducing Paging Overheads in SGX with Efficient Integrity Verification Structures

Meysam Taassori (University of Utah); Ali shafiee (University of Utah); Rajeev Balasubramonian (University of Utah)

Making Huge Pages Actually Useful

Ashish Panwar (Indian Institute of Science); Aravinda Prasad (Indian Institute of Science); K Gopinath (Indian Institute of Science)


10:20a-10:40a Break (Virginia Foyer)

Security and protection
Chair: Mohit Tiwari

BranchScope: A New Side-Channel Attack on Directional Branch Predictor

Dmitry Evtyushkin (College of William and Mary); Ryan Riley (CMU Qatar); Nael Abu-Ghazaleh (UC Riverside); Dmitry Ponomarev (Binghamton University)

StrongBox: Confidentiality, Integrity, and Performance using Stream Ciphers for Full Drive Encryption

Bernard Dickens III (University of Chicago); Haryadi S. Gunawi (University of Chicago); Ariel J. Feldman (University of Chicago); Henry Hoffmann (University of Chicago)

DATS – Refactoring Access Control Out of Web Applications

Lluis Vilanova (Technion); Casen Hunger (UT Austin); Charalampos Papamanthou (UMD); Yoav Etsion (Technion); Mohit Tiwari (UT Austin)

DLibOS: Performance and Protection with a Network-on-Chip

Stephen Mallon (University of Sydney); Vincent Gramoli (University of Sydney/Data61-CSIRO); Guillaume Jourjon (Data61-CSIRO)


Chair: Yan Solihin

The Architectural Implications of Autonomous Driving: Constraints and Acceleration

Shih-Chieh Lin (University of Michigan, Ann Arbor); Yunqi Zhang (University of Michigan, Ann Arbor); Chang-Hong Hsu (University of Michigan, Ann Arbor); Matt Skach (University of Michigan, Ann Arbor); Md E. Haque (University of Michigan, Ann Arbor); Lingjia Tang (University of Michigan, Ann Arbor); Jason Mars (University of Michigan, Ann Arbor)

A Reconfigurable Energy Storage Architecture for Energy-harvesting Devices

Alexei Colin (Carnegie Mellon University); Emily Ruppel (Carnegie Mellon University); Brandon Lucia (Carnegie Mellon University)

NEOFog: Nonvolatility-Exploiting Optimizations for Fog Computing

Kaisheng Ma (Penn State); Jinyang Li (Tsinghua University); Tongda Wu (Tsinghua University); Zhibo Wang (Tsinghua University); Xueqing Li (Penn State); Yongpan Liu (Tsinghua University); Yuan Xie (UCSB); Mahmut Taylan Kandemir (Penn State); Jack Sampson (Penn State); Vijaykrishnan Narayanan (Penn State)

vbench: Benchmarking Video Transcoding in the Cloud

Andrea Lottarini (Columbia University); Alex Ramirez (Google Inc.); Joel Coburn (Google Inc.); Martha A. Kim (Columbia University); Parthasarathy Ranganathan (Google Inc.); Daniel Stodolsky (Google Inc.); Mark Wachsler (Google Inc.)

12:00p-12:10p Closing remarks by Xipeng Shen Closing remarks by James Tuck
12:10p- End of conference


Organization Committee

General Chairs Xipeng Shen North Carolina State University
  James Tuck North Carolina State University
Program Chairs Ricardo Bianchini Microsoft Research
  Vivek Sarkar Georgia Institute of Technology
Local Arrangements Chair Adwait Jog College of William and Mary
  Xu Liu College of William and Mary
Finance Guoliang Jin North Carolina State University
Workshop & Tutorial Rajiv Gupta University of California, Riverside
  Zhijia Zhao University of California, Riverside
Travel Grant John Criswell University of Rochester
  Ulya Karpuzcu University of Minnesota
ACM SRC and Posters Shuaiwen (Leon) Song Pacific Nortwest National Lab.
  Yufei Ding University of California, Santa Barbara
Wild and Crazy Ideas Michael Carbin Massachusetts Institute of Technology
  Luis Ceze University of Washington
Lightning Session Zheng Zhang Rutgers University
Registration Ardalan Amiri Sani University of California, Irvine
  Jun Yang University of Pittsburgh
Publicity Boris Grot University of Edinburgh
  Gennady Pekhimenko Microsoft Research and University of Toronto
  Jidong Zhai Tsinghua University, China
  Hyesoon Kim Georgia Tech
Submission Bo Wu Colorado School of Mines
Web Xuehai Qian University of Southern California
  Hung-Wei Tseng North Carolina State University
Sponsor Yungang Bao Chinese Academy of Sciences
  Rudolf Eigenmann Purdue University
  Grigori Fursin Dividiti Co.
  Robert Hundt Google
Publication Felix Xiaozhu Lin Purdue University
  George Patsilaras Qualcomm Co.

Program Committee

Yungang Bao China ICT
Rajkishore Barik Intel Labs
Andrew Baumann Microsoft Research
Abhishek  Bhattacharjee Rutgers University
Ricardo Bianchini Microsoft Research
Uday Bondhugula Indian Institute of Science
Adrian Caulfield Microsoft Research
Luis Ceze University of Washington
Rong Chen Shanghai Jiao Tong University
Fred Chong University of Chicago
Christina Delimitrou Cornell University
Chen Ding University of Rochester
Natalie Enright Jerger University of Toronto
Phillip Gibbons Carnegie Mellon University
David Grove IBM Research
Rajiv Gupta University of California at Riverside
Tim Harris Oracle
Hank Hoffman University of Chicago
Trent Jaeger Penn State University
Mahmut Kandemir Penn State University
Kim Keeton Hewlett-Packard Enterprise
Martha Kim Columbia University
Seyong Lee Oak Ridge National Lab
Xu Liu College of William & Mary
Jean-Pierre Lozi University of Nice Sophia Antipolis
Shan Lu University of Chicago
Scott Mahlke University of Michigan at Ann Arbor
Kathryn S. McKinley Google
Satish Narayanasamy University of Michigan at Ann Arbor
David Nellans Nvidia
Jason Nieh Columbia University
Santosh Pande Georgia Tech
Keshav Pingali University of Texas at Austin
Vivien Quema Grenoble INP
Vijay Reddi University of Texas at Austin
Christopher J. Rossbach University of Texas at Austin and VMware Research Group
Karu Sankaralingam University of Wisconsin at Madison
Vivek Sarkar Georgia Tech
Kai Shen Google
Arrvindh Shriraman Simon-Fraser University
Mark Silberstein Technion
Armando Solar-Lezama Massachusetts Institute of Technology
Yan Solihin North Carolina State University
Karin Strauss Microsoft Research
Jeff Stuecheli IBM
Michael Swift University of Wisconsin at Madison
Lingjia Tang University of Michigan at Ann Arbor
Mohit Tiwari University of Texas at Austin
Dan Tsafrir Technion and VMware Research Group
Haris Volos Hewlett-Packard Enterprise
Thomas Wenisch University of Michigan at Ann Arbor
Yiying Zhang Purdue University

External Review Committee

David August Princeton University
Rajeev Balasubramonian University of Utah
Christopher Batten Cornell University
Suparna Bhattacharya Hewlett-Packard Enterprise
Steve Blackburn Australian National University
Michael Bond Ohio State University
John Carter IBM Research
Brad Chamberlain Cray
Evan Chang University of Colorado at Boulder
Wenguang Chen Tsinghua University
Yunji Chen ICT-Chinese Academy of Sciences
John Criswell University of Rochester
Chita Das Penn  State University
Reetuparna Das University of Michigan at Ann Arbor
Qingyuan Deng Facebook
Mattan Erez University of Texas at Austin
Michael Factor IBM Research
Sasha Fedorova University of British Columbia
Jayneel Gandhi VMware Research Group
Ada Gavrilovska Georgia Tech
Soumyadeep Ghosh Barefoot Networks
Inigo Goiri Microsoft Research
Ganesh  Golapakrishnan University of Utah
K. Gopinath Indian Institute of Science (IISc)
Boris Grot University of Edinburgh
Qi Guo ICT-Chinese Academy of Sciences
Steven Hand Google
Akihiro Hayashi Rice University
Matthew Hicks Virginia Tech
Yu Hua Huazhong University of Science and Technology
Jeff Huang Texas A&M University
Wen-mei Hwu University of Illinois at Urbana-Champaign
Samira Kahn University of Virginia
Baris Kasikci University of Michigan at Ann Arbor
Jangwoo Kim Seoul National University
Uli Kremer Rutgers University
Orran Krieger Boston University
James Larus EPFL
Julia Lawall INRIA
Doug Lea SUNY Oswego
Ben Lee Duke University
Dongyoon Lee Virginia Tech
Chao Li Qualcomm
Cong Liu University of Texas at Dallas
Lei Liu ICT-Chinese Academy of Sciences
Andrew Lumsdaine Indiana University and PNNL
Daniel Lustig Nvidia
Virendra Marathe Oracle
Madan Musuvathi Microsoft Research
Onur Mutlu ETH Zurich
Santosh Nagarakatte Rutgers University
Thu D. Nguyen Rutgers University
Li-Shiuan Peh National University of Singapore
Don Porter University of North Carolina at Chapel Hill
Louis-Noel Pouchet Colorado State University
Shaz Qadeer Microsoft Research
Xuehai Qian University of Southern California
John Regehr University of Utah
Steve  Reinhardt Microsoft
Martin Rinard Massachusetts Institute of Technology
Amitabha Roy Intel Labs
Adrian Sampson Cornell University
Joshua San Miguel University of Toronto
Jennifer Sartor Vrije Universiteit Brussel
Koushik Sen University of California at Berkeley
Tim Sherwood University of California at Santa Barbara
Anand Sivasubramaniam Penn State University
Josep Torrellas University of Illinois at Urbana-Champaign
David Wentzlaff Princeton University
Guoqing (Harry) Xu University of California at Irvine
Ding Yuan University of Toronto
Antonia Zhai University of Minnesota

Steering Committee:

Sarita Adve University of Illinois at Urbana-Champaign, USA
John Carter IBM, USA
Yunji Chen ICT-Chinese Academy of Sciences, China
Tom Conte Georgia Institute of Technology, USA
Sandhya Dwarkadas University of Rochester, USA
Kemal Ebcioglu Global Supercomputing, USA
Shan Lu University of Chicago, USA
Ozcan Ozturk Bilkent University, Turkey
Olivier Temam Google, France
Peter Thiemann University of Freiburg, Germany
David Wood University of Wisconsin, Madison, USA
Yuanyuan Zhou UCSD, USA