Using provenance for repeatability

Authors:
Quan Pham;Tanu Malik;Ian Foster
Affiliations:
Department of Computer Science, University of Chicago, Chicago, IL;Computation Institute, University of Chicago and Argonne National Laboratory, Chicago, IL;Department of Computer Science, University of Chicago and Computation Institute, University of Chicago and Argonne National Laboratory, Chicago, IL
Venue:
TaPP'13 Proceedings of the 5th USENIX conference on Theory and Practice of Provenance
Year:
2013

Citing 5
Cited 0

The Open Provenance Model core specification (v1.1)

Future Generation Computer Systems
CDE: using system call interposition to automatically create portable software packages

USENIXATC'11 Proceedings of the 2011 USENIX conference on USENIX annual technical conference
Repeatability and workability evaluation of SIGMOD 2011

ACM SIGMOD Record
Computational reproducibility: state-of-the-art, challenges, and database research opportunities

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
SOLE: linking research papers with science objects

IPAW'12 Proceedings of the 4th international conference on Provenance and Annotation of Data and Processes

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present Provenance-To-Use (PTU), a tool that minimizes computation time during repeatability testing. Authors can use PTU to build a package that includes their software program and a provenance trace of an initial reference execution. Testers can select a subset of the package's processes for a partial deterministic replay--based, for example, on their compute, memory and I/O utilization as measured during the reference execution. Using the provenance trace, PTU guarantees that events are processed in the same order using the same data from one execution to the next. We show the efficiency of PTU for conducting repeatability testing of workflow-based scientific programs.