Profit and penalty aware (PP-aware) scheduling for tasks with variable task execution time

As computing devices and the Internet technology advances, real-time on-line services are emerging. Different from traditional real-time applications for which the scheduling objective is to meet task deadlines, the optimization goal for on-line service systems is to maximize profit obtained through providing timely services. For this class of applications, there are two distinctive characteristics: (1) tasks, i.e., client requests, are associated with a pair of unimodal time functions, representing system accrued profit when a task is completed before its deadline, or accrued penalty if otherwise; and (2) requests execution times vary in a wide range. The paper presents a new scheduling algorithm, i.e., the Profit and Penalty aware (PP-aware) scheduling algorithm, with an objective to maximize system's total accrued profit. Our simulation results have empirically shown the advantages, in respect of system total accrued profit, of the proposed algorithm over other commonly used scheduling algorithms, such as Earliest Deadline First (EDF) and Utility Accrual (UA) algorithms.

[1]  Harry G. Perros,et al.  SLA-based resource allocation in cluster computing systems , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[2]  Leen Stougie,et al.  Multiprocessing scheduling with rejection. Proceedings of the seventh annual ACM-SIAM symposium on discrete algorithms (SODA), January 28-30, Atlanta, Georgia, USA, 1996 , 1996 .

[3]  C. D. Locke,et al.  Best-effort decision-making for real-time scheduling , 1986 .

[4]  Binoy Ravindran,et al.  Utility Accrual Real-Time Scheduling under Variable Cost Functions , 2005, IEEE Transactions on Computers.

[5]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.

[6]  Binoy Ravindran,et al.  Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model with Energy Bounds , 2007, IEEE Transactions on Computers.

[7]  Virgílio A. F. Almeida,et al.  Business-oriented resource management policies for e-commerce servers , 2000, Perform. Evaluation.

[8]  Raymond Keith Clark,et al.  Scheduling dependent real-time activities , 1990 .

[9]  Binoy Ravindran,et al.  A utility accrual scheduling algorithm for real-time activities with mutual exclusion resource constraints , 2006, IEEE Transactions on Computers.

[10]  Danilo Ardagna,et al.  SLA based profit optimization in autonomic computing systems , 2004, ICSOC '04.

[11]  Godmar Back,et al.  Automatic memory management in utility accrual scheduling environments , 2006, Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06).

[12]  Harumi A. Kuno,et al.  Surveying the E-Services technical landscape , 2000, Proceedings Second International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems. WECWIS 2000.

[13]  Ken Chen,et al.  A scheduling algorithm for tasks described by Time Value Function , 1996, Real-Time Systems.

[14]  William Timothy Strayer.  Function-driven scheduling: a general framework for expression and analysis of scheduling , 1992 .

[15]  Rajkumar Buyya,et al.  A taxonomy of market-based resource management systems for utility-driven cluster computing , 2006 .

[16]  Petru Eles,et al.  Scheduling of Fault-Tolerant Embedded Systems with Soft and Hard Timing Constraints , 2008, 2008 Design, Automation and Test in Europe.

[17]  Rajkumar Buyya,et al.  A taxonomy of market‐based resource management systems for utility‐driven cluster computing , 2006, Softw. Pract. Exp..

[18]  Binoy Ravindran,et al.  Utility accrual scheduling under joint utility and resource constraints , 2004, Seventh IEEE International Symposium onObject-Oriented Real-Time Distributed Computing, 2004. Proceedings..

[19]  Ophir Frieder,et al.  Prediction of Timing Constraint Violation for Real-Time Embedded Systems with Known Transient Hardware Failure Distribution Model , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[20]  Peng Li,et al.  Utility Accrual Real-Time Scheduling: Models and Algorithms , 2004 .

[21]  Daniel Mossé,et al.  Value-density algorithms to handle transient overloads in scheduling , 1999, Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99.

[22]  Dennis Shasha,et al.  D/sup over/; an optimal on-line scheduling algorithm for overloaded real-time systems , 1992, [1992] Proceedings Real-Time Systems Symposium.

[23]  Binoy Ravindran,et al.  Time-utility function-driven switched Ethernet: packet scheduling algorithm, implementation, and feasibility analysis , 2004, IEEE Transactions on Parallel and Distributed Systems.

[24]  Mark S. Squillante,et al.  On maximizing service-level-agreement profits , 2001, PERV.

[25]  Zuriati Zulkarnain,et al.  Improving utility accrual scheduling algorithm for adaptive real-time System , 2008, 2008 International Symposium on Information Technology.

[26]  Binoy Ravindran,et al.  Lock-Free Synchronization for Dynamic Embedded Real-Time Systems , 2006, Proceedings of the Design Automation & Test in Europe Conference.

[27]  Han Hoogeveen,et al.  Preemptive scheduling with rejection , 2000, Math. Program..

[28]  Petru Eles,et al.  Quasi-static scheduling for real-time systems with hard and soft tasks , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.