Communications of the ACM
Research Archive
The Research archive provides access to all Research articles published in past issues of Communications of the ACM.
October 2016
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 by taking advantage of the algebraic properties of the underlying…
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 processing queries, low-latency data stream queries, and iterative…
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
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, and Longest Common Subsequence.