Nothing Special   »   [go: up one dir, main page]

skip to main content
Volume 8, Issue 2June 2024POMACSCurrent Issue
Editor:
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
EISSN:2476-1249
Reflects downloads up to 19 Nov 2024Bibliometrics
Skip Table Of Content Section
editorial
Free
POMACS V8, N2, June 2024 Editorial
Article No.: 18, Page 1https://doi.org/10.1145/3656013

The Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS) focuses on the measurement and performance evaluation of computer systems and operates in close collaboration with the ACM Special Interest Group SIGMETRICS. All papers ...

research-article
Open Access
BONES: Near-Optimal Neural-Enhanced Video Streaming
Article No.: 19, Pages 1–28https://doi.org/10.1145/3656014

Accessing high-quality video content can be challenging due to insufficient and unstable network bandwidth. Recent advances in neural enhancement have shown promising results in improving the quality of degraded videos through deep learning. Neural-...

research-article
Open Access
A Closer Look into IPFS: Accessibility, Content, and Performance
Article No.: 20, Pages 1–31https://doi.org/10.1145/3656015

The InterPlanetary File System (IPFS) has recently gained considerable attention. While prior research has focused on understanding its performance characterization and application support, it remains unclear: (1) what kind of files/content are stored in ...

research-article
Analysis of False Negative Rates for Recycling Bloom Filters (Yes, They Happen!)
Article No.: 21, Pages 1–34https://doi.org/10.1145/3656005

Bloom Filters are a desirable data structure for distinguishing new values in sequences of data (i.e., messages), due to their space efficiency, their low false positive rates (incorrectly classifying a new value as a repeat), and never producing false ...

research-article
FedQV: Leveraging Quadratic Voting in Federated Learning
Article No.: 22, Pages 1–36https://doi.org/10.1145/3656006

Federated Learning (FL) permits different parties to collaboratively train a global model without disclosing their respective local labels. A crucial step of FL, that of aggregating local models to produce the global one, shares many similarities with ...

research-article
Open Access
Learning the Optimal Control for Evolving Systems with Converging Dynamics
Article No.: 23, Pages 1–39https://doi.org/10.1145/3656007

We consider a principle or controller that can pick actions from a fixed action set to control an evolving system with converging dynamics. The actions are interpreted as different configurations or policies. We consider systems with converging dynamics, ...

research-article
Open Access
Multi-dimensional State Space Collapse in Non-complete Resource Pooling Scenarios
Article No.: 24, Pages 1–52https://doi.org/10.1145/3656016

The present paper establishes an explicit multi-dimensional state space collapse (SSC) for parallel-processing systems with arbitrary compatibility constraints between servers and job types. This breaks major new ground beyond the SSC results and queue ...

research-article
Network Fairness Ambivalence: When does social network capital mitigate or amplify unfairness?
Article No.: 25, Pages 1–28https://doi.org/10.1145/3656017

Social networks inherit societal biases present across lines of gender, race, socioeconomic status, and other factors. Networks can structurally perpetuate unequal access to information and opportunities through homophilous dynamics. While there is ...

research-article
Server Saturation in Skewed Networks
Article No.: 26, Pages 1–37https://doi.org/10.1145/3656018

We consider a model inspired by compatibility constraints that arise between tasks and servers in data centers, cloud computing systems and content delivery networks. The constraints are represented by a bipartite graph or network that interconnects ...

research-article
Best Paper
Best Paper
Strongly Tail-Optimal Scheduling in the Light-Tailed M/G/1
Article No.: 27, Pages 1–33https://doi.org/10.1145/3656011

We study the problem of scheduling jobs in a queueing system, specifically an M/G/1 with light-tailed job sizes, to asymptotically optimize the response time tail. This means scheduling to make \mathbfP [T > t], the chance a job's response time exceeds t,...

research-article
Open Access
TAO: Re-Thinking DL-based Microarchitecture Simulation
Article No.: 28, Pages 1–25https://doi.org/10.1145/3656012

Microarchitecture simulators are indispensable tools for microarchitecture designers to validate, estimate, optimize, and manufacture new hardware that meets specific design requirements. While the quest for a fast, accurate and detailed ...

Subjects

Comments

Please enable JavaScript to view thecomments powered by Disqus.