Skip to main content

2016 | OriginalPaper | Buchkapitel

Scheduling Real-Time Transactions Using Deferred Preemptive Technique

verfasst von : Sohel A. Bhura, A. S. Alvi

Erschienen in: Proceedings of the Second International Conference on Computer and Communication Technologies

Verlag: Springer India

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat 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)MATHMathSciNetCrossRef 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)MATHMathSciNetCrossRef
2.
Zurück zum Zitat Baker, T.P. Stack-based scheduling of real-time processes. Real-Time Syst.: Int. J. Time-Crit. Comput. 3 (1991) Baker, T.P. Stack-based scheduling of real-time processes. Real-Time Syst.: Int. J. Time-Crit. Comput. 3 (1991)
3.
Zurück zum Zitat 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) 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)
4.
Zurück zum Zitat 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) 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)
5.
Zurück zum Zitat 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) 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)
6.
Zurück zum Zitat Amdani, S.Y., Ali, M.S.: An overview of real-time disk scheduling algorithms. Int. J. Emerg. Technol. 2(1), 126–130 (2011) Amdani, S.Y., Ali, M.S.: An overview of real-time disk scheduling algorithms. Int. J. Emerg. Technol. 2(1), 126–130 (2011)
7.
Zurück zum Zitat 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 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
8.
Zurück zum Zitat 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) 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)
9.
Zurück zum Zitat Marinho, J., et al.: Limited pre-emptive global fixed task priority. In: IEEE 34th Real-Time Systems Symposium, pp. 182–191, Dec 2013 Marinho, J., et al.: Limited pre-emptive global fixed task priority. In: IEEE 34th Real-Time Systems Symposium, pp. 182–191, Dec 2013
10.
Zurück zum Zitat 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 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
11.
Zurück zum Zitat 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 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
12.
Zurück zum Zitat 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) 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)
13.
Zurück zum Zitat 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 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
14.
Zurück zum Zitat Burns, A. Preemptive priority based scheduling: An appropriate engineering approach. In: Son, S. (ed.) Advances in Real-TimeSystems, pp. 225–248 (1994) Burns, A. Preemptive priority based scheduling: An appropriate engineering approach. In: Son, S. (ed.) Advances in Real-TimeSystems, pp. 225–248 (1994)
15.
Zurück zum Zitat 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 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
16.
Zurück zum Zitat 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) 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)
17.
Zurück zum Zitat 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 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
18.
Zurück zum Zitat 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 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
19.
Zurück zum Zitat 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 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
20.
Zurück zum Zitat 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 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
21.
Zurück zum Zitat Baruah, S., Bertogna, M.: Limited preemption EDF scheduling of sporadic task systems. IEEE Trans. Ind. Inform. 6(4), (2010) Baruah, S., Bertogna, M.: Limited preemption EDF scheduling of sporadic task systems. IEEE Trans. Ind. Inform. 6(4), (2010)
22.
Zurück zum Zitat Zhu, Y.: Evaluation of scheduling algorithms for real-time disk I/O (2002) Zhu, Y.: Evaluation of scheduling algorithms for real-time disk I/O (2002)
Metadaten
Titel
Scheduling Real-Time Transactions Using Deferred Preemptive Technique
verfasst von
Sohel A. Bhura
A. S. Alvi
Copyright-Jahr
2016
Verlag
Springer India
DOI
https://doi.org/10.1007/978-81-322-2523-2_61

Neuer Inhalt