Profit and Penalty Aware Scheduling for Real-Time Online Services

As computer and Internet technology continue to advance, real-time online services are emerging. Different from traditional real-time applications for which the scheduling objective is to meet task deadlines, the optimization goal for online service systems is to maximize profit obtained through providing timely services. For this class of applications, there are two distinctive characteristics. First, tasks are associated with a pair of time dependent functions representing accrued profit when completed before their deadlines and accrued penalty otherwise, respectively. Second, the service requests or tasks arrive aperiodically with execution time varying in a wide range. This paper presents a novel scheduling method and related analysis for such applications. Two scheduling algorithms, i.e., the nonpreemptive and preemptive Profit and Penalty aware (PP-aware) scheduling algorithms, are proposed with an objective to maximize system's total accrued profit. Our simulation results clearly demonstrate the advantages of the proposed algorithms, with respect to the system total accrued profit, over other commonly used scheduling algorithms, such as Earliest Deadline First (EDF) and Utility Accrual (UA) algorithms.

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

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

[3]  Binoy Ravindran,et al.  On recent advances in time/utility function real-time scheduling and resource management , 2005, Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05).

[4]  David E. Irwin,et al.  Balancing risk and reward in a market-based task service , 2004, Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004..

[5]  Gang Quan,et al.  On-Line Real-Time Service Allocation and Scheduling for Distributed Data Centers , 2011, 2011 IEEE International Conference on Services Computing.

[6]  Mohamed A. Sharaf,et al.  SLA-Aware Adaptive On-demand Data Broadcasting in Wireless Environments , 2009, 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware.

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

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

[9]  Duc T. Nguyen,et al.  Numerical Methods with Applications , 2011 .

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

[11]  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.

[12]  Binoy Ravindran,et al.  Utility Accrual Real-Time Scheduling under Variable Cost Functions , 2007, IEEE Trans. Computers.

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

[14]  Binoy Ravindran,et al.  MSA: a memory-aware utility accrual scheduling algorithm , 2005, SAC '05.

[15]  Haisang Wu,et al.  Energy-Efficient, Utility Accrual Real-Time Scheduling , 2005 .

[16]  Binoy Ravindran,et al.  On the joint utility accrual model , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

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

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

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

[20]  Ragunathan Rajkumar,et al.  On the Scheduling of Mixed-Criticality Real-Time Task Sets , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[21]  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.

[22]  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.

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

[24]  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).

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

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

[27]  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).

[28]  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.

[29]  J.A. Stankovic,et al.  Misconceptions about real-time computing: a serious problem for next-generation systems , 1988, Computer.

[30]  Binoy Ravindran,et al.  Energy-efficient, utility accrual real-time scheduling under the unimodal arbitrary arrival model , 2005, Design, Automation and Test in Europe.

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

[32]  Gang Quan,et al.  On-Line Scheduling of Real-Time Services for Cloud Computing , 2010, 2010 6th World Congress on Services.

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

[34]  Gang Quan,et al.  On-line preemptive scheduling of real-time services with profit and penalty , 2011, 2011 Proceedings of IEEE Southeastcon.

[35]  Binoy Ravindran,et al.  Utility Accrual Scheduling under Arbitrary Time/Utility Functions and Multi-unit Resource Constraints , 2004 .

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

[37]  Xing Wang,et al.  Profit and penalty aware (PP-aware) scheduling for tasks with variable task execution time , 2010, SAC '10.

[38]  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.

[39]  Waleed Meleis,et al.  Algorithms for total weighted completion time scheduling , 1999, SODA '99.

[40]  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..

[41]  Binoy Ravindran,et al.  Utility accrual real-time scheduling for multiprocessor embedded systems , 2010, J. Parallel Distributed Comput..

[42]  Binoy Ravindran,et al.  Garbage Collector Scheduling in Dynamic, Multiprocessor Real-Time Systems , 2009, IEEE Transactions on Parallel and Distributed Systems.

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

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

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