Call for Contributions

Call for papers

Workshops:
12th Workshop on General Purpose Processing Using GPU (GPGPU 2019) @ ASPLOS 2019
web link

Organizers
========================================
Adwait Jog (co-chair), College of William & Mary (Email: adwait@cs.wm.edu)
Onur Kayiran (co-chair), AMD Research (Email: onur.kayiran@amd.com )
Ashutosh Pattnaik (submission/web chair), Penn State
Overview
========================================
The goal of this workshop is to provide a forum to discuss new and
emerging general-purpose programming architectures, environments, and platforms, as well as evaluate applications that have been able to harness the horsepower provided by these platforms. This year’s workshop is particularly interested in security, new heterogeneous architecture or platforms, new forms of concurrency, and novel or irregular applications that can leverage these platforms. Papers are being sought on many aspects of GPUs or accelerators, including (but not limited to):
GPU applications
GPU programming environments
GPU runtime systems
GPU compilation
GPU architectures
Multi-GPU systems
GPU power/efficiency
GPU reliability
GPU benchmarking/measurements
Heterogeneous architectures/platforms
GPU security (NEW)
Non-von Neumann architectures (NEW)
Domain-specific architectures (NEW)
Important Dates
========================================
Papers due: February 11, 2019 (extended deadline!)
Notification: March 11, 2019
Final paper due: March 25, 2019
Workshop Date: April 13, 2019
Keynotes
========================================
This GPGPU workshop will have keynotes from Nael Abu-Ghazaleh, UC Riverside and Xipeng Shen, NCSU. More details will be available on the workshop website.
Program Committee
========================================
Anthony Gutierrez, AMD Research
Arkaprava Basu, IISc
Asit Mishra, NVIDIA
Bin Ren, William & Mary
Biswabandan Panda, IIT Kanpur
Daniel Wong, UCR
David Kaeli, Northeastern
Evgeny Bolotin, NVIDIA
Hyeran Jeon, SJSU
John Kim, KAIST University
Kapil Vaswani, MSR, India
Mark Silberstein, Technion
Martin Burtscher, Texas State
Minsoo Rhu, KAIST University
Nandita Vijaykumar, CMU
Rachata Ausavarungnirun, CMU
Sonia Lopez Alarcon, RIT
Sooraj Puthoor, AMD Research
Sreepathi Pai, Rochester
Tao Li, University of Florida
Tim Rogers, Purdue Univ.
Trevor Carlson, NUS Singapore
Xin Fu, Univ. of Houston
Yash Ukidave, AMD
History and Impact
========================================
David Kaeli (Northeastern) and John Cavazos (Delaware) very
successfully organized the previous versions of this GPGPU workshop,
which was first held in 2007 at Northeastern University. In 2008, the
workshop was held with ASPLOS 2008. This trend continued and this
GPGPU workshop was held with ASPLOS for the next 6 years. From 2015 to
2018, GPGPU workshop was co-located with PPoPP. GPGPU 2019 workshop
returns to ASPLOS. The average citation count (as per Google Scholar),
for a GPGPU workshop paper, is currently 37.5, where there have been 8
influential papers with 100+ citations.

Submission
========================================
Available here:https://insight-archlab.github.io/gpgpu.html
Questions?
========================================

Please contact the organizers if you have any questions. The latest

information will be always available here:
https://insight-archlab.github.io/gpgpu.html

Main conference:

24th International Conference on Architectural Support for  Programming Languages and Operating Systems

PDF Version

Abstract submissions    July 31, 2018
Full paper submissions  Aug 7, 2018
Author response               Oct 17-19, 2018
Notification                           Nov 7, 2018
Final copy deadline          Jan 14, 2019

