Instead of handing trace records off to a collector for long-term storage and future processing, the system described in "Pivot Tracing: Dynamic Causal Monitoring...Rebecca Isaacs From Communications of the ACM | March 2020
This paper presents Pivot Tracing, a monitoring framework for distributed systems, which addresses the limitations of today's monitoring and diagnosis tools by...Jonathan Mace, Ryan Roelke, Rodrigo Fonseca From Communications of the ACM | March 2020
OpenPiton research is one of the watershed moments in the fundamental shift toward the construction of an open source ecosystem for implementing prototype chips...Michael B. Taylor From Communications of the ACM | December 2019
We present OpenPiton, an open source framework for building scalable architecture research prototypes from one core to 500 million cores.
Jonathan Balkind, Michael McKeown, Yaosheng Fu, Tri Nguyen, Yanqi Zhou, Alexey Lavrov, Mohammad Shahrad, Adi Fuchs, Samuel Payne, Xiaohua Liang, Matthew Matl, David Wentzlaff From Communications of the ACM | December 2019
DeepXplore brings a software testing perspective to deep neural networks and, in doing so, creates the opportunity for enormous amounts of follow-on work in several...David G. Andersen From Communications of the ACM | November 2019
We design, implement, and evaluate DeepXplore, the first white-box framework for systematically testing real-world deep learning systems.
Kexin Pei, Yinzhi Cao, Junfeng Yang, Suman Jana From Communications of the ACM | November 2019
The authors of "Building Certified Concurrent OS Kernels" illustrate that formal verification can scale up to a moderate-size program (6,500 lines of C) that has...Andrew W. Appel From Communications of the ACM | October 2019
In this work, we present CertiKOS, a novel compositional framework for building verified concurrent OS kernels.
Ronghui Gu, Zhong Shao, Hao Chen, Jieung Kim, Jérémie Koenig, Xiongnan (Newman) Wu, Vilhelm Sjöberg, David Costanzo From Communications of the ACM | October 2019
The authors of "OpenFab" propose to revisit the processing pipeline that turns a 3D model into machine instructions in light of the solutions developed in computer...Sylvain Lefebvre From Communications of the ACM | September 2019
We present OpenFab, a programmable pipeline for synthesis of multimaterial 3D printed objects that is inspired by RenderMan and modern GPU pipelines.
Kiril Vidimče, Szu-Po Wang, Jonathan Ragan-Kelley, Wojciech Matusik From Communications of the ACM | September 2019
The main focus of "Heavy Hitters via Cluster-Preserving Clustering" by Kasper Green Larsen et al. is on building up sufficient information to allow a more effective...Graham Cormode From Communications of the ACM | August 2019
We develop a new algorithm for the turnstile heavy hitters problem in general turnstile streams, the EXPANDERSKETCH, which finds the approximate top-k items in...Kasper Green Larsen, Jelani Nelson, Huy L. Nguyễn, Mikkel Thorup From Communications of the ACM | August 2019
There is a need for alternative techniques for understanding and evaluating QUIC when compared with previous transport-layer protocols.
Arash Molavi Kakhki, Samuel Jero, David Choffnes, Cristina Nita-Rotaru, Alan Mislove From Communications of the ACM | July 2019
This work studies the potential of a paradigm of heterogeneous execution models by developing a specialization engine for explicit-dataflow (SEED) and integrating...Tony Nowatzki, Vinay Gangadhar, Karthikeyan Sankaralingam From Communications of the ACM | June 2019
Umesh Vazirani and Thomas Vidick's "Fully Device Independent Quantum Key Distribution" provides an unexpectedly simple and elegant secure protocol solution, indeed...Gilles Brassard From Communications of the ACM | April 2019
We rigorously provide the device-independent security of an entanglement-based protocol building on Ekert's original proposal for quantum key distribution.
Umesh Vazirani, Thomas Vidick From Communications of the ACM | April 2019
Whether there exists a deterministic parallel algorithm for bipartite matching remains an outstanding question at the frontiers of our understanding of the role...Nisheeth K. Vishnoi From Communications of the ACM | March 2019
In this article, we give an almost complete derandomization of the Isolation Lemma for perfect matchings in bipartite graphs.
Stephen Fenner, Rohit Gurjar, Thomas Thierauf From Communications of the ACM | March 2019