Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimal Schedulingof ImpreciseComputationTasks in the Presenceof Multiple Faults *
 

Summary: Optimal Schedulingof ImpreciseComputationTasks
in the Presenceof Multiple Faults *
Hakan Aydm, Rami Melhem, Daniel Moss6
Department of Computer Science
University of Pittsburgh
Pittsburgh, PA 15260
(aydin,melhem, mosse)@cs.pitt.edu
Abstract
With the advance of applications such as multimedia, im-
agelspeech processing and real-time AI, real-time computing
models allowing to express the "timeliness versus precision"
trade-off are becoming increasingly popular. In the Impre-
cise Computation model, a task is divided into a mandatory
part and an optionalpart. The mandatory part should be com-
pleted by the deadline even under worst-case scenario; how-
ever, the optional part refines the output of a mandatory part
within the limits of the available computing capacity. A non-
decreasing rewardfunction is associated with the execution of
each optionalpart. Since the mandatoryparts have hard dead-
lines, provisions should be taken againstfaults which may oc-

  

Source: Aydin, Hakan - Department of Computer Science, George Mason University

 

Collections: Computer Technologies and Information Sciences; Engineering