Algorithms for total weighted completion time scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Surveying the E-Services Technical Landscape
WECWIS '00 Proceedings of the Second International Workshop on Advance Issues of E-Commerce and Web-Based Information Systems (WECWIS 2000)
Best-effort decision-making for real-time scheduling
Best-effort decision-making for real-time scheduling
Scheduling dependent real-time activities
Scheduling dependent real-time activities
Balancing Risk and Reward in a Market-Based Task Service
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Energy-Efficient, Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Utility Accrual Real-Time Scheduling under Variable Cost Functions
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
IEEE Transactions on Computers
Utility accrual real-time scheduling: models and algorithms
Utility accrual real-time scheduling: models and algorithms
Energy-efficient, utility accrual real-time scheduling
Energy-efficient, utility accrual real-time scheduling
netWorker - Cloud computing: PC functions move onto the web
Profit and penalty aware (PP-aware) scheduling for tasks with variable task execution time
Proceedings of the 2010 ACM Symposium on Applied Computing
| Hi-index | 0.00 |
In this paper, we study a new family of real-time service oriented scheduling problems. The real time tasks are scheduled non preemptively with the objective of maximizing the total utility. Different from the traditional utility accrual scheduling problem that each task is associated with only a single time utility function (TUF), two different TUFs---a profit TUF and a penalty TUF---are associated 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. We present two scheduling heuristics to 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 scheduling algorithms and an earlier scheduling approach based on a similar model.