Title of article
Scheduling imprecise computation tasks with
Author/Authors
Kevin H. -H. Ho، نويسنده , , Joseph Y-T. Leung، نويسنده , , W-D. Wei، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
16
From page
117
To page
132
Abstract
We consider the problem of preemptively scheduling a set of imprecise computation tasks on a single processor, with the added constraint that each optional subtask is either fully executed or entirely discarded. Two performance metrics are considered:
Keywords
Heuristics , Worst-case analysis , Polynomial-time algorithm , Preemptive scheduling , Single processor , Real-time system , Imprecise computation task , NP-hard
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884626
Link To Document