Advertisement

Real-Time Systems

, Volume 2, Issue 4, pp 301–324 | Cite as

Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

  • Sanjoy K. Baruah
  • Louis E. Rosier
  • Rodney R. Howell
Article

Abstract

We investigate the preemptive scheduling of periodic, real-time task systems on one processor. First, we show that when all parameters to the system are integers, we may assume without loss of generality that all preemptions occur at integer time values. We then assume, for the remainder of the paper, that all parameters are indeed integers. We then give, as our main lemma, both necessary and sufficient conditions for a task system to be feasible on one processor. Although these conditions cannot, in general, be tested efficiently (unless P=NP), they do allow us to give efficient algorithms for deciding feasibility on one processor for certain types of periodic task systems. For example, we give a pseudo-polynomial-time algorithm for synchronous systems whose densities are bounded by a fixed constant less than 1. This algorithm represents an exponential improvement over the previous best algorithm. We also give a polynomial-time algorithm for systems having a fixed number of distinct types of tasks. Furthermore, we are able to use our main lemma to show that the feasibility problem for task systems on one processor is co-NP-complete in the strong sence. In order to show this last result, we first show the Simultaneous Congruences Problem to be NP-complete in the strong sense. Both of these last two results answer questions that have been open for ten years. We conclude by showing that for incomplete task systems, that is, task systems in which the start times are not specified, the feasibility problem is ∑ 2 p -complete.

Keywords

Control Engineer Good Algorithm Feasibility Problem Task System Main Lemma 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blazewicz, J. 1987. Selected Topics in Scheduling Theory.Annals of Discrete Mathematics, 31: 1–60.Google Scholar
  2. Baruah, S., Mok, A. and Rosier, L. 1990. Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor. To be presented at the11th Real-Time Systems Symposium, Orlando, Florida, December.Google Scholar
  3. Baruah, S., Rosier, L., Tulchinsky, I. and Varvel, D. 1990. The Complexity of Periodic Maintenance. To be presented at the International Computer Symposium, Hsinchu, Taiwan. Also, submitted for publication.Google Scholar
  4. Coffman, E., Jr. (ed.).Computer and Job-Shop Scheduling Theory. New York: Wiley.Google Scholar
  5. Cook, S. 1971. The Complexity of Theorem-Proving Procedures. InProc. of the 3rd Ann. ACM Symp. on Theory of Computing, pp. 151–158.Google Scholar
  6. Ford, L. and Fulkerson, D. 1962.Flows in Networks. Princeton, NJ: Princeton University Press.Google Scholar
  7. Horn, W. 1974. Some Simple Scheduling Algorithms.Naval Research Logistics Quarterly, 21: 177–185.Google Scholar
  8. Karp, R. 1972. Reducibility Among Combinatorial Problems. In R. Miller and J. Thatcher (eds.),Comlexity of Computer Computations, New York: Plenum Press, pp. 85–103.Google Scholar
  9. Knuth, D. 1981. Seminumerical Algorithms. vol. 2 ofThe Art of Computer Programming. Reading, MA: Addison-Wesley, (2nd ed.).Google Scholar
  10. Labetoulle, J. 1974. Some Theorems on Real-Time Scheduling. In E. Gelenbe and R. Mahl (eds.),Computer Architecture and Networks, Amsterdam: North-Holland, pp. 285–283.Google Scholar
  11. Lenstra, H. 1983. Integer Programming with a Fixed Number of Variables.Mathematics of Operations Research, 8: 538–548.Google Scholar
  12. Leung, H. 1989. A New Algorithm for Scheduling Periodic, Real-Time Tasks.Algorithmica, 4: 209–219.Google Scholar
  13. Liu, C. and Layland, J. 1973. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment.JACM, 20: 46–61.Google Scholar
  14. Leung, J. and Merrill, M. 1980. A Note on Preemptive Scheduling of Periodic, Real-time Tasks.Information Processing Letters, 11: 115–118.Google Scholar
  15. Lawler, E. and Martel, C. 1981. Scheduling Periodically Occurring Tasks on Multiple Processors.Information Processing Letters, 12: 9–12.Google Scholar
  16. Leung, J. and Whitehead, J. 1982. On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks.Performance Evaluation, 2: 237–250.Google Scholar
  17. Mok, A. 1989. Personal communication.Google Scholar

Copyright information

© Kluwer Academic Publishers 1990

Authors and Affiliations

  • Sanjoy K. Baruah
    • 1
  • Louis E. Rosier
    • 1
  • Rodney R. Howell
    • 2
  1. 1.Department of Computer SciencesThe University of Texas at AustinAustinUSA
  2. 2.Department of Computing and Information SciencesKansas State UniversityManhattanUSA

Personalised recommendations