Skip to main content
SpringerLink
Log in

An intuitive formal proof for Deadline Driven Scheduler

  • Correspondence
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

This paper presents another formal proof for the correctness of the Deadline Driven Scheduler (DDS). This proof is given in terms of Duration Calculus which provides abstraction for random preemption of processor. Compared with other approaches, this proof relies on many intuitive facts. Therefore this proof is more intuitive, while it is still formal.

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. Liu C L, Layland J W. Scheduling algorithm for multiprogramming in a hard real-time environment.Journal of the ACM, 1973, 20(1): 46–61.

    Article  MATH  MathSciNet  Google Scholar 

  2. Zheng Yuhua, Zhou Chaochen. A formal proof of the deadline driven scheduler. InFormal Techniques in Real-Time and Fault-Tolerant Systems, Langmack H, de Roever W-P, Vytopil J (eds.), Volume 863 of LNCS, Springer-Verlag, 1994, pp.756–775.

  3. Dutertre B. On first order interval temporal logic. Technical Report, No.CSD-TR-94-3, Department of Computer Science, Royal Holloway, University of London, Eghan, Surrey TW20 0EX, England, 1995.

    Google Scholar 

  4. Zhou Chaochen, Hoare C A R, Ravn A P. A calculus of durations.Information Processing Letters, 1991, 40(5): 269–276.

    Article  MATH  MathSciNet  Google Scholar 

  5. Hansen M R, Zhou Chaochen. Duration calculus: Logical foundations.Formal Aspects of Computing, 1997, 9(3): 283–334.

    Article  MATH  Google Scholar 

  6. Sheila A Karipel, Dang Van Hung. A hard real-time system. Technical Report, No.148, UNU/IIST, P.O.Box 3058, Macau, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Computer Science and Technology, Institute of Software, The Chinese Academy of Sciences, 100080, Beijing, P.R. China

    Zhan Naijun

Authors
  1. Zhan Naijun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhan Naijun.

Additional information

The work is partially supported by UNU/IIST, and was done during the author’s stay at UNU/IIST (July 1998 to August 1999), and partially supported by the National Natural Science Foundation of China under grant No.69873003.

ZHAN Naijun was born in 1971. He is a Ph.D. candidate registered in Institute of Software, The Chinese Academy of Sciences. He got the B.S. degree from Department of Mathematics, Nanjing University in 1993, and the M.S. degree from Department of Computer Science and Technology, Nanjing University in 1996. His research interests include formal method, object-oriented, programming languages, real-time systems.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhan, N. An intuitive formal proof for Deadline Driven Scheduler. J. Comput. Sci. & Technol. 16, 146–158 (2001). https://doi.org/10.1007/BF02950419

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation