In "How to Implement Any Concurrent Data Structure," Calciu et al. show that a concurrent data structure can be built automatically and that its performance is...Tim Harris From Communications of the ACM | December 2018
We propose a method called Node Replication (NR) to implement any concurrent data structure.
Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, Marcos K. Aguilera From Communications of the ACM | December 2018
"LIBS: A Bioelectrical Sensing System from Human Ears for Staging Whole-Night Sleep Study" provides a nice balance in terms of minimizing the burden on users and...Tanzeem Choudhury From Communications of the ACM | November 2018
We explore a new form of wearable systems, called LIBS, that can continuously record biosignals such as brain wave, eye movements, and facial muscle contractions...Anh Nguyen, Raghda Alqurashi, Zohreh Raghebi, Farnoush Banaei-Kashani, Ann C. Halbower, Tam Vu From Communications of the ACM | November 2018
"Enabling Highly Scalable Remote Memory Access Programming with MPI-3 One Sided" convincingly shows that the potential of MPI one-sided communication can be realized...Marc Snir From Communications of the ACM | October 2018
In this work, we design and develop bufferless protocols that demonstrate how to implement the MPI-3 RMA interface and support scaling to millions of cores.
Robert Gerstenberger, Maciej Besta, Torsten Hoefler From Communications of the ACM | October 2018
"Fundamental Concepts of Reactive Control for Autonomous Drones" introduces the notion of "reactive control" in which an autopilot's control logic is run only intermittently...John Baillieul From Communications of the ACM | October 2018
We conceive a notion of reactive control that allows drones to execute the low-level control logic only upon recognizing the need to, based on the influence of...Luca Mottola, Kamin Whitehouse From Communications of the ACM | October 2018
"Accelerating GPU Betweenness Centrality" by McLaughlin and Bader ably addresses the challenges to authors of efficient graph implementations in the important context...John D. Owens From Communications of the ACM | August 2018
We present a hybrid GPU implementation that provides good performance on graphs of arbitrary structure rather than just scale-free graphs as was done previously...Adam McLaughlin, David A. Bader From Communications of the ACM | August 2018
In "Coz: Finding Code that Counts with Causal Profiling," Curtsinger and Berger describe causal profiling, which tell programmers exactly how much speed-up bang...Landon P. Cox From Communications of the ACM | June 2018
This paper introduces causal profiling. Unlike past profiling approaches, causal profiling indicates exactly where programmers should focus their optimization efforts...Charlie Curtsinger, Emery D. Berger From Communications of the ACM | June 2018
"Never-Ending Learning" is the latest and one of the most compelling incarnations of Tom Mitchell and his collaborators' research investigating how to broaden the...Oren Etzioni From Communications of the ACM | May 2018
In this paper we define more precisely the never-ending learning paradigm for machine learning, and present one case study: the Never-Ending Language Learner (NELL)...T. Mitchell, W. Cohen, E. Hruschka, P. Talukdar, B. Yang, J. Betteridge, A. Carlson, B. Dalvi, M. Gardner, B. Kisiel, J. Krishnamurthy, N. Lao, K. Mazaitis, T. Mohamed, N. Nakashole, E. Platanios, A. Ritter, M. Samadi, B. Settles, R. Wang, D. Wijaya, A. Gupta, X. Chen, A. Saparov, M. Greaves, J. Welling From Communications of the ACM | May 2018
This article shows that some new theoretical algorithms that have provable guarantees can be adapted to yield highly practical tools for topic modeling.
Sanjeev Arora, Rong Ge, Yoni Halpern, David Mimno, Ankur Moitra, David Sontag, Yichen Wu, Michael Zhu From Communications of the ACM | April 2018
"Halide: Decoupling Algorithms from Schedules for High-Performance Image Processing" by Ragan-Kelley et al. on the image processing language Halide explores a substantially...Manuel Chakravarty From Communications of the ACM | January 2018
We propose a new programming language for image processing pipelines, called Halide, that separates the algorithm from its schedule.
Jonathan Ragan-Kelley, Andrew Adams, Dillon Sharlet, Connelly Barnes, Sylvain Paris, Marc Levoy, Saman Amarasinghe, Frédo Durand From Communications of the ACM | January 2018
"The Heat Method for Distance Computation," by Crane, Weischedel, and Wardetzky, shows that the gradient of the probability density function of a random walk is...Marc Alexa From Communications of the ACM | November 2017
We introduce the heat method for solving the single- or multiple-source shortest path problem on both flat and curved domains.
Keenan Crane, Clarisse Weischedel, Max Wardetzky From Communications of the ACM | November 2017