research-article

Heuristic scheduling algorithms designed based on properties of optimal algorithm for soft real-time tasks

Authors:

Arezou Mohammadi,

Selim G. AklAuthors Info & Claims

SCSC '07: Proceedings of the 2007 Summer Computer Simulation Conference

Pages 481 - 488

Published: 16 July 2007 Publication History

Abstract

A soft real-time task is one whose completion time is recommended by a specific deadline. However, should the deadline be missed, such a task is not considered to have failed; only the later it finishes, the higher the penalty that is paid. For a set of soft real-time tasks that are to be scheduled on a single machine, our objective is to minimize the total penalty paid. Since the problem is NP-hard, it is not known whether an optimal schedule can be found in polynomial time. We prove four properties of any optimal scheduling algorithm for the problem. Then, we derive a number of heuristic algorithms which hold the properties obtained herein. The heuristic algorithms differ in the way that the tasks priorities are assigned. These algorithms assign priorities by using functions of task execution times, penalty factors or deadlines. Numerical simulations are presented to compare the penalty to be paid by each algorithm.

References

[1]

Arnaout, J. M. and Rabadi, Gh., "Minimizing the toal weighted completion time on unrelated parallel machines with stochastic times," Proceedings of Simulation Conference, Winter 2005.

Digital Library

[2]

Baev, I. D., Meleis, W. M. and Eichenberger, A., "An Experimental Study of Algorithms for Weighted Completion Time Scheduling," Algorithmica, Vol. 33, 2002.

[3]

Baev, I. D., Meleis, W. M. and Eichenberger, A., "Algorithms for Total Weighted Completion Time Scheduling," SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 1999.

Digital Library

[4]

Bertsimas, D., and Tsitsiklis, J. N., Introduction to Linear Optimization, Athena Scientific, February 1997.

Digital Library

[5]

Buttazzo, G. C., Hard Real-Time Computing Systems: predictable scheduling algorithms and applications, Springer company, 2005.

Digital Library

[6]

Buttazzo, G., Lipari, G., Abeni, L., and Caccomo, M., Soft Real-Time Systems, Predictability vs. Efficiency, Springer company, 2005, NY, USA.

Digital Library

[7]

Chekuri, C. and Motwani, R., "Precedence constrained scheduling to minimize weighted completion time on a single machine," Discrete Applied Mathematics, Vol. 98, pp. 29--39, 1999.

Digital Library

[8]

Chekuri, C., Motwani, R., Natarajan, B., and Stein, C., "Approximation techniques for average completion time scheduling," SIAM Journal on Computing, Vol. 31, No. 1, pp. 146--166, 2001.

Digital Library

[9]

Fornaciari, W. and Milano, P. di, "Real Time Operating Systems Scheduling Lecturer," www.eletelet.polimipolimi.it/fornaciait/fornacia.

[10]

Frazer, K., "Real-time Operating System Scheduling Algorithms," 1997.

[11]

Garey, M. R., and Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, January 15, 1979.

Digital Library

[12]

Goemans, M. X., Queyranne, M., Schulz, A. S., Skutella, M., and Wang, Y., "Single Machine Scheduling with Release Dates," 2001.

Digital Library

[13]

Halang, W. A., and Stoyenko, A. D., Real Time Computing, NATO ASI Series, Series F: Computer and Systems Sciences, Volume 127, Springer-Verlag company, 1994.

Digital Library

[14]

Hall, L. A., Schulz, A. S., Shmoys, D. B., and Wein, J., "Scheduling to minimize average completion time: Off-line and on-line approximation algorithms," Mathematics of Operations Research, Vol. 22, pp. 513--544, August 1997.

Digital Library

[15]

Isovic, D., and Fohler, G., "Efficient Scheduling of Sporadic, Aperiodic and Periodic Tasks with Complex Constraints," In Proceedings of the 21st IEEE RTSS, Florida, USA, November, 2000.

Digital Library

[16]

Joseph, M., Real-time Systems: Specification, Verification and Analysis, Prentice Hall, 1996.

[17]

Krishna, C. M., and Shin, K. G., Real-Time Systems, MIT Press and McGraw-Hill Company, 1997.

Digital Library

[18]

Laplante, P. A., "Real-time Systems Design and Analysis, An Engineer Handbook," IEEE Computer Society, IEEE Press, 1993.

Digital Library

[19]

Mohammadi, A., and Akl, S. G., "Scheduling algorithms for real-time systems," Technical Report 2005--499, School of Computing, Queen's University, 2005.

[20]

Savelsbergh, M. W. P., Uma, R. N., and Wein, J., "An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems," INFORMS Journal of Computing, Vol. 17, No. 1, Winter 2005, pp. 123--136.

Digital Library

[21]

Skutella, M., "List Scheduling in Order of alpha-Points on a Single Machine," appeared in a book named "Efficient Approximation and On-line Algorithms" editted by E. Bampis, K. Jansen and C. Kenyon, 2002.

Digital Library

[22]

Stankovic, J. A., and Ramamritham, K., "Tutorial Hard Real-Time Systems," IEEE Computer Society Press, 1988.

Digital Library

Cited By

Wu GXu ZXia QRen JXia F(2010)Task Allocation and Migration Algorithm for Temperature-Constrained Real-Time Multi-Core SystemsProceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing10.1109/GreenCom-CPSCom.2010.27(189-196)Online publication date: 18-Dec-2010
https://dl.acm.org/doi/10.1109/GreenCom-CPSCom.2010.27

Heuristic scheduling algorithms designed based on properties of optimal algorithm for soft real-time tasks

Recommendations

A non-preemptive scheduling algorithm for soft real-time systems

Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring non-preemptive scheduling models for real-time ...
Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible

Optimal online scheduling algorithms are known for sporadic task systems scheduled upon a single processor. Additionally, optimal online scheduling algorithms are also known for restricted subclasses of sporadic task systems upon an identical ...
Analysis on quantum-based fixed priority scheduling of real-time tasks
ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication

Fixed priority schedulers are widely used for real-time systems, and there were efforts to improve the schedulability. Preemption threshold scheduling is one of such efforts with a dual priority scheme. It increases the schedulability by introducing ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

SCSC '07: Proceedings of the 2007 Summer Computer Simulation Conference

July 2007

1363 pages

ISBN:1565553160

General Chair:
Gabriel A. Wainer
Carleton University

Sponsors

SCS: Society for Modeling and Simulation International

In-Cooperation

SIGSIM: ACM Special Interest Group on Simulation and Modeling

Publisher

Society for Computer Simulation International

San Diego, CA, United States

Publication History

Published: 16 July 2007

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SCSC07

Sponsor:

SCS

SCSC07: 2007 Summer Computer Simulation Conference

July 16 - 19, 2007

California, San Diego

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
239
Total Downloads

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

Reflects downloads up to 18 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wu GXu ZXia QRen JXia F(2010)Task Allocation and Migration Algorithm for Temperature-Constrained Real-Time Multi-Core SystemsProceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing10.1109/GreenCom-CPSCom.2010.27(189-196)Online publication date: 18-Dec-2010
https://dl.acm.org/doi/10.1109/GreenCom-CPSCom.2010.27

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