Coalescing Executions For Fast Uncertainty Analysis

Title
Coalescing Executions For Fast Uncertainty Analysis
Authors
Venue
ICSE 2011, 14%=62/441

Uncertain data processing is critical in a wide range of applications such as scientific computation handling data with inevitable errors and financial decision making relying on human provided parameters. While increasingly studied in the area of databases, uncertain data processing is often carried out by software, and thus software based solutions are attractive. In particular, Monte Carlo (MC) methods execute software with many samples from the uncertain inputs and observe the statistical behavior of the output. In this paper, we propose a technique to improve the cost-effectiveness of MC methods. Assuming only part of the input is uncertain, the certain part of the input always leads to the same execution across multiple sample runs. We remove such redundancy by coalescing multiple sample runs in a single run. In the coalesced run, the program operates on a vector of values if uncertainty is present and a single value otherwise. We handle cases where control flow and pointers are uncertain. Our results show that we can speed up the execution time of 30 sample runs by an average factor of 2.3 without precision lost or by up to 3.4 with negligible precision lost.

[doi] [pdf] [slides]
@inproceedings{DBLP:conf/icse/SumnerBZP11,
  author    = {William N. Sumner and
               Tao Bao and
               Xiangyu Zhang and
               Sunil Prabhakar},
  title     = {Coalescing executions for fast uncertainty analysis},
  booktitle = {ICSE},
  year      = {2011},
  pages     = {581-590},
  ee        = {http://doi.acm.org/10.1145/1985793.1985872},
  crossref  = {DBLP:conf/icse/2011},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}