The Anytime Automaton Joshua San Miguel Natalie Enright Jerger Summary We propose the Anytime Automaton: A new computation model for approximate computing. 2 Summary We propose the Anytime Automaton: A new computation model for approximate computing. quality final output application execution 3 Summary We propose the Anytime Automaton: A new computation model for approximate computing. quality final output application execution 4 Approximate Computing Many applications are inherently noisy and imprecise. Data mining Computer vision Audio and video processing http://www.zentut.com/ http://www.cc.gatech.edu/~cnieto6/ http://themusicparlour.blogspot.ca/ Gaming Machine learning Dynamical simulation http://www.businessweek.com/ http://www.analyticbridge.com/ http://www.scientific-computing.com/ 5 Approximate Computing Many applications are inherently noisy and imprecise. Data mining Computer vision Audio and video processing But how can we apply approximate computing techniques and still ensure http://www.zentut.com/ http://www.cc.gatech.edu/~cnieto6/ http://themusicparlour.blogspot.ca/ Gaming acceptabMiliatchyi nien le fairnninagl outpuDty?n amical simulation http://www.businessweek.com/ http://www.analyticbridge.com/ http://www.scientific-computing.com/ 6 Approximate Computing program () { foos_on_first(); bars_on_second(); hello_worlds_on_third(); } foos_on_first bars_on_second hello_worlds_on_third time 7 Approximate Computing program () { approx_foos_on_first(); bars_on_second(); hello_worlds_on_third(); } foos_on_first bars_on_second hello_worlds_on_third time tune quality (runtime-quality tradeoff) 8 Approximate Computing program () { approx_foos_on_first(); bars_on_second(); hello_worlds_on_third(); } foos_on_first bars_on_second hello_worlds_on_third time tune quality (runtime-quality tradeoff) 9 Approximate Computing program () { approx_foos_on_first(); approx_bars_on_second(); hello_worlds_on_third(); } foos_on_first bars_on_second hello_worlds_on_third time tune quality 10
Description: