research-article

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

Authors:

Xing WangAuthors Info & Claims

SAC '10: Proceedings of the 2010 ACM Symposium on Applied Computing

Pages 334 - 339

https://doi.org/10.1145/1774088.1774159

Published: 22 March 2010 Publication History

Abstract

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.

References

[1]

Idawaty Ahmad, Mohamad Othman, and Zuriati Zulkarnain. Improving utility accrual scheduling algorithm for adaptive real-time system. In Intl. Symposium on Information Technology, volume 1, pages 1--5, Aug. 2008.

[2]

F. Casati and M. Shan. Definition, execution, analysis and optimization of composite e-service. IEEE Data Engineering, 2001.

[3]

K. Chen and P. Muhlethaler. A scheduling algorithm for tasks described by time value function. Journal of Real-Time Systems, 10(3):293--312, May 1996.

Digital Library

[4]

H. Cho, B. Ravindran, and E. D. Jensen. Lock-free synchronization for dynamic embedded real-time systems. ACM TECS, 2008.

Digital Library

[5]

R. K. Clark. Scheduling dependent real-time activities. PhD thesis, CMU, 1990.

Digital Library

[6]

L. A. Cortes, P. Eles, and Zebo Peng. Quasi-static scheduling for real-time systems with hard and soft tasks. In Design, Automation and Test in Europe Conference and Exhibition, 2004. Proceedings, volume 2, pages 1176--1181 Vol. 2, Feb. 2004.

Digital Library

[7]

S. Feizabadi and G. Back. Automatic memory management in utility accrual scheduling environments. In ISORC, pages 11--19, 2006.

Digital Library

[8]

H. Hoogeveen, M. Skutella, and G. J. Woeginger. Preemptive scheduling with rejection. Algorithms, 2002.

Digital Library

[9]

V. Izosimov, P. Pop, P. Eles, and Zebo Peng. Scheduling of fault-tolerant embedded systems with soft and hard timing constraints. In DATE'08, pages 915--920, 2008.

Digital Library

[10]

E. D. Jensen, C. D. Locke, and H. Tokuda. A time-driven scheduling model for real-time systems. In IEEE Real-Time Systems Symposium, 1985.

[11]

G. Koren and D. Shasha. D-over: An optimal on-line scheduling algorithm for overloaded real-time systems. In RTSS'92, pages 290--299, 1992.

[12]

H. Kuno. Surveying the e-services technical landscape. In 2nd International Workshop on Advanced Issues of E-Commerce and Web-based Information Systems, 2000.

Digital Library

[13]

P. Li. Accrual Real-Time Scheduling: Models and Algorithms. PhD thesis, Virginia Polytechnic Institute and State University, 2004.

Digital Library

[14]

P. Li, Hi. Wu, Binoy Ravindran, and E. D. Jensen. A utility accrual scheduling algorithm for real-time activities with mutual exclusion resource constraints. IEEE Transactions on Computers, 55(4):454--469, 2006.

Digital Library

[15]

Z. Liu, M. S. Squillante, and J. L. Wolf. On maximizing service-level-agreement profits. In 3rd ACM Conference on Electronic Commerce, 2001.

Digital Library

[16]

C. D. Locke. Best-effort decision making for real-time scheduling. PhD thesis, CMU, 1986.

Digital Library

[17]

D. A. Menasce, V. A. F. Almeida, and M. A. Mendes. Business-oriented resource management policies for e-commerce server. Performance Evaluation, 42:223--229, 2000.

Digital Library

[18]

D. Mosse, M. E. Pollack, and Y. Ronen. Value-density algorithm to handle transient overloads in scheduling. In ECRTS, pages 278--286, 1999.

[19]

W. T. Strayer. Function-driven scheduling: A general framework for expressing and analysis of scheduling. PhD thesis, University of Virginia, 1992.

Digital Library

[20]

J. Wang and B. Ravindran. Time-utility function-driven switched ethernet packet scheduling algorithm, implementation, and feasibility analysis. IEEE TPDS, 15(1):1--15, 2004.

Digital Library

[21]

H. Wu, B. Ravindran, and E. D. Jensen. Utility accrual real-time scheduling under the unimodal arbitrary arrival model with energy bounds. IEEE Transactions on Computers, 56(10), 2007.

Digital Library

[22]

Haisang Wu, Umut Balli, Binoy Ravindran, and E. D. Jensen. Utility accrual real-time scheduling under variable cost functions. In RTCSA'05, pages 213--219, 2005.

Digital Library

[23]

Haisang Wu, Binoy Ravindran, and E. Douglas Jensen. Utility accrual scheduling under joint utility and resource constraints. In ISORC'04, 2004.

[24]

Kaiqi Xiong and H. Perros. Sla-based resource allocation in cluster computing systems. In IPDPS'08, 2008.

[25]

Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. S gall, and L. Stougie. Multiprocessor scheduling with rejection. In SODA'96, pages 95--103, 1996.

Digital Library

[26]

Chee Shin Yeo and Rajkumar Buyya. A taxonomy of market-based resource management systems for utility-driven cluster computing. Software Practice and Experience, 36:1381--1489, 2006.

Digital Library

[27]

Y. Yu, S. Ren, and O. Frieder. Prediction of timing constraint violation for real-time embedded systems with known transient hardware fault distribution model. In Proceedings of IEEE Real-Time System Symposium, 2007.

Digital Library

[28]

L. Zhang and D. Ardagan. Sla based profit optimization in autonomic computing systems. In Proceedings of the 2nd International Conference on Service Oriented Computing, 2004.

Digital Library

Cited By

Behal ASandhu JGupta G(2023)Using The Cooja Simulator, Analysing The Routing Protocol (RPL) For Low Power And Lossy Networks In IoT2023 IEEE International Students' Conference on Electrical, Electronics and Computer Science (SCEECS)10.1109/SCEECS57921.2023.10061823(1-4)Online publication date: 18-Feb-2023
https://doi.org/10.1109/SCEECS57921.2023.10061823
Behal ASandhu JGupta G(2023)Cooja Simulator and Wireshark Traffic Capturing Are Used To Analyse User Datagram Protocol Communication For Low Power And Lossy Networks in IoT2023 International Conference for Advancement in Technology (ICONAT)10.1109/ICONAT57137.2023.10080778(1-4)Online publication date: 24-Jan-2023
https://doi.org/10.1109/ICONAT57137.2023.10080778
Behal AManzoor G(2023)Contiki Based Routing Protocol (RPL) Analysis Using IPV6 Sensor Networks For IoT With Low Power And Lossy Networks2023 IEEE 8th International Conference for Convergence in Technology (I2CT)10.1109/I2CT57861.2023.10126366(1-3)Online publication date: 7-Apr-2023
https://doi.org/10.1109/I2CT57861.2023.10126366
Show More Cited By

Recommendations

On-line scheduling of real-time services with profit and penalty
SAC '11: Proceedings of the 2011 ACM Symposium on Applied Computing

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 ...
Preference-oriented fixed-priority scheduling for periodic real-time tasks

A preference priority assignment (PPA) scheme that explicitly incorporates the ASAP and ALAP execution preferences of periodic real-time tasks is proposed.An online dual-queue based preference-oriented fixed- priority (POFP) scheduler is proposed 4, ...
Impact of task duplication on static-scheduling performance in multiprocessor systems with variable execution-time tasks
Special Issue: Proceedings of the 4th international conference on Supercomputing

The problem of scheduling a set of partially ordered tasks on a nonpreemptive multiprocessor system of identical processors assuming that the execution time of some tasks can vary within a set of known values is studied in an effort to construct a more ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SAC '10: Proceedings of the 2010 ACM Symposium on Applied Computing

March 2010

2712 pages

ISBN:9781605586397

DOI:10.1145/1774088

Conference Chairs:
Sung Y. Shin
South Dakota State University
,
Sascha Ossowski
University Rey Juan Carlos, Spain
,
Michael Schumacher
University of Applied Sciences Western Switzerland, Switzerland
,
Program Chairs:
Mathew J. Palakal
Indiana University Purdue University
,
Chih-Cheng Hung
Southern Polytechnic State University

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 March 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Division of Computer and Network Systems

Conference

SAC'10

Sponsor:

SIGAPP

SAC'10: The 2010 ACM Symposium on Applied Computing

March 22 - 26, 2010

Sierre, Switzerland

Acceptance Rates

SAC '10 Paper Acceptance Rate 364 of 1,353 submissions, 27%;

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
280
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Behal ASandhu JGupta G(2023)Using The Cooja Simulator, Analysing The Routing Protocol (RPL) For Low Power And Lossy Networks In IoT2023 IEEE International Students' Conference on Electrical, Electronics and Computer Science (SCEECS)10.1109/SCEECS57921.2023.10061823(1-4)Online publication date: 18-Feb-2023
https://doi.org/10.1109/SCEECS57921.2023.10061823
Behal ASandhu JGupta G(2023)Cooja Simulator and Wireshark Traffic Capturing Are Used To Analyse User Datagram Protocol Communication For Low Power And Lossy Networks in IoT2023 International Conference for Advancement in Technology (ICONAT)10.1109/ICONAT57137.2023.10080778(1-4)Online publication date: 24-Jan-2023
https://doi.org/10.1109/ICONAT57137.2023.10080778
Behal AManzoor G(2023)Contiki Based Routing Protocol (RPL) Analysis Using IPV6 Sensor Networks For IoT With Low Power And Lossy Networks2023 IEEE 8th International Conference for Convergence in Technology (I2CT)10.1109/I2CT57861.2023.10126366(1-3)Online publication date: 7-Apr-2023
https://doi.org/10.1109/I2CT57861.2023.10126366
De la Prieta FHeras SPalanca JRodríguez SBajo JJulián V(2015)Real-time agreement and fulfilment of SLAs in Cloud Computing environmentsAI Communications10.3233/AIC-14062628:3(403-426)Online publication date: 17-Jul-2015
https://doi.org/10.3233/AIC-140626
Upadhye GDange T(2014)Cloud resource allocation as non-preemptive approachSecond International Conference on Current Trends In Engineering and Technology - ICCTET 201410.1109/ICCTET.2014.6966314(352-356)Online publication date: Jul-2014
https://doi.org/10.1109/ICCTET.2014.6966314
Ös MBressan G(2014)A Community Cloud for a Real-Time Financial Application - Requirements, Architecture and MechanismsAlgorithms and Architectures for Parallel Processing10.1007/978-3-319-11197-1_28(364-377)Online publication date: 2014
https://doi.org/10.1007/978-3-319-11197-1_28
Humayoo MZhai YHe YXu BWang C(2014)Operator Scale Out Using Time Utility Function in Big Data Stream ProcessingProceedings of the 9th International Conference on Wireless Algorithms, Systems, and Applications - Volume 849110.1007/978-3-319-07782-6_6(54-65)Online publication date: 23-Jun-2014
https://dl.acm.org/doi/10.1007/978-3-319-07782-6_6
Li SMiao Song Zheng Li Ren SQuan G(2013)Maximizing online service profit for time-dependent applications2013 IEEE 19th International Conference on Embedded and Real-Time Computing Systems and Applications10.1109/RTCSA.2013.6732237(342-345)Online publication date: Aug-2013
https://doi.org/10.1109/RTCSA.2013.6732237
Santhosh RRavichandran T(2013)Pre-emptive scheduling of on-line real time services with task migration for cloud computing2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering10.1109/ICPRIME.2013.6496485(271-276)Online publication date: Feb-2013
https://doi.org/10.1109/ICPRIME.2013.6496485
Li SRen SYu YWang XWang LQuan G(2012)Profit and Penalty Aware Scheduling for Real-Time Online ServicesIEEE Transactions on Industrial Informatics10.1109/TII.2011.21724478:1(78-89)Online publication date: Feb-2012
https://doi.org/10.1109/TII.2011.2172447
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents