摘要：We present our approach to real-time
service-oriented scheduling problems with the objective of
maximizing the total system utility. Different from the traditional
utility accrual scheduling problems that each task is associated
with only a single time utility function (TUF), we associate two
different TUFs—a profit TUF and a penalty TUF—with each
task, to model the real-time services that not only need to reward
the early completions but also need to penalize the abortions or
deadline misses. The scheduling heuristics we proposed in this
paper judiciously accept, schedule, and abort real-time services
when necessary to maximize the accrued utility. Our extensive
experimental results show that our proposed algorithms can
significantly outperform the traditional scheduling algorithms
such as the Earliest Deadline First (EDF), the traditional utility
accrual (UA) scheduling algorithms, and an earlier scheduling
approach based on a similar model.
