Patterns and statistical analysis for understanding reduced resource computing
Authors:
Open Access
- 17 October 2010
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 45 (10) , 806-821
Abstract
We present several general, broadly applicable mechanisms that enable computations to execute with reduced resources, typically at the cost of some loss in the accuracy of the result they produce.We identify several general computational patterns that interact well with these resource reduction mechanisms, present a concrete manifestation of these patterns in the form of simple model programs, perform simulationbased explorations of the quantitative consequences of applying these mechanisms to our model programs, and relate the model computations (and their interaction with the resource reduction mechanisms) to more complex benchmark applications drawn from a variety of fields.United States. Defense Advanced Research Projects Agency (DARPA) (Cooperative Agreement FA8750-06-2-0189)National Science Foundation (U.S.) (Award 0811397)National Science Foundation (U.S.) (Award 0835652)National Science Foundation (U.S.) (Award 0905244Keywords
This publication has 20 references indexed in Scilit:
- Detecting and eliminating memory leaks using cyclic memory allocation2007
- Probabilistic accuracy bounds for fault-tolerant computations that discard tasks2006
- DieHard2006
- Exploring the acceptability envelope2005
- Data structure repair using goal-directed reasoning2005
- Automatic detection and repair of errors in data structures2003
- Towards robust distributed systems (abstract)2000
- MPEGCommunications of the ACM, 1991
- An axiomatic basis for computer programmingCommunications of the ACM, 1969
- Assigning meanings to programs1967