skip to main content
article

Opportunistic scheduling in a constraint-rich world

Published: 01 April 2005 Publication History

Abstract

The latest planners and schedulers allow expressive domain modelling and problem definition, particularly with respect to the inclusion of constrained resource usage and inter-task dependencies. This increased complexity removes the ability to guarantee schedulability of a problem at run-time.In hard real-time systems, where 'hard' emphasizes the critical nature of meeting task deadines, the estimated worst-case execution time is used in the task representation. If a solely static framework is used to schedule these systems, the pessimism in the prediction of task execution times will lead to unused resources.This paper describes a framework to include a local dynamic scheduler with a large-scale planner or scheduler. The local scheduler can take advantage of any unused resources by scheduling additional task sets. It can also handle online plan repair by switching between different quality levels of tasks.

References

[1]
{1} M. Fox and D. Long, "The 3rd international planning competition: Results and analysis," in Journal of Artificial Intelligence Research, vol. 20, 2003, pp. 1-59.
[2]
{2} M. Fox and D. Long, "PDDL2.1 : An extension to PDDL for expressing temporal planning domains," University of Durham, UK, Tech. Rep., April 2003.
[3]
{3} S. Poledna, A. Burns, A. Wellings, and P. Barrett, "Replica determinism and flexible scheduling in hard real-time dependable systems," in IEEE transactions on computers, vol. 49(2), February 2000.
[4]
{4} M. Littman and H. L. S. Younes, "Introduction to the probabilistic track," 4th International Planning Conference Special Issue, Tech. Rep., June 2004.
[5]
{5} M. Drummond, J. Bresina, and K. Swanson, "Just-in-case scheduling," in AAAI-94, 1994.
[6]
{6} M. Fox and D. Long, "Single-trajectory opportunistic planning under uncertainty," in Proceedings of the 3rd International NASA Workshop on Planning and Scheduling for Space, 2002.
[7]
{7} L. Sha, R. Rajkumar, and J. P. Lehoczky, "Priority inheritance protocols: An approach to real-time synchronization," in IEEE Transactions on Computers, vol. 39(9), 1990, pp. 1175-1185.
[8]
{8} M.-L. Chen and K.-J. Lin, "Dynamic priority ceilings: A concurrency control protocol for real-time systems," in Real Time Systems Journal, vol. 2(4), 1990, pp. 325-346.
[9]
{9} P. Pedro and A. Burns, "Schedulability analysis for mode changes in flexible real-time systems," in 10th Euromicro Workshop on Real-Time Systems, Berlin, June 1998.
[10]
{10} H. Marchand and E. Rutten, "Managing multi-mode tasks with time cost and quality levels using optimal discrete control synthesis," in 14th Euromicro Conference on Real-Time Systems (ECRTS'02), June 2002.
[11]
{11} N. Audsley, A. Burns, and M. Richardson, "Applying new scheduling theory to static priority pre-emptive scheduling," in Software Engineering Journal, vol. 8(5), September 1993, pp. 284-292.
[12]
{12} J. Y. T. Leung and J. Whitehead, "On the complexity of fixed-priority scheduling of periodic real-time tasks," in Performance Evaluation, vol. 2, 1982, pp. 37-250.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGBED Review
ACM SIGBED Review  Volume 2, Issue 2
Special issue: IEEE RTAS 2005 work-in-progress
April 2005
42 pages
EISSN:1551-3688
DOI:10.1145/1121788
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 2005
Published in SIGBED Volume 2, Issue 2

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 81
    Total Downloads
  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media