What is the most drastic way to reduce the cost of communication for parallel data processing algorithms? This is the question studied in "Reasoning on Data Partitioning...Leonid Libkin From Communications of the ACM | March 2017
We introduce a framework for reasoning about data partitioning to detect when we can avoid the data reshuffling step.
Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick From Communications of the ACM | March 2017
"HACC: Extreme Scaling and Performance Across Diverse Architectures" describes the Hardware/Hybrid Accelerated Cosmology Code (HACC) framework, which uses a novel...Valentina Salapura From Communications of the ACM | January 2017
In this Research Highlight, we demonstrate the success of HACC on two very different machines, the CPU/GPU system Titan and the BG/Q systems Sequoia and Mira, attaining...Salman Habib, Vitali Morozov, Nicholas Frontiere, Hal Finkel, Adrian Pope, Katrin Heitmann, Kalyan Kumaran, Venkatram Vishwanath, Tom Peterka, Joe Insley, David Daniel, Patricia Fasel, Zarija Lukić From Communications of the ACM | January 2017
As "Jupiter Rising" makes clear, many of the Internet mechanisms for maintaining large-scale networks are suboptimal when the datacenter is largely homogeneous,...Andrew W. Moore From Communications of the ACM | September 2016
We present our approach for overcoming the cost, operational complexity, and limited scale endemic to datacenter networks a decade ago.Arjun Singh, Joon Ong, Amit Agarwal, Glen Anderson, Ashby Armistead, Roy Bannon, Seb Boving, Gaurav Desai, Bob Felderman, Paulie Germano, Anand Kanagala, Hong Liu, Jeff Provost, Jason Simmons, Eiichi Tanda, Jim Wanderer, Urs Hölzle, Stephen Stuart, Amin Vahdat From Communications of the ACM | September 2016
"Verifying Quantitative Reliability for Programs that Execute on Unreliable Hardware" by Carbin et al. addresses challenges related to a bug, how likely it is to...Todd Millstein From Communications of the ACM | August 2016
We present Rely, a programming language that enables developers to reason about the quantitative reliability of an application — namely, the probability that it...Michael Carbin, Sasa Misailovic, Martin C. Rinard From Communications of the ACM | August 2016
Producing reports at the scale of Google Ads, where billions of clicks happen per day, is the challenge addressed by the Mesa system described in "Mesa: A Geo-Replicated...Sam Madden From Communications of the ACM | July 2016
Mesa is a highly scalable analytic data warehousing system that stores critical measurement data related to Google's Internet advertising business. This paper presents...Ashish Gupta, Fan Yang, Jason Govig, Adam Kirsch, Kelvin Chan, Kevin Lai, Shuo Wu, Sandeep Dhoot, Abhilash Rajesh Kumar, Ankur Agiwal, Sanjay Bhansali, Mingsheng Hong, Jamie Cameron, Masood Siddiqi, David Jones, Jeff Shute, Andrey Gubarev, Shivakumar Venkataraman, Divyakant Agrawal From Communications of the ACM | July 2016
"A Fistful of Bitcoins" examines, in the context of Bitcoin, what we could learn by studying the patterns encoded in a complete record of every single financial...Emin GÜn Sirer From Communications of the ACM | April 2016
Bitcoin has the unintuitive property that while the ownership of money is implicitly anonymous, its flow is globally visible. In this paper we explore this unique...Sarah Meiklejohn, Marjori Pomarole, Grant Jordan, Kirill Levchenko, Damon McCoy, Geoffrey M. Voelker, Stefan Savage From Communications of the ACM | April 2016
"Secure Multiparty Computations on Bitcoin" introduces an exciting new idea for how to provide fairness: leverage Bitcoin’s existing infrastructure for distributed...David Wagner From Communications of the ACM | April 2016
In this work, we propose to use Bitcoin to design fully decentralized protocols that are secure even if no trusted third party is available.Marcin Andrychowicz, Stefan Dziembowski, Daniel Malinowski, Ćukasz Mazurek From Communications of the ACM | April 2016
In "Learning to Name Objects," the authors offer a method to determine a basic-level category name for an object in an image.David Forsyth From Communications of the ACM | March 2016
This paper looks at the problem of predicting category labels that mimic how human observers would name objects.Vicente Ordonez, Wei Liu, Jia Deng, Yejin Choi, Alexander C. Berg, Tamara L. Berg From Communications of the ACM | March 2016
The system described in "Pinocchio: Nearly Practical Verifiable Computation" refines an important theoretical advance by Gennaro et al. Together, these two works represent...Michael Mitzenmacher, Justin Thaler From Communications of the ACM | February 2016
We introduce Pinocchio, a built system for efficiently verifying general computations while relying only on cryptographic assumptions.
Bryan Parno, Jon Howell, Craig Gentry, Mariana Raykova From Communications of the ACM | February 2016
"NoDB: Efficient Query Execution on Raw Data Files" investigates extending a DBMS so it can use the file data in situ, without having to load it first.David Maier From Communications of the ACM | December 2015
We here present the design and roadmap of a new paradigm in database systems, called NoDB, which do not require data loading while still maintaining the whole feature...Ioannis Alagiannis, Renata Borovica-Gajic, Miguel Branco, Stratos Idreos, Anastasia Ailamaki From Communications of the ACM | December 2015