SEARCH
ISTC-CC NEWSLETTER
RESEARCH HIGHLIGHTS
Ling Liu's SC13 paper "Large Graph Processing Without the Overhead" featured by HPCwire.
ISTC-CC provides a listing of useful benchmarks for cloud computing.
Another list highlighting Open Source Software Releases.
Second GraphLab workshop should be even bigger than the first! GraphLab is a new programming framework for graph-style data analytics.
ISTC-CC Abstract
Scalable Dynamic Partial Order Reduction
Int. Conf. on Runtime Verification (RV'12), September 2012.
Jiri Simsa, Randy Bryant, Garth Gibson, and Jason Hickey*
Carnegie Mellon University
*Google, Inc.
Systematic testing, rst demonstrated in small, specialized cases 15 years ago, has matured suciently for large-scale systems de- velopers to begin to put it into practice. With actual deployment come new, pragmatic challenges to the usefulness of the techniques. In this paper we are concerned with scaling dynamic partial order reduction, a key technique for mitigating the state space explosion problem, to very large clusters. In particular, we present a new approach for distributed dynamic partial order reduction. Unlike previous work, our approach is based on a novel exploration algorithm that 1) enables trading space complexity for parallelism, 2) achieves ecient load-balancing through time-slicing, 3) provides for fault tolerance, which we consider a manda- tory aspect of scalability, 4) scales to more than a thousand parallel workers, and 5) is guaranteed to avoid redundant exploration of overlap- ping portions of the state space.
FULL PAPER: pdf
