10.1145/3567955acmconferencesBook PagePublication PagesasplosConference Proceedingsconference-collections
ASPLOS 2023: Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1
ACM2023 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
ASPLOS '23: 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1 Vancouver BC Canada March 25 - 29, 2023
ISBN:
978-1-4503-9915-9
Published:
25 March 2023

Bibliometrics
Skip Abstract Section
Abstract

It is our pleasure to introduce Volume I of ASPLOS ’23. For the first time, ASPLOS has embarked on a new multi-deadline review model. ASPLOS ’23 features 3 deadlines spaced throughout the year and papers will be published in three volumes. Multiple deadlines are meant to encourage authors to submit their papers when ready and to facilitate the selection of some papers for revision. For this volume of ASPLOS ’23, we continued the 2-page extended abstract submissions that were used in ASPLOS ’21 and ASPLOS ’22. We also experimented with a new submission format, where authors were given additional pages but limited to 8000 words in an effort to improve paper readability. In our preface to Volume III, we will give a more detailed rundown of how the process worked.

Skip Table Of Content Section
SESSION: Papers
research-article
AQUATOPE: QoS-and-Uncertainty-Aware Resource Management for Multi-stage Serverless Workflows

Multi-stage serverless applications, i.e., workflows with many computation and I/O stages, are becoming increasingly representative of FaaS platforms. Despite their advantages in terms of fine-grained scalability and modular development, these ...

research-article
CAFQA: A Classical Simulation Bootstrap for Variational Quantum Algorithms

Classical computing plays a critical role in the advancement of quantum frontiers in the NISQ era. In this spirit, this work uses classical simulation to bootstrap Variational Quantum Algorithms (VQAs). VQAs rely upon the iterative optimization of a ...

Cooperative Concurrency Control for Write-Intensive Key-Value Workloads

Key-Value Stores (KVS) are foundational infrastructure components for online services. Due to their latency-critical nature, today’s best-performing KVS contain a plethora of full-stack optimizations commonly targeting read-mostly, popularity-skewed ...

research-article
Open Access
DecoMine: A Compilation-Based Graph Pattern Mining System with Pattern Decomposition

Graph pattern mining (GPM) is an important application that identifies structures from graphs. Despite the recent progress, the performance gap between the state-of-the-art GPM systems and an efficient algorithm—pattern decomposition—is still at least ...

Erms: Efficient Resource Management for Shared Microservices with SLA Guarantees

A common approach to improving resource utilization in data centers is to adaptively provision resources based on the actual workload. One fundamental challenge of doing this in microservice management frameworks, however, is that different components ...

Glign: Taming Misaligned Graph Traversals in Concurrent Graph Processing

In concurrent graph processing, different queries are evaluated on the same graph simultaneously, sharing the graph accesses via the memory hierarchy. However, different queries may traverse the graph differently, especially for those starting from ...

research-article
Open Access
Overlap Communication with Dependent Computation via Decomposition in Large Deep Learning Models

Large deep learning models have shown great potential with state-of-the-art results in many tasks. However, running these large models is quite challenging on an accelerator (GPU or TPU) because the on-device memory is too limited for the size of ...

Risotto: A Dynamic Binary Translator for Weak Memory Model Architectures

Dynamic Binary Translation (DBT) is a powerful approach to support cross-architecture emulation of unmodified binaries. However, DBT systems face correctness and performance challenges, when emulating concurrent binaries from strong to weak memory ...

research-article
Open Access
TelaMalloc: Efficient On-Chip Memory Allocation for Production Machine Learning Accelerators

Memory buffer allocation for on-chip memories is a major challenge in modern machine learning systems that target ML accelerators. In interactive systems such as mobile phones, it is on the critical path of launching ML-enabled applications. In data ...

Contributors
  • The University of British Columbia
  • University of Toronto
  • University of Wisconsin-Madison

Index Terms

  1. Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1

    Acceptance Rates

    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%
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!