iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1007/BF00365440
Preemptive scheduling with release times and deadlines | Real-Time Systems Skip to main content
Springer Nature Link
Log in

Preemptive scheduling with release times and deadlines

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

We consider the problem of deciding if there is a feasible preemptive schedule for a set of n independent tasks with release times and deadlines on m identical processors. The general problem is known to be solvable in O(n 3) time. In this paper, we study special cases for which faster algorithms exist. We introduce the notion of monotone schedules and study their properties. These properties are then exploited to devise fast algorithms for two special cases—the nested task systems and the non-overlapping task systems. We give an O(n log mn) time algorithm and an O(n log n+mn) time algorithm for nested task systems and non-overlapping task systems, respectively. Our algorithms generate at most O(n) and O(mn) preemptions for nested task systems and nonoverlapping task systems, respectively.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

  • Horn, W. 1974. Some Simple Scheduling Algorithms, Naval Research Logistics Quarterly, 177–185.

  • Martel, C. 1982. Scheduling Uniform Machines with Release Times, Deadlines and Due Times, J. Assoc. Comput. Mach., 812–829.

  • Sahni, S. 1979. Preemptive Scheduling with Due Dates, Oper. Research, 27: 925–934.

    Google Scholar 

  • Sahni, S., and Y. Cho. 1979. Nearly On-line Scheduling of a Uniform System with Release Times, SIAM J. Comput., 275–285.

  • Sahni, S., and Y. Cho. 1980. Scheduling Independent Tasks with Due Times on Uniform Processor System, J. Assoc. Comput. Mach., 27: 550–563.

    Google Scholar 

  • Zhao, W., K. Ramamritham and J.A. Stankovic. 1987. Preemptive Scheduling Under Time and Resource Constraints, IEEE Transactions on Computers, C-36: 949–960.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Program, University of Texas at Dallas, 75080, Richardson, TX, USA

    Kwang Soo Hong & Joseph Y-T. Leung

Authors
  1. Kwang Soo Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joseph Y-T. Leung
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported in part by the ONR grant N00014-87-K-0833.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hong, K.S., Leung, J.YT. Preemptive scheduling with release times and deadlines. The Journal of Real-Time Systems 1, 265–281 (1989). https://doi.org/10.1007/BF00365440

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00365440

Keywords

Search

Navigation