Skip to main content
SpringerLink
Log in

Scheduling with slack time

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We consider a scheduling problem concerning a set of jobs {J 1, J 2,..., J n } in which the job J i requests C i units of computation time every T i units of time periodically. These jobs are to be executed by a timeshared single-processor computing system. It is assumed that the requests for each job arrive at the system at the beginning of the request periods and that deadline for completion of the requested computation in each period coincides with the beginning of the next period. For a set of jobs that is schedulable by a certain algorithm, the time span between the completion of a request and its deadline is referred to as the slack time of the request. It is shown here that when the set of jobs is scheduled according to the rate monotonic algorithm, the slack time of the first request of any job is no larger than the slack time of any subsequent request of that job. This result enables us to determine lower bounds to slack times of all requests.

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

Access this article

Log in via an institution

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

  1. Dertouzos, M.L.: Control robotics: the procedural control of physical processes. IFIP Proc. 807–813 (1974)

  2. Labetoulle, J.: Some theorems on real time scheduling. Computer architectures and networks, p. 285–298. E. Gelenbe and R. Mahl eds. Amsterdam: North-Holland Publ. Co. 1974

    Google Scholar 

  3. Liu, C.L., J.W. Layland: Scheduling algorithms for multiprogramming in hard-real-time environment. JACM, Jan. 1973, p. 46–61

  4. Serlin, O. : Scheduling of time critical processes. Proc. of the Spring Joint Computer Conference, 1972, pp. 925–932

  5. Dhall, S.K., C.L. Liu: On a real-time scheduling problem. Operations Research, Vol.26, No. 1, 1978, pp. 127–140

    Google Scholar 

  6. Campbell, R.H., K.H. Horton, G.G. Belford: Simulation of a Fault-tolerant deadline mechanism. Proc. of 1979 International Symposium on Fault-Tolerant Computing, June, 1979

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Illinois, 61801, Urbana, Illinois, USA

    C. L. Liu, Jane W. S. Liu & Arthur L. Liestman

Authors
  1. C. L. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jane W. S. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Arthur L. Liestman
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was partially supported by the Office of Naval Research under the Contract Number N00014-79-C-0775 and by NSF-MCS-8107647

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, C.L., Liu, J.W.S. & Liestman, A.L. Scheduling with slack time. Acta Informatica 17, 31–41 (1982). https://doi.org/10.1007/BF00262974

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation