Date of this Version
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.
Creative Commons License
This work is licensed under a Creative Commons Attribution 2.0 License.
Shuo Liu, Gang Quan, and Shangping Ren, “On-Line Real-Time Service-Oriented Task Scheduling Using TUF,” ISRN Software Engineering, vol. 2012, Article ID 681985, 12 pages, 2012. doi:10.5402/2012/681985
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/
This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
This article was originally published in Hindawi ISRN Software Engineering Volume 2012 (2012).