Communications of the ACM
Latest Research
From Communications of the ACM
Technical Perspective: The Power of Parallelizing Computations
"Efficient Parallelization Using Rank Convergence in Dynamic Programming Algorithms" shows how some instances of dynamic programming can be effectively parallelized...
From Communications of the ACM
Efficient Parallelization Using Rank Convergence in Dynamic Programming Algorithms
This paper proposes an efficient parallel algorithm for an important class of dynamic programming problems that includes Viterbi, Needleman-Wunsch, Smith-Waterman...
From Communications of the ACM
Technical Perspective: Naiad
"Incremental, Iterative Data Processing with Timely Dataflow" describes Naiad, which combines three classes of dataflow systems, supporting high-throughput batch...
From Communications of the ACM
Incremental, Iterative Data Processing with Timely Dataflow
We describe the timely dataflow model for distributed computation and its implementation in the Naiad system.
From Communications of the ACM
Technical Perspective: Jupiter Rising
As "Jupiter Rising" makes clear, many of the Internet mechanisms for maintaining large-scale networks are suboptimal when the datacenter is largely homogeneous,...
From Communications of the ACM
Jupiter Rising: A Decade of Clos Topologies and Centralized Control in Google's Datacenter Network
We present our approach for overcoming the cost, operational complexity, and limited scale endemic to datacenter networks a decade ago.
From Communications of the ACM
Technical Perspective: Toward Reliable Programming For Unreliable Hardware
"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...
From Communications of the ACM
Verifying Quantitative Reliability For Programs that Execute on Unreliable Hardware
We present Rely, a programming language that enables developers to reason about the quantitative reliability of an application — namely, the probability that it...
From Communications of the ACM
Technical Perspective: Why Didn't I Think of That?
Until now, the database in a Web application has been treated as a global variable, accessible to all. In "Ur/Web: A Simple Model for Programming the Web," Adam...
From Communications of the ACM
Ur/Web: A Simple Model For Programming the Web
This paper presents Ur/Web, a domain-specific, statically typed functional programming language that reduces the nest of Web standards for modern Web applications...
From Communications of the ACM
Technical Perspective: Combining Logic and Probability
In "Probabilistic Theorem Proving," Gogate and Domingos suggest how PTP could be turned in a fast approximate algorithm by sampling from the set of children of...
From Communications of the ACM
Probabilistic Theorem Proving
Many representation schemes combining first-order logic and probability have been proposed in recent years. We propose the first method that has the full power...
From Communications of the ACM
Technical Perspective: Mesa Takes Data Warehousing to New Heights
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...
From Communications of the ACM
Mesa: A Geo-Replicated Online Data Warehouse For Google's Advertising System
Mesa is a highly scalable analytic data warehousing system that stores critical measurement data related to Google's Internet advertising business. This paper presents...
From Communications of the ACM
Technical Perspective: Computing with the Crowd
What kinds of problems can be solved with combined human and machine computation? "AutoMan: A Platform for Integrating Human-Based and Digital Computation," by...
From Communications of the ACM
Automan: A Platform For Integrating Human-Based and Digital Computation
We introduce AutoMan, the first fully automatic crowdprogramming system.
From Communications of the ACM
Technical Perspective: Veritesting Tackles Path-Explosion Problem
"Enhancing Symbolic Execution with Veritesting" by Avgerinos et al. proposes an effective technique called veritesting that addresses the scalability limitations...
From Communications of the ACM
Enhancing Symbolic Execution with Veritesting
In this article, we present a new technique for generating formulas called veritesting that alternates between static symbolic execution (SSE) and dynamic symbolic...
From Communications of the ACM
Technical Perspective: A Breakthrough in Software Obfuscation
In "Hiding Secrets in Software," Garg et al. construct a "one-way compiler" of the type envisioned by Diffie and Hellman.
From Communications of the ACM