Real-Time Systems

, Volume 30, Issue 1–2, pp 105–128 | Cite as

Feasibility Analysis of Real-Time Periodic Tasks with Offsets



The problem of feasibility analysis of asynchronous periodic task sets, where tasks can have an initial offset, is known to be co-NP-complete in the strong sense. A sufficient pseudo-polynomial test has been proposed by Baruah, Howell and Rosier, which consists in analyzing the feasibility of the corresponding synchronous task set (i.e. all offsets are set equal to 0). If the test gives a positive result, then the original asynchronous task set is feasible; else, no definitive answer can be given. In many cases, this sufficient test is too pessimistic, i.e. it gives no response for many feasible task sets.

In this paper, we present a new sufficient pseudo-polynomial test for asynchronous periodic task sets. Our test reduces the pessimism by explicitely considering the offsets in deriving a small set of critical arrival patterns. We show, trough a set of extensive simulations, that our test outperforms the previous sufficient test.


real-time systems scheduling 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Baker, T. 1991. Stack-based scheduling of real-time processes. Journal of Real-Time Systems 3.Google Scholar
  2. Baruah, S., Buttazzo, G., Gorinsky, S., and Lipari, G. 1999. Scheduling periodic task systems to minimize output jitter. In Proceedings of the International Conference on Real-Time Computing Systems and Applications. Hong Kong, pp. 62–69.Google Scholar
  3. Baruah, S., Mok, A., and Rosier, L. 1990a. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of the 11th IEEE Real-Time Systems Symposium. pp. 182–190.Google Scholar
  4. Baruah, S., Rosier, L., and Howell, R. 1990b. Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor. The Journal of Real-Time Systems 2.Google Scholar
  5. Buttazzo, G. 1997. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Boston: Kluwer Academic Publishers.Google Scholar
  6. Cervin, A. 1999. Improved scheduling of control tasks. In Proceedings of the 11th Euromicro Conference on Real-Time Systems. York, UK, pp. 4–10.Google Scholar
  7. Chen, M., and Lin, K. 1990. Dynamic priority ceilings: A concurrency control protocol for real-time systems. Journal of Real-Time Systems 2.Google Scholar
  8. Dertouzos, M. L. 1974. Control robotics: The procedural control of physical processes. Information Processing.Google Scholar
  9. Jeffay, K. 1992. Scheduling sporadic tasks with shared resources in hard-real-time systems. In Proceedings of the 13th IEEE Real-Time Systems Symposium. Phoenix, pp. 89–99.Google Scholar
  10. Leung, J.-T., and Merril, M. 1980. A note on preemptive scheduling of periodic real-time tasks. Information Processing Letters 3(11).Google Scholar
  11. Lipari, G. and Buttazzo, G. 2000. Schedulability analysis of periodic and aperiodic tasks with resource constraints. System Architecture 46: 327–338.CrossRefGoogle Scholar
  12. Liu, C. and Layland, J. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the Association for Computing Machinery 20(1).Google Scholar
  13. Palencia, J., and Gonz’lez Harbour, M. 2003. Offset-based response time analysis of distributed systems scheduled under EDF. In 15th Euromicro Conference on Real-Time Systems. Porto, Portugal.Google Scholar
  14. Pellizzoni, R. and Lipari, G. 2005. Improved schedulability analysis of real-time transactions with earliest deadline scheduling. In Proceedings of the 11th IEEE Real-Time and Embedded Technology and Applications Symposium. San Francisco, California.Google Scholar
  15. Spuri, M. 1996a. Analysis of deadline scheduled real-time systems. Technical Report RR-2772, INRIA, France.Google Scholar
  16. Spuri, M. 1996b. Holistic analysis for deadline scheduled real-time distributed systems. Technical Report RR-2873, INRIA, France.Google Scholar
  17. Tindell, K., Burns, A., and Wellings, A. 1994. An extendible approach for analysing fixed priority hard real-time tasks. Journal of Real Time Systems 6(2): 133–151.CrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.Scuola Superiore S. AnnaPisaItaly

Personalised recommendations