ASPLOS is the premier forum for multidisciplinary systems research spanning computer architecture and hardware, programming languages and compilers, operating systems and networking. ASPLOS 2019 will be held in Providence, Rhode Island, a city rich in colonial period neighborhoods, interesting architecture, and home to Brown University and the Rhode Island School of Design (RISD). Like its predecessors, ASPLOS 2019 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-2019, which will take place in Providence, RI. Tutorials will be held on April 13, 2019 (Saturday) and April 14, 2019 (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:
Title.
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 Ulya Karpuzcu   (ukarpuzc@umn.edu ) and Paul Gratz (pgratz@tamu.edu) with the subject “ASPLOS2019 Tutorial Proposal”. Submissions will be acknowledged via e-mail.

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

Call for Workshop Proposals

Workshop and tutorial proposals are solicited for ASPLOS-201, Providence, RI. Workshops will be held on April 13, 2019 (Saturday) and April 14, 2019 (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 Ulya Karpuzcu   (ukarpuzc@umn.edu ) and Paul Gratz (pgratz@tamu.edu) with the subject “ASPLOS2019 Workshop Proposal”. Submissions will be acknowledged via e-mail.
Feel free to contact Ulya and Paul 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, 2018
Notification:Monday, November 24th 2018


Call for Student Research Competition (SRC)

PDF Version

ACM Student Research Competition

Important Dates

Abstract submission: 11:59pm PST Friday, December 14, 2018.  

(NEW:  Extended deadline:  11 :59pm PST Friday, December 21, 2018)

Acceptance notification: 11:59pm PST Friday, Feb 8, 2019.

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.

Overview

The 24th 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 2019 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.

Eligibility

      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.

    • 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 21th, 2018 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 21th, 2018.

    • 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 www.acm.org/membership.

  • Team projects will be accepted from Undergraduates. One person should be designated by the team to make the oral presentation. Only individual research is accepted from Graduate (Masters or Ph.D. program) students: group research projects will not be considered. However, if an individual is part of a group research project and wants to participate in an SRC, they can only present their part of the research. Only they will receive the travel stipend and monetary award (should they win).

SRC Chairs

Yufei Ding and Linhai Song

SRC Committee

Ryan Huang, Johns Hopkins University
Felix Xiaozhu Lin, Purdue University
Dongyoon Lee, Virginia Tech
Changhee Jung, Virginia Tech
Daniel Wong, University of California, Riverside
Yanzhi Wang, Northeastern University
Yanjing Li, University of Chicago
Ashish Venkat, University of Virginia
John Criswell, University of Rochester
Zhijia Zhao, University of California, Riverside
Jun Xu Stevens, Institute of Technology
Jishen Zhao, University of California, San Diego

Submission Information

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

https://asplos19src.hotcrp.com/

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


Call for WACI

ASPLOS 2019 “Wild and Crazy Ideas” (WACI) is seeking submissions on forward-looking, visionary, and currently under-represented research topics that fall under the ASPLOS umbrella.  Submissions should strive to make ASPLOS attendees think about things that our community is not, but should be thinking about today; a submission could identify and address an emerging area or a long-standing open question that needs another look.  As part of ASPLOS’s interdisciplinary culture, WACI continues to have a strong preference for work that cuts across the traditional boundaries of Programming Languages, Operating Systems, and Computer Architecture research. If you are unsure whether a topic relates to WACI, contact the organizers by email.

A WACI submission should be an earnest investigation into an important research topic area and we are not inviting comedy submissions, as have featured prominently in some past incarnations of WACI.


Submission instructions:

Your submission should be a 2-page extended abstract in the sigplanconf format. You may alternatively submit a 1-page extended abstract supplemented by a link to a Youtube video up to two minutes in length.

For either submission format, if accepted for inclusion in the WACI program, an author of your submission must be able to attend the conference and be prepared to give a 6-minute presentation.

Submit your paper via HotCRP at https://asplos19waci.hotcrp.com/.  The deadline for submissions is 5pm PST on Friday February 15th.

Organizers:

Brandon Lucia (Carnegie Mellon University, blucia@andrew.cmu.edu)

Tim Sherwood (Univ. of California Santa Barbara, sherwood@cs.ucsb.edu).


Submissions

ASPLOS 2019

24th ACM International Conference on Architectural Support for Programming Languages and Operating Systems
Providence, RI, U.S.A, April 13-17, 2019

This document provides instructions for submitting papers to the 24th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2019. 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 2019 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’19 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:
Jul 31, 2018 (4:59:59pm US eastern time)

Full paper submission deadline:
Aug 7, 2018 (4:59:59pm US eastern time)

Highlights:

  • 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 prepare a summary video (in lieu of a lightning talk) 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

Content

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’19, 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 arxiv.org, are not considered prior publications either. In these cases, the submitted manuscript may
ignore the posted work to preserve author anonymity.   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’19 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 (http://www.acm.org/publications/policies/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’19 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.

Acknowledgements

Several ideas in this document and parts of the text have been taken from previous conferences, so we thank their program chairs.  In particular, Ricardo Bianchini and Vivek Sarkar (ASPLOS ’18), 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.

PROGRAM

Tutorials, Workshops and VEE

VEE 2019: https://conf.researchr.org/home/vee-2019

4/13 (Saturday)


Time Garden Room Renaissance Salon 2 Salon 6
7:00a-8:30a Breakfast (Room TBD)
8:30a-12:00p
Tutorial
Infrastructure and Methodology for SoC-level Performance and Power Modeling
Workshop
Workshop on Datacenter Resource Disaggregation
Workshop
Workshop on General Purpose Processing using GPU
Tutorial
Practical Aspects of Building a Software Stack for Noisy Intermediate-Scale Quantum Devices
12:00p-1:30p Lunch (Provided) @ Room TBD
1:30p-6:00p
Tutorial
Developing Next-Generation Embedded Multi-Core Systems with the Functional Reactive Programming Paradigm
Workshop
Workshop on Datacenter Resource Disaggregation
Workshop
Workshop on General Purpose Processing using GPU
Tutorial
Practical Aspects of Building a Software Stack for Noisy Intermediate-Scale Quantum Devices

4/14 (Sunday)

Time Garden Room Renaissance Salon 2 Salon 6
7:00a-8:30a Breakfast (Room TBD)
8:30a-12:00p
Tutorial
Principles of Secure Processor Architecture Design
Tutorial
Programming Novel Architectures in the Post-Moore Era with the Rogues Gallery
Workshop
Unlocking the Power of Edge Computing
Tutorial
Programming Quantum Computers: A Primer with IBM Q and D-Wave Exercises
12:00p-1:30p Lunch (Provided) @ Room TBD
1:30p-6:00p
Workshop
NOPE: Workshop for Negative Outcomes, Postmortems and Experiences
Tutorial
Writing Compiler Passes with LLVM
Workshop
Unlocking the Power of Edge Computing
Tutorial
Programming Quantum Computers: A Primer with IBM Q and D-Wave Exercises
6:00p- Brown Universtiy: opening reception & SRC Posters

Session Overview

4/15 (Monday)

Time Session 1 Session 2
7:00a-8:15a Breakfast (Room TBD)
8:15a-8:30a Chairs’ opening remarks and awards (Room TBD)
8:30a-9:30a Keynote
9:30a-10:00a Break (Room TBD)
10:00a-11:00a
Cloud A
Data Movement A
11:00a-11:30a Break (Room TBD)
11:30a-12:30p
Cloud B
Data Movement II
12:30p-2:00p Lunch/Panel @ Room TBD
2:00p-3:00p
Emerging Paradigms
Memory Systems
 3:00p-3:30p Break (Room TBD)
3:30p-4:30p
Potpourri
VM/Memory
4:30p-6:00p Poster session (location)

4/16 (Tuesday)

Time Session 1 Session 2
7:00a-8:30a Breakfast (Room TBD)
8:30a-9:30a Keynote
9:30a-10:00a Break (Room TBD)
10:00a-11:00a
Security I
Persistent Memory
11:00a-11:30a Break (Room TBD)
11:30a-12:30p
Security II
Accelerators
12:30p-2:00p Lunch @ Room TBD
2:00p-3:00p
Security III
Graph Processing
 3:00p-3:30p Break (Room TBD)
3:30p-4:30p
Secure Memory
Microarchitecture
4:30p-5:30p WACI
5:30p-5:45p Walk to RISD
5:45p-8:30p RISD museum outing with banquet

4/17 (Wednesday)

Time Session 1 Session 2
7:00a-8:30a Breakfast (Room TBD)
8:30a-9:30a
Machine Learning I
Synchronization
9:30a-10:00a Break (Room TBD)
10:00a-11:00a
Machine Learning II
Concurrency
11:00a-11:30a Break (Room TBD)
11:30a-12:30p
Machine Learning III
Storage Systems
12:30p-2:00p Lunch @ Room TBD
2:00p-3:30p
Quantum Computing
Tools & Methods
 3:30p- Closing

Main Conference

4/15 (Monday)

Time Session 1 Session 2
7:00a-8:15a Breakfast (Room TBD)
8:15a-8:30a Chairs’ opening remarks and awards (Room TBD)
8:30a-9:30a Keynote
9:30a-10:00a Break (Room TBD)
10:00a-11:00a
Cloud A

An Open-Source Benchmark Suite for Microservices and Their Hardware-Software Implications for Cloud and Edge Systems

Yu Gan, Yanqi Zhang, Dailun Cheng, Ankitha Shetty, Priyal Rathi, Nayantara Katarki, Ariana Bruno, Justin Hu, Brian Ritchken, Brendon Jackson, Kelvin He, Meghna Pancholi, Brett Clancy, Christopher Colen, Fukang Wen, Catherine Leung, Siyuan Wang, Leon Zaruvinsky, Mateo Espinosa, Yuan He, Christina Delimitrou (Cornell University)

Seer: Leveraging Big Data to Navigate the Complexity of Performance Debugging in Cloud Microservices

Yu Gan, Yanqi Zhang, Siyuan Hu, Yuan He, Meghna Pancholi, Dailun Cheng, Christina Delimitrou (Cornell University)

RPCValet: NI-Driven Tail-Aware Balancing of u-scale RPCs

Alexandros Daglis, Mark Sutherland, Babak Falsafi (EPFL)

Data Movement A

A Framework for Memory Oversubscription Management in Graphics Processing Units

Chen Li (National University of Defense Technology, University of Pittsburgh);Rachata Ausavarungnirun (Carnegie Mellon University, King Mongkut’s University of Technology North Bangkok);Christopher J. Rossbach (University of Texas Austin, VMware Research);Youtao Zhang (University of Pittsburgh);Onur Mutlu (ETH Zurich);Yang Guo (National University of Defense Technology);Jun Yang (University of Pittsburgh)

Swizzle Inventor: Data Movement Synthesis for GPU Kernels

Phitchaya Mangpo Phothilimthana (University of California, Berkeley);Archibald Samuel Elliott (University of Washington);Abhinav Jangda (University of Massachusetts Amherst);Bastian Hagedorn (University of Münster);Henrik Barthels (AICES, RWTH Aachen University);Rastislav Bodik (University of Washington);Vinod Grover (NVIDIA)

Scalable Processing of Contemporary Semi-Structured Data on Commodity Parallel Processors — A Compilation-based Approach

Lin Jiang, Xiaofan Sun, Umar Farooq, Zhijia Zhao (University of California, Riverside)

11:00a-11:30a Break (Room TBD)
11:30a-12:30p
Cloud B

Fast and Scalable VMM Live Upgrade in Large Cloud Infrastructure

Xiantao Zhang, Xiao Zheng (Alibaba group);Zhi Wang (Florida State University);Qi Li (Tsinghua University);Junkang Fu, Yang Zhang, Yibin Shen (Alibaba group)

PARTIES: QoS-Aware Resource Partitioning for Multiple Interactive Services

Shuang Chen, Christina Delimitrou, José F. Martínez (Cornell University)

X-Containers: Breaking Down Barriers to Improve Performance and Isolation of Cloud-Native Containers

Zhiming Shen, Zhen Sun, Gur-Eyal Sela, Eugene Bagdasaryan, Christina Delimitrou, Robbert Van Renesse, Hakim Weatherspoon (Cornell University)

Data Movement II

Buffets: An Efficient and Composable Storage Idiom for Explicit Decoupled Data Orchestration

Michael Pellauer, Yakun Sophia Shao, Jason Clemons, Neal Crago (Nvidia);Kartik Hegde (UIUC);Rangarajan Venkatesan, Stephen W. Keckler (Nvidia);Christopher W Fletcher (UIUC);Joel Emer (Nvidia, MIT)

HiWayLib: A Software Framework for Enabling High Performance Communications for Heterogeneous Pipeline Computations

Zhen Zheng (Tsinghua University);Chanyoung Oh (University of Seoul);Jidong Zhai (Tsinghua University);Xipeng Shen (North Carolina State University);Youngmin Yi (University of Seoul);Wenguang Chen (Tsinghua University)

HyStream: Stream Analytics on High Bandwidth Hybrid Memory

Hongyu Miao (Purdue ECE);Myeongjae Jeon (UNIST);Gennady Pekhimenko (University of Toronto);Kathryn S McKinley (Google);Felix Xiaozhu Lin (Purdue ECE)

12:30p-2:00p Lunch/Panel @ Room TBD
2:00p-3:00p
Emerging Paradigms

A Full-Stack Platform for Accessible Microfluidic Automation with Multi-Level Feedback

Max Willsey, Ashley P. Stephenson, Chris Takahashi, Pranav Vaid (University of Washington);Bichlien H. Nguyen (Microsoft);Christine Betts (University of Washington);Sharon Newman (Stanford Univeristy);Sarang Joshi (University of Washington);Karin Strauss (Microsoft);Luis Ceze (University of Washington)

Intelligence Beyond the Edge: Inference on Intermittent Embedded Systems

Graham Gobieski, Brandon Lucia, Nathan Beckmann (Carnegie Mellon University)

Boosted Race Trees for Low Energy Classification

Georgios Tzimpragos (University of California, Santa Barbara);Advait Madhavan (Institute for Research in Electronics and Applied Physics, University of Maryland, College Park);Dilip Vasudevan (Lawrence Berkeley National Labs);Dmitri Strukov, Timothy Sherwood (University of California Santa Barbara)

Memory Systems

Compress Objects, Not Cache Lines: An Object-Based Compressed Memory Hierarchy

Po-An Tsai, Daniel Sanchez (MIT)

Beating OPT with Statistical Clairvoyance and Variable Size Caching

Pengcheng Li (Google, Inc.);Colin Pronovost, William Wilson, Benjamin Tait, Jie Zhou, Chen Ding, John Criswell (University of Rochester)

A Formal Analysis of the NVIDIA PTX Memory Consistency Model

Daniel Lustig, Sameer Sahasrabuddhe, Olivier Giroux (NVIDIA)

 3:00p-3:30p Break (Room TBD)
3:30p-4:30p
Potpourri

Just-In-Time Compilation for Verilog — A New Technique for Improving the FPGA Programming Experience

Eric Schkufza, Michael Wei (VMWare research);Christopher J. Rossbach (The University of Texas at Austin and VMWare Research)

DCNS: Automated Detection Of Conservative Non-Sleep Defects in the Linux Kernel

Jia-Ju Bai (Tsinghua University);Julia Lawall (Sorbonne Université/Inria/LIP6);Wende Tan, Shi-Min Hu (Tsinghua University)

A Case for Lease-Based, Utilitarian Resource Management on Mobile Devices

Yigong Hu, Suyi Liu, Peng Huang (Johns Hopkins University)

VM/Memory

Software-driven far-memory in warehouse-scale computers

Andres Lagar-Cavilla, Junwhan Ahn, Suleiman Souhlal, Neha Agarwal, Radoslaw Burny, Shakeel Butt, Jichuan Chang, Ashwin Chaugule, Nan Deng, Junaid Shahid, Greg Thelen, Kamil Adam Yurtsever, Yu Zhao, Parthasarathy Ranganathan (Google)

Nimble Page Management for Tiered Memory Systems

Zi Yan (Rutgers University and NVIDIA);Daniel Lustig, David Nellans (NVIDIA);Abhishek Bhattacharjee (Yale University)

HawkEye: Efficient Fine-grained OS Support for Huge Pages

Ashish Panwar (Indian Institute of Science);Sorav Bansal (Indian Institute of Technology Delhi);K. Gopinath (Indian Institute of Science)

4:30p-6:00p Poster session (location)

4/16 (Tuesday)

Time Session 1 Session 2
7:00a-8:30a Breakfast (Room TBD)
8:30a-9:30a Keynote
9:30a-10:00a Break (Room TBD)
10:00a-11:00a
Security I

Architectural Support for Containment-based Security

Hansen Zhang (Princeton University);Soumyadeep Ghosh (Barefoot Networks);Jordan Fix, Sotiris Apostolakis, Stephen R. Beard, Nayana P. Nagendra, Taewook Oh, David I. August (Princeton University)

CheriABI: Enforcing Valid Pointer Provenance and Minimizing Pointer Privilege in the POSIX C Run-time Environment

Brooks Davis (SRI International);Robert N. M. Watson, Alexander Richardson (University of Cambridge);Peter Neumann (SRI International);Simon Moore (University of Cambridge);John Baldwin (SRI International);David Chisnall (Microsoft Research);James Clarke, Khilan Gudka, Alexandre Joannou (University of Cambridge);Ben Laurie (Google Inc, University College London);A. Theodore Markettos, Ed Maste, Edward Tomasz Napierala, Robert Norton, Michael Roe, Peter Sewell (University of Cambridge);Stacey Son (University of Cambridge, Apple);Jonathan Woodruff, Nathaniel Wesley Filardo (University of Cambridge)

Context-Sensitive Fencing: Securing Speculative Execution via Microcode Customization

Mohammadkazem Taram, Ashish Venkat, Dean Tullsen (University of California San Diego)

Persistent Memory

PMTest: A Fast and Flexible Testing Framework for Persistent Memory Programs

Sihang Liu, Yizhou Wei (University of Virginia);Jishen Zhao (University of California, San Diego);Aasheesh Kolli (Pennsylvania State University);Samira Khan (University of Virginia)

Finding and Fixing Performance Pathologies in Persistent Memory Software Stacks

Jian Xu, Juno Kim, Amirsaman Memaripour, Steven Swanson (UC San Diego)

Fine-Grain Checkpointing with In Cache Line Logging

Nachshon Cohen, David Aksun (EPFL);Hillel Avni (Huawei);James R. Larus (EPFL)

11:00a-11:30a Break (Room TBD)
11:30a-12:30p
Security II

Heterogeneous Isolated Execution for Commodity GPUs

Insu Jang (KAIST);Adrian Tang (Columbia University);Taehoon Kim (KAIST);Simha Sethumadhavan (Columbia University);Jaehyuk Huh (KAIST)

Morpheus: A Vulnerability-Tolerant Secure Architecture Based on Ensembles of Moving Target Defenses with Churn

Mark Gallagher, Lauren Biernacki, Shibo Chen, Zelalem Birhanu Aweke, Salessawi Ferede Yitbarek, Misiker Tadesse Aga (University of Michigan);Austin Harris (University of Texas at Austin);Zhixing Xu (Princeton University);Baris Kasikci, Valeria Bertacco (University of Michigan);Sharad Malik (Princeton University);Mohit Tiwari (University of Texas at Austin);Todd Austin (University of Michigan)

DeepSigns: An End-to-End Watermarking Framework for Protecting the Ownership of Deep Neural Networks

Bita Darvish Rouhani, Huili Chen, Farinaz Koushanfar(UC San Diego)

Accelerators

FA3C: FPGA-Accelerated Deep Reinforcement Learning

Hyungmin Cho (Hongik University);PyeongSeok Oh, Jiyoung Park, Wookeun Jung, Jaejin Lee (Seoul National University)

AcMC²: Accelerating Markov Chain Monte Carlo Algorithms for Probabilistic Modeling

Subho Banerjee, Zbigniew T. Kalbarczyk, Ravishankar K. Iyer (University of Illinois at Urbana-Champaign)

Targeting Classical Code to a Quantum Annealer

Scott Pakin (Los Alamos National Laboratory)

12:30p-2:00p Lunch @ Room TBD
2:00p-3:00p
Security III

ProbeGuard: Mitigating Probing Attacks Through Reactive Program Transformations

Koustubha Bhat (Vrije Universiteit Amsterdam);Erik van der Kouwe (Leiden Institute of Advanced Computer Science (LIACS));Herbert Bos, Cristiano Giuffrida (Vrije Universiteit Amsterdam)

kMVX: Detecting Kernel Information Leaks with Multi-variant Execution

Sebastian Österlund, Koen Koning (Vrije Universiteit Amsterdam);Pierre Olivier (Virginia Tech);Antonio Barbalace (Huawei German Research Center);Herbert Bos, Cristiano Giuffrida (Vrije Universiteit Amsterdam)

MVEDSUA : Higher Availability Dynamic Software Updates via Multi-Version Execution

Luís Pina (George Mason University);Anastasios Andronidis (Imperial College London);Michael Hicks (University of Maryland);Cristian Cadar (Imperial College London)

Graph Processing

PnP: Pruning and Prediction for Point-To-Point Iterative Graph Analytics

Chengshuo Xu (UC Riverside);Keval Vora (Simon Fraser University);Rajiv Gupta (UC Riverside)

DiGraph: An Efficient Path-based Iterative Directed Graph Processing System on Multiple GPUs

Yu Zhang, Xiaofei Liao, Hai Jin (Huazhong University of Science and Technology);Bingsheng He (National University of Singapore);Haikun Liu, Lin Gu (Huazhong University of Science and Technology)

Phoenix: A Substrate for Resilient Distributed Graph Analytics

Roshan Dathathri, Gurbinder Gill, Loc Hoang, Keshav Pingali (The University of Texas at Austin)

 3:00p-3:30p Break (Room TBD)
3:30p-4:30p
Secure Memory

BOGO: Buy Spatial Memory Safety, Get Temporal Memory Safety (Almost) Free

Tong Zhang, Dongyoon Lee, Changhee Jung (Virginia Tech)

Protecting Page Tables from RowHammer Attacks using Monotonic Pointers in DRAM True-Cells

Xin-Chuan Wu, Yanjing Li (University of Chicago);Timothy Sherwood (University of California, Santa Barbara);Frederic T. Chong (University of Chicago)

⍴ : Relaxed Hierarchical ORAM

Chandrasekhar Nagarajan, Ali Shafiee, Rajeev Balasubramonian (University of Utah);Mohit Tiwari (University of Texas at Austin)

Microarchitecture

Characterizing Latency, Throughput, and Port Usage of Instructions on Intel Microarchitectures

Andreas Abel, Jan Reineke (Saarland University)

Bootstrapping: Using SMT Hardware to Improve Single-Thread Performance

Sushant Kondguli, Michael Huang (University of Rochester)

CORF: Coalescing Operand Register File for GPUs

Hodjat Asghari Esfeden (University of California Riverside);Farzad Khorasani (Tesla Inc.);Hyeran Jeon (San Jose State University);Daniel Wong, Nael Abu-Ghazaleh (University of California Riverside)

4:30p-5:30p WACI
5:30p-5:45p Walk to RISD
5:45p-8:30p RISD museum outing with banquet

4/17 (Wednesday)

Time Session 1 Session 2
7:00a-8:30a Breakfast (Room TBD)
8:30a-9:30a
Machine Learning I

PUMA: A Programmable Ultra-efficient Memristor-based Accelerator for Machine Learning Inference

Aayush Ankit (Purdue University);Izzat El Hajj (University of Illinois at Urbana-Champaign);Sai Rahul Chalamalasetti, Geoffrey Ndu (Hewlett Packard Labs);Martin Foltin (Hewlett Packard Enterprise);R. Stanley Williams, Paolo Faraboschi (Hewlett Packard Labs);Wen-mei W Hwu (University of Illinois at Urbana-Champaign);John Paul Strachan (Hewlett Packard Labs);Kaushik Roy (Purdue University);Dejan S Milojicic (Hewlett Packard Labs)

FPSA: A Full System Stack Solution for Reconfigurable ReRAM-based NN Accelerator Architecture

Yu Ji, Youyang Zhang (Tsinghua University);Xinfeng Xie, Shuangchen Li (UCSB);Peiqi Wang (Tsinghua University);Xing Hu (UCSB);Youhui Zhang (Tsinghua University);Yuan Xie (UCSB)

Bit-Tactical: A Software/Hardware Approach to Exploiting Value and Bit Sparsity in Neural Networks

Alberto Delmas Lascorz (University of Toronto);Patrick Judd (University of Toronto/NVIDIA);Dylan Malone Stuart, Zissis Poulos, Mostafa Mahmoud, Sayeh Sharify, Milos Nikolic (University of Toronto);Kevin Siu, Andreas Moshovos (University of Toronto)

Synchronization

SW-Lock: A Fast Lock for Sunway Taihulight

Xiongchao Tang (Tsinghua University, Qatar Computing Research Institute);Jidong Zhai (Tsinghua University);Xuehai Qian (University of Southern California);Wenguang Chen (Tsinghua University)

MV-RLU: Scaling Read-Log-Update with Multi-Versioning

Jaeho Kim, Ajit Mathew (Virginia Tech);Sanidhya Kashyap (Georgia Tech);Madhava Krishnan Ramanathan, Changwoo Min (Virginia Tech)

Fast Fine-Grained Global Synchronization on GPUs

Kai Wang, Calvin Lin, Donald Fussell (University of Texas at Austin)

9:30a-10:00a Break (Room TBD)
10:00a-11:00a
Machine Learning II

Optimized Coarse-Grained Dataflow for Scalable NN Accelerators

Mingyu Gao, Xuan Yang, Jing Pu, Mark Horowitz, Christos Kozyrakis (Stanford University)

Packing Sparse Convolutional Neural Networks for Efficient Systolic Array Implementations: Column Combining Under Joint Optimization

HT Kung, Bradley McDanel, Sai Qian Zhang (Harvard University)

Split-CNN: Splitting Window-based Operations in Convolutional Neural Networks for Memory System Optimization

Tian Jin, ;Seokin Hong (IBM T.J. Watson Research Center)

Concurrency

Replica: A Wireless Manycore for Latency-Critical Data

Vimuth Fernando, Antonio Franques (University of Illinois at Urbana-Champaign);Sergi Abadal (Universitat Politècnica de Catalunya);Sasa Misailovic, Josep Torrellas (University of Illinois at Urbana-Champaign)

Understanding Real-World Concurrency Bugs in Go

Tengfei Tu (Beijing University of Posts and Telecommunications and Penn State University);Xiaoyu Liu (Purdue University);Linhai Song (Penn State Unversity);Yiying Zhang (Purdue University)

Lazy Determinism for Faster Deterministic Multithreading

Timothy Merrifield (VMware Inc);Sepideh Roghanchi (University of Illinois at Chicago);Joseph Devietti (University of Pennsylvania);Jakob Eriksson (University of Illinois at Chicago)

11:00a-11:30a Break (Room TBD)
11:30a-12:30p
Machine Learning III

HOP: Heterogeneity-Aware Decentralized Training

Qinyi Luo (University of Southern California);Jinkun Lin (Tsinghua University);Youwei Zhuo, Xuehai Qian (University of Southern California)

Astra: Exploiting Predictability to Optimize Deep Learning

Muthian Sivathanu (Microsoft Research India);Tapan Chugh (Microsoft Research India);Sanjay Srivallabh (Microsoft Research India);Lidong Zhou (Microsoft Research Asia)

ADMM-NN: An Algorithm-Hardware Co-Design Framework of DNNs Using Alternating Direction Methods of Multipliers

Ao Ren (Northeastern University);Jiayu Li, Tianyun Zhang, Shaokai Ye (Syracuse University);Wenyao Xu (SUNY, Buffalo);Xuehai Qian (University of Southern California);Xue Lin, Yanzhi Wang (Northeastern University)

Storage Systems

LightStore: Software-defined Network-attached Key-value Drives

Chanwoo Chung (Massachusetts Institute of Technology);Jinhyung Koo, Junsu Im (DGIST);Arvind (Massachusetts Institute of Technology);Sungjin Lee (DGIST)

SOML Read: Rethinking the read operation granularity of 3D NAND SSDs

Chun-Yi Liu (The Pennsylvania State University);Jagadish B. Kotra (AMD Research);Myoungsoo Jung (Yonsei University);Mahmut T. Kandemir, Chita R. Das (The Pennsylvania State University)

FlatFlash: Exploiting the Byte-Accessibility of SSDs within A Unified Memory-Storage Hierarchy

Ahmed Abulila, Vikram Sharma Mailthody, Zaid Qureshi, Jian Huang, Nam Sung Kim (UIUC);Jinjun Xiong (IBM Research);Wen-Mei Hwu (UIUC)

12:30p-2:00p Lunch (on your own)
2:00p-3:30p
Quantum Computing

A Case for Variability-Aware Policies for NISQ-Era Quantum Computers

Swamit Tannu, Moinuddin Qureshi (Georgia Institute of Technology)

Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices

Gushu Li (University of California, Santa Barbara. Alibaba Group);Yufei Ding (University of California, Santa Barbara);Yuan Xie (University of California, Santa Barbara. Alibaba Group)

Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers

Prakash Murali (Princeton University);Jonathan M. Baker (University of Chicago);Ali Javadi-Abhari (IBM T. J. Watson Research Center);Frederic T. Chong (University of Chicago);Margaret R. Martonosi (Princeton University)

Optimized Compilation of Aggregated Instructions for Realistic QuantumComputers

Yunong Shi, Nelson Leung, Pranav Gokhale, Zane Rossi, David I. Schuster, Henry Hoffman, Frederic T. Chong (The University of Chicago)

Tools & Methods

Wasabi: A Framework for Dynamically Analyzing WebAssembly

Daniel Lehmann (TU Darmstadt, Germany);Michael Pradel (TU Darmstadt, Germany)

Safer Program Behavior Sharing Through Trace Wringing

Deeksha Dangwal, Weilong Cui, Joseph McMahan, Timothy Sherwood (UC Santa Barbara)

Debugging Support for Pattern-Matching Languages and Accelerators

Matthew Casias (University of Virginia);Kevin Angstadt (University of Michigan);Tommy Tracy II, Kevin Skadron (University of Virginia);Westley Weimer (University of Michigan)

Minotaur: Adapting Software Testing Techniques for Hardware Errors

Abdulrahman Mahmoud, Radha Venkatagiri, Khalique Ahmed, Sasa Misailovic, Darko Marinov, Christopher W. Fletcher, Sarita V. Adve (University of Illinois at Urbana Champaign)

 3:30p- Closing

Committees

Organization Committee

General Chairs Iris Bahar Brown University
  Maurice Herlihy Brown University
Program Chairs Emmett Witchel University of Texas, Austin
  Alvin Lebeck Duke University
Local Arrangements Chair TBD
Finance Joshua San Miguel University of Wisconsin
Workshop & Tutorial Ulya Karpuzcu  University of Minnesota/Brown University
  Paul Gratz  Texas A&M University
  Brian Greskamp  D. E. Shaw
Travel Grant Tali Moreshet Boston University
 Christina Delimitrou Cornell University
ACM SRC and Posters Yufei Ding  University of California, Santa Barbara
 Linhai Song  Penn State University
Wild and Crazy Ideas Brandon Lucia  Carnegie Mellon University
 Tim Sherwood University of California, Santa Barbara
Registration Rujia Wang Illinois Institue of Technology
Lightning Talks Abhishek Bhattacharjee Yale University
Guilherme Cox NVIDIA
Publicity Jishen Zhao  University of California, San Diego
 Yiying Zhang Purdue University
 Michel Kinsy Boston University
Web Xuehai Qian USC
Sponsor Rudolf Eigenmann  University of Delaware
  Reetuparna Das  University of Michigan
  Lawrence Rauchwerger Texas A&M
  Yungang Bao Chinese Academy of Sciences
Publication Dimitra Papagiannopoulou University of Massachusetts, Lowell

Program Committee

Marcos Aguilera VMWare Research Group
Saman Amarasinghe MIT
Nadav Amit VMWare Research Group
Murali Annavarum University of Southern California
Arka Basu Indian Institute of Science-Bangalore
Abhishek Bhattacharjee Rutgers University
Michael Bond Ohio State University
Irina Calciu VMWare Research Group
Luis Ceze University of Washington
Haibo Chen Shanghai Jiao Tong University
Eric Chung Microsoft Research
John Criswell University of Rochester
Reetuparna Das University of Michigan
Christina Delimitrou Cornell University
Joseph Devietti University of Pennsylvania
Yufei Ding UC Santa Barbara
Hadi Esmaeilzadeh UC San Diego
Ashvin Goel University of Toronto
Boris Grot University of Edinburgh
Gernot Heiser University of New South Wales
Hank Hoffman University of Chicago
Daniel Jimenez Texas A&M University
Brad Karp University College London
John Kim KAIST
Milind Kulkarni Purdue University
Shan Lu University of Chicago
Brandon Lucia Carnegie Mellon University
Jason Mars University of Michigan
Madan Musuvathi Microsoft Research
Satish Narayanasamy University of Michigan
Simon Peter University of Texas at Austin
John Regehr University of Utah
Scott Rixner Rice University
Chris Rossbach University of Texas at Austin
Adrian Sampson Cornell University
Xipeng Shen North Carolina State University
Tim Sherwood UC Santa Barbara
Mark Silberstein Technion
Karin Strauss Microsoft Research / University of Washington
Mike Swift University of Wisconsin–Madison
Lingjia Tang University of Michigan
Mohit Tiwari University of Texas at Austin
Dan Tsafrir Technion / VMware Research
Haris Volos Hewlett Packard Labs
Carl Waldspurger Carl Waldspurger Consulting
Thomas Wenisch University of Michigan
Dave Wentzlaff Princeton University
Chia-Lin Yang National Taiwan University
Irene Zhang Microsoft Research
Yiying Zhang Purdue University
Zheng Zhang Rutgers University
Zidong Du Institute of Computing Technology

External Review Committee

Shaizeen Aga AMD
Sandeep Agrawal Oracle
Ismail Akturk University of Missouri-Columbia
Ardalan Amiri Sani UC Irvine
Andrew Baumann Microsoft Research
Nathan Beckman CMU
Muli Ben-Yehuda LightBits Labs
Steve Blackburn Australian National University
Björn Brandenburg Max Plank Institute
Marco Canini KAUST
Calin Caşcaval Barefoot Networks
Adrian Caulfield Microsoft Research
Guoyang Chen Alibaba
Yunji Chen Institute of Computing Technology
Fred Chong University of Chicago
Changhee Jung Virginia Tech
Eduardo Cuervo Microsoft Research
Nathan Dautenhahn University of Pennsylvania
Christian DeLozier United States Naval Academy
Peter Desnoyers Northeastern University
Natalie Enright Jerger University of Toronto
Mattan Erez University of Texas at Austin
Pascal Felber University of Neuchatel
María Garzarín University of Illinois at Urbana-Champaign and Intel
Haryadi Gunawi University of Chicago
Tim Harris Oracle
Michael Hicks University of Maryland
Mark Hill University of Wisconsin–Madison
Owen Hofmann Google
Y. Charlie Hu Purdue University
Yu Hua Huazhong University of Science and Technology
Yipeng Huang Princeton University
Vijay Janapa Reddi University of Texas at Austin
Guoliang Jin North Carolina State University
Myoungsoo Jung Yonsei University
Asim Kadav NEC Labs
Shoaib Kamil Adobe
Ulya Karpuzcu University of Minnesota/Brown University
Sam King UC Davis
Jagadish Kotra AMD
Chandra Krintz UC Santa Barbara
Tushar Krishna Georgia Tech
I-Ting Angelina Lee Washington University in St. Louis
Felix Xiaozhu Lin Purdue University
Ben Livshits Brave Co.
Gabe Loh AMD
Jason Lowe-Power UC Davis
Martin Maas Google
Seyed Majid Zahedi University of Waterloo
Margaret Martonosi Princeton University
Stephen McCamant University of Minnesota
Ishai Menache Microsoft Research
Saurav Muralidharan NVIDIA
Vijay Nagarajan University of Edinburgh
Santosh Nagarakatte Rutgers University
David Nellens NVIDIA
Jacob Nelson Microsoft Research
Michael Norrish Data61, CSIRO and Australian National University
Gennady Pekhimenko University of Toronto
Rodrigo Rodrigues INESC-ID and Instituto Superior Técnico, Universidade de Lisboa
Joshua San Miguel University of Wisconsin–Madison
Daniel Sanchez MIT
Karu Sankaralingham University of Wisconsin–Madison
Aritra Sengupta Samsung Research America
Jonathan Smith University of Pennsylvania
Linhai Song Penn State University
Daniel Sorin Duke University
Patrick Stuedi Zurich Research Laboratory
Ross Tate Cornell University
Mithuna Thottethodi Purdue University
James Tuck North Carolina State University
Martin Vechev ETH Zurich
Megan Wachs SiFive
Zhaoguo Wang Shanghai Jiao Tong University
Robert Watson University of Cambridge
Yuval Yarom University of Adelaide and Data61
Minjia Zhang Microsoft Research
Jishen Zhao UC San Diego
Lin Zhong Rice University

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