Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3173162acmconferencesBook PagePublication PagesasplosConference Proceedingsconference-collections
ASPLOS '18: Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems
ACM2018 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
ASPLOS '18: Architectural Support for Programming Languages and Operating Systems Williamsburg VA USA March 24 - 28, 2018
ISBN:
978-1-4503-4911-6
Published:
19 March 2018
In-Cooperation:
Reflects downloads up to 01 Sep 2024Bibliometrics
Skip Abstract Section
Abstract

The ASPLOS'18 program is the result of a thorough evaluation process, which we started by forming the program committee (PC) with 50 members and the external review committee (ERC) with 73 members. Moreover, we split up the PC into two independent sub-PCs while keeping the ERC as a single unit. We carefully assigned the PC members to the two groups, ensuring that (1) each sub-PC would cover all ASPLOS topics and (2) the experts on each topic would be evenly split across the sub-PCs. In response to the call for papers, we received 319 submissions, just one shy of last year's record. (This number includes 18 submissions that were either withdrawn by their authors or desk-rejected for clear violations of the formatting rules.) After receiving reviewing bids from most committee members, we also split the submissions evenly across the two sub-PCs, so that each submission would receive reviews from only one sub-PC. We manually moved submissions across sub-PCs to maximize reviewer expertise, according to the PC members' bids. The review process proceeded in two rounds, followed by an extensive online discussion period. During the first round, all submissions received 3-4 reviews. Based on these reviews, we selected 158 submissions to go through the second round of reviews, which produced 2-4 additional reviews for these submissions. During the review process, we also requested reviews from 52 external experts on a case-by-case basis. Throughout the process, our main goal in assigning reviewers to submissions was to maximize reviewer expertise. Overall, the committees and external experts produced 1,227 reviews. After the online discussion period involving all reviewers, we selected 100 submissions for discussion (15 papers online-tagged tentative-accepts and 85 papers online-tagged discuss-at-meeting) during the PC meeting on November 10, 2017 at Georgia Tech. 47 of the 50 PC members were physically present at the meeting and 2 others participated remotely. The whole committee met together in the morning, and split up into the two independent sub- PCs in the afternoon. We did not set a limit for the number of accepted submissions. During the meeting, we accepted 47 submissions and conditionally accepted (subject to shepherding) 9 others. After carefully addressing the reviewers' comments, all shepherded submissions were ultimately accepted. The acceptance rate of the two sub-PCs was exactly the same: 28/151 and 28/150. To complete the program, we invited two outstanding keynote speakers: Hillery Hunter (IBM Research) and Fred Chong (University of Chicago). We are pleased that the 56 accepted submissions and 2 keynote talks represent an exciting spectrum of traditional and emerging ASPLOS topics.

SESSION: Session 7A: Irregular Apps and Graphs
research-article
An Event-Triggered Programmable Prefetcher for Irregular Workloads

Many modern workloads compute on large amounts of data, often with irregular memory accesses. Current architectures perform poorly for these workloads, as existing prefetching techniques cannot capture the memory access patterns; these applications end ...

research-article
Public Access
Minnow: Lightweight Offload Engines for Worklist Management and Worklist-Directed Prefetching

The importance of irregular applications such as graph analytics is rapidly growing with the rise of Big Data. However, parallel graph workloads tend to perform poorly on general-purpose chip multiprocessors (CMPs) due to poor cache locality, low ...

research-article
Public Access
Wonderland: A Novel Abstraction-Based Out-Of-Core Graph Processing System

Many important graph applications are iterative algorithms that repeatedly process the input graph until convergence. For such algorithms, graph abstraction is an important technique: although much smaller than the original graph, it can bootstrap an ...

research-article
Public Access
Tigr: Transforming Irregular Graphs for GPU-Friendly Graph Processing

Graph analytics delivers deep knowledge by processing large volumes of highly connected data. In real-world graphs, the degree distribution tends to follow the power law -- a small portion of nodes own a large number of neighbors. The high irregularity ...

Contributors
  • NC State University
  • Microsoft Corporation
  • Georgia Institute of Technology

Recommendations

Acceptance Rates

ASPLOS '18 Paper Acceptance Rate 56 of 319 submissions, 18%;
Overall Acceptance Rate 535 of 2,713 submissions, 20%
YearSubmittedAcceptedRate
ASPLOS '193517421%
ASPLOS '183195618%
ASPLOS '173205317%
ASPLOS '162325323%
ASPLOS '152874817%
ASPLOS '142174923%
ASPLOS XV1813218%
ASPLOS XIII1273124%
ASPLOS XII1583824%
ASPLOS X1752414%
ASPLOS IX1142421%
ASPLOS VIII1232823%
ASPLOS VII1092523%
Overall2,71353520%