Skip to main content
SpringerLink
Log in

Scheduling Real-Time Transactions Using Deferred Preemptive Technique

  • Conference paper
  • First Online:
Proceedings of the Second International Conference on Computer and Communication Technologies

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 380))

Abstract

Preemptions are necessary to obtain feasible schedule for real-time processing. A nonpreemptive scheduler can block higher priority transactions affecting schedulability of the system. This paper presents deferred preemptive technique scheduling algorithm using EDF to overcome the drawbacks of fully preemptive scheduler that substantially reduces number of preemptions in comparison with fully preemptive scheduling.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. Assoc. Comput. Mach. 20(1), 46–61 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  2. Baker, T.P. Stack-based scheduling of real-time processes. Real-Time Syst.: Int. J. Time-Crit. Comput. 3 (1991)

    Google Scholar 

  3. Mok, A.K.: Fundamental design problems of distributed systems for the hard-real-time environment. Ph.D. thesis, Laboratory for Computer Science, Massachusetts Institute of Technology. Available as Technical Report No. MIT/LCS/TR-297 (1983)

    Google Scholar 

  4. Baruah, S., Mok, A.K., Rosier, L.E.: Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of the 11th Real-Time Systems Symposium. IEEE Computer Society Press, Orlando (1990)

    Google Scholar 

  5. Amdani, S.Y., Ali, M.S., Mundada, S.M.: Mathematical model for real time disk scheduling problem. in: Proceedings published in International Journal of Computer Applications® (IJCA) (2012)

    Google Scholar 

  6. Amdani, S.Y., Ali, M.S.: An overview of real-time disk scheduling algorithms. Int. J. Emerg. Technol. 2(1), 126–130 (2011)

    Google Scholar 

  7. Jeffay, K., Stanat, D., Martel, C.: On non-preemptive scheduling of periodic and sporadic tasks. In: Proceedings of the 12th Real-Time Systems Symposium, IEEE Computer Society Press, San Antonio, Dec 1991

    Google Scholar 

  8. George, L., Rivierre, N., Spuri, M.: Preemptive and nonpreemptive real-time uniprocessor scheduling. Tech. Rep. RR—2966, INRIA: Institut National de Recherche en Informatique et en Automatique (1996)

    Google Scholar 

  9. Marinho, J., et al.: Limited pre-emptive global fixed task priority. In: IEEE 34th Real-Time Systems Symposium, pp. 182–191, Dec 2013

    Google Scholar 

  10. Baruah, S., Chakraborty, S.: Schedulability analysis of non-preemptive recurring real-time tasks. In: International Workshop on Parallel and Distributed Real-Time Systems (IPDPS), Rhodes, April 2006

    Google Scholar 

  11. Baruah, S.: The limited-preemption uniprocessor scheduling of sporadic task systems. In: Proceedings of the EuroMicro Conference on Real-Time Systems, IEEE Computer Society Press, Palma de Mallorca, July 2005

    Google Scholar 

  12. Wang, Y., Saksena, M.: Scheduling fixed-priority tasks with preemption threshold. In: Proceedings of the International Conference on Real-time Computing Systems and Applications, IEEE Computer Society (1999)

    Google Scholar 

  13. Regehr, J.: Scheduling tasks with mixed preemption relations for robustness to timing faults. In: Proceedings of the 23rd IEEE Real-Time Systems Symposium, pp. 315–326. IEEE Computer Society, Cancun, Dec 2002

    Google Scholar 

  14. Burns, A. Preemptive priority based scheduling: An appropriate engineering approach. In: Son, S. (ed.) Advances in Real-TimeSystems, pp. 225–248 (1994)

    Google Scholar 

  15. Gopalakrishnan, R., Parulkar, G.: Bringing real-time scheduling theory and practice closer for multimedia computing. In: Proceedings of ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, pp. 1–12, May, 1996

    Google Scholar 

  16. Bril, R., Lukkien, J., Verhaegh, W.: Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption revisited. In: ECRTS ’07: Proceedings of the 19th Euromicro Conference on Real-Time Systems, pp. 269–279. Pisa (2007)

    Google Scholar 

  17. Simonson, J., Patel, J.: Use of preferred preemption points in cache-based real-time systems. In: Proceedings of IEEE International Computer Performance and Dependability Symposium (IPDS), pp. 316–325, April 1995

    Google Scholar 

  18. Wu, Y., Bertogna, M.: Improving task responsiveness with limited preemptions. In: Proceedings of the 14th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA’09. IEEE Press

    Google Scholar 

  19. Yao, G., Buttazzo, G., Bertogna, M.: Bounding the maximum length of non-preemptive regions under fixed priority scheduling. In: Proceedings of IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), IEEE Computer Society Press, Beijing, May–June 2009

    Google Scholar 

  20. Buttazzo, G., Yao, G., Bertogna, M.: Bounding the maximum length of non-preemptive regions under fixed priority scheduling. In: Proceedings of 15th IEEE International Conference Embedded Real-Time Computer System Applications (RTCSA’09), pp. 351–360. Beijing, 24–26 Aug 2009

    Google Scholar 

  21. Baruah, S., Bertogna, M.: Limited preemption EDF scheduling of sporadic task systems. IEEE Trans. Ind. Inform. 6(4), (2010)

    Google Scholar 

  22. Zhu, Y.: Evaluation of scheduling algorithms for real-time disk I/O (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Babasaheb Naik College of Engineering, Pusad, India

    Sohel A. Bhura

  2. Department of Computer Science & Engineering, Prof. Ram Meghe Institute of Technology & Research, Badnera, India

    A. S. Alvi

Authors
  1. Sohel A. Bhura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. S. Alvi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sohel A. Bhura .

Editor information

Editors and Affiliations

  1. Dept. of Computer Science and Engineering, Anil Neerukonda Institute of Technology and Sciences, Vishakapatnam, India

    Suresh Chandra Satapathy

  2. Department of CSE, CMR Technical Campus, Hyderabad, India

    K. Srujan Raju

  3. Computer Science & Engineering, Kalyani University, Nadia, West Bengal, India

    Jyotsna Kumar Mandal

  4. Electronics and Communication Engineering, Shri Ramswaroop Memorial Group of Professional Colleges, Lucknow, Uttar Pradesh, India

    Vikrant Bhateja

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Bhura, S.A., Alvi, A.S. (2016). Scheduling Real-Time Transactions Using Deferred Preemptive Technique. In: Satapathy, S., Raju, K., Mandal, J., Bhateja, V. (eds) Proceedings of the Second International Conference on Computer and Communication Technologies. Advances in Intelligent Systems and Computing, vol 380. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2523-2_61

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2523-2_61

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2522-5

  • Online ISBN: 978-81-322-2523-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation