Skip to main content

Dynamic Slack Reclamation with EDL Scheduling for Periodic Multimode Real-Time Task

  • Conference paper
  • 3482 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 405))

Abstract

The multiframe task has been considered in dynamic real-time scheduling, its different execution mode optional feature can handle the resource waste caused by pessimistic estimation of the execution requirement. But in runtime, the selection of an instance execution mode with more execution requirement may cause a deadline miss. In this paper, we propose a slack reclamation mechanism of configuring an appropriate execution mode under deadline guarantee. This mechanism is composed of offline phase and online phase. In offline, the initial execution mode of task instances is selected and the static slack is calculated. In online, on the basis of EDL scheduling list, mode upgrade list and actual execution requirement of the instance, the slack is assigned to the instance with the highest value of the r/R in Slack available zone. Our simulation shows that this scheme can obtain a better result of the accured reward when the task’s BCET is greater than 40% of its WCET.

This work was supported in part by the NSFC (Grant No.61202102, 61173036), Department of Science & Technology of Hunan Province, China (Grant No. 2011GK3131), and Department of Education of Hunan Province( Grant No.CX2011B137).

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lu, C.Y.: Feedback control real-time scheduling, Phd thesis, School of Engineering and Applied Science, Virginia University (2001)

    Google Scholar 

  2. Lin, K.-J., Natarajan, S., Liu, J.W.S.: Imprecise result: Utilizing Partial Computations in Real-Time systems, In: 8th IEEE Symposium on Real-Time Systems, pp. 210–217 (1987)

    Google Scholar 

  3. Dey, J.K., Kurose, J.F., Towsley, D., Krishna, C.M., Girkar, M.: Efficient On-Line Processor Scheduling for a Class of IRIS (Increasing Reward with Increasing Service) Real-Time Tasks. In: Proc. of ACM SIGMETRICS Conf. Measurement and Modeling of Computer Systems, pp. 217–228 (1993)

    Google Scholar 

  4. Mok, A.K., Chen, D.: A multiframe model for real-time tasks. IEEE Trans. Software. Eng. 23(10), 635–645 (1997)

    Article  Google Scholar 

  5. Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 20(1), 46–61 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cam, H.: An on-line scheduling policy for IRIS real-time composite tasks. The Journal of Systems and Software 52, 25–32 (2000)

    Article  Google Scholar 

  7. Feiler, P.H., Walker, J.J.: Adaptive feedback scheduling of incremental and design-to-time tasks. In: Proceedings of the 23rd International Conference on Software Engineering, pp. 318–326 (2001)

    Google Scholar 

  8. Mejia-Alvarez, P., Melhem, R., Mosse, D.: An incremental approach to scheduling during overloads in real-time systems. In: Proceedings of the IEEE Real-Time Systems Symposium (2000)

    Google Scholar 

  9. Moyo, N.T., Nicollet, E., Lafaye, F., Moy, C.: On schedulability analysis of non-cyclic generalized multiframe tasks. In: ECRTS, pp. 271–278 (2010)

    Google Scholar 

  10. Liu, J.W.: Real-Time Systems. Prentice Hall, Upper Saddle River (2000)

    Google Scholar 

  11. Chetto, H., Chetto, M.: Some result of the Earliest Deadline Scheduling Algorithm. IEEE Trans. on Soft. Eng. 15(10), 1261–1269 (1989)

    Article  MathSciNet  Google Scholar 

  12. Park, T., Kim, S.: Dynamic scheduling algorithm and its schedulability analysis for certifiable dual-criticality systems. In: 11th International Conference on Embedded Software, pp. 253–262. ACM (2011)

    Google Scholar 

  13. Niz, D., Lakshmanan, K., Rajkumar, R.: On the scheduling of mixed-criticality realtime task sets. In: Proceedings of the Real-Time Systems Symposium, pp. 291–300. IEEE Computer Society Press (2009)

    Google Scholar 

  14. Aydin, H., Melhem, R., Mossé, D., Alvarez, P.M.: Optimal Reward-Based Scheduling for Periodic Real-Time Tasks. IEEE Transactions on Computers 50(2), 111–130 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, H., Li, R. (2014). Dynamic Slack Reclamation with EDL Scheduling for Periodic Multimode Real-Time Task . In: Li, K., Xiao, Z., Wang, Y., Du, J., Li, K. (eds) Parallel Computational Fluid Dynamics. ParCFD 2013. Communications in Computer and Information Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53962-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-53962-6_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-53961-9

  • Online ISBN: 978-3-642-53962-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics