Skip to main content

Response Time Analysis of Typed DAG Tasks for G-FP Scheduling

  • Conference paper
  • First Online:
Dependable Software Engineering. Theories, Tools, and Applications (SETTA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 11951))

Abstract

With the increasing trend towards using multi-cores architecture for embedded systems, the study of parallel tasks on the heterogeneous platform becomes attractive and desirable in the literature. Although several work studying parallel task models has been proposed, the problem of precise scheduling analysis for the multiprocessor case has largely remained open. To this end, this paper concentrates on analyzing the response time for typed DAG real-time tasks scheduled on a multiprocessor platform under global fixed priority scheduling. Firstly, we use the state-of-the-art method of the single typed DAG task to bound the intra-interference. Second, we use an efficient but pessimistic way to bound the carry-in interference for a higher priority task. And we also propose a new technique based on the decomposition tree method to bound the carry-out interference. Finally, we use the classic sliding technique to bound the inter-interference of each higher priority task. Experimental evaluation validates the performance and efficiency of the proposed approach by comparing with other methods.

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

Access this chapter

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

Notes

  1. 1.

    By a non-self-sustainable analysis method, a system decided to be schedulable may be decided to be unschedulable when the system parameters become better.

  2. 2.

    In case \(G_i\) has multiple source/sink vertices, one can add a dummy source/sink vertex to make it compliant with our model.

References

  1. Baruah, S.: Improved multiprocessor global schedulability analysis of sporadic DAG task systems. In: 26th Euromicro Conference on Real-Time Systems, ECRTS 2014, Madrid, Spain, 8–11 July 2014, pp. 97–105. IEEE Computer Society (2014)

    Google Scholar 

  2. Baruah, S.: The federated scheduling of constrained-deadline sporadic DAG task systems. In: Nebel, W., Atienza, D. (eds.) Proceedings of the 2015 Design, Automation & Test in Europe Conference & Exhibition, DATE 2015, Grenoble, France, 9–13 March 2015, pp. 1323–1328. ACM (2015)

    Google Scholar 

  3. Baruah, S.: Federated scheduling of sporadic DAG task systems. In: 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, 25–29 May 2015, pp. 179–186. IEEE Computer Society (2015)

    Google Scholar 

  4. Baruah, S.: The federated scheduling of systems of conditional sporadic DAG tasks. In: Girault, A., Guan, N. (eds.) 2015 International Conference on Embedded Software, EMSOFT 2015, Amsterdam, Netherlands, 4–9 October 2015, pp. 1–10 IEEE (2015)

    Google Scholar 

  5. Bonifaci, V., Marchetti-Spaccamela, A., Stiller, S., Wiese, A.: Feasibility analysis in the sporadic DAG task model. In: 25th Euromicro Conference on Real-Time Systems, ECRTS 2013, Paris, France, 9–12 July 2013, pp. 225–233. IEEE Computer Society (2013)

    Google Scholar 

  6. Fonseca, J., Nelissen, G., Nélis, V.: Improved response time analysis of sporadic DAG tasks for global FP scheduling. In: Proceedings of the 25th International Conference on Real-Time Networks and Systems - RTNS. ACM Press (2017)

    Google Scholar 

  7. Fonseca, J.C., Nelissen, G., Nélis, V., Pinho, L.M.: Response time analysis of sporadic DAG tasks under partitioned scheduling. In: 11th IEEE Symposium on Industrial Embedded Systems, SIES 2016, Krakow, Poland, 23–25 May 2016, pp. 290–299. IEEE (2016)

    Google Scholar 

  8. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45, 1563–1581 (1966)

    Article  Google Scholar 

  9. Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 416–429 (1969)

    Article  MathSciNet  Google Scholar 

  10. Han, M., Guan, N., Sun, J., He, Q., Deng, Q., Liu, W.: Response time bounds for typed dag parallel tasks on heterogeneous multi-cores. IEEE Trans. Parallel Distrib. Syst. 30, 1–17 (2019)

    Article  Google Scholar 

  11. Han, M., Zhang, T., Deng, Q.: Bounding carry-in interference for synchronous parallel tasks under global fixed-priority scheduling. J. Syst. Arch. 90(2018), 34–43 (2018)

    Article  Google Scholar 

  12. Jaffe, J.M.: Bounds on the scheduling of typed task systems. SIAM J. Comput. 9(3), 541–551 (1980)

    Article  MathSciNet  Google Scholar 

  13. Li, J., Chen, J.-J., Agrawal, K., Lu, C., Gill, C., Saifullah, A.: Analysis of federated and global scheduling for parallel real-time tasks. In: 26th Euromicro Conference on Real-Time Systems, ECRTS 2014, Madrid, Spain, 8–11 July 2014, pp. 85–96. IEEE Computer Society (2014)

    Google Scholar 

  14. Li, J., Ferry, D., Ahuja, S., Agrawal, K., Gill, C.D., Chenyang, L.: Mixed-criticality federated scheduling for parallel real-time tasks. Real-Time Syst. 53(5), 760–811 (2017)

    Article  Google Scholar 

  15. Maia, C., Bertogna, M., Nogueira, L., Pinho, L.M.: Response-time analysis of synchronous parallel tasks in multiprocessor systems. In: Proceedings of the 22nd International Conference on Real-Time Networks and Systems - RTNS. ACM Press (2014)

    Google Scholar 

  16. Melani, A., Bertogna, M., Bonifaci, V., Marchetti-Spaccamela, A., Buttazzo, G.C.: Response-time analysis of conditional DAG tasks in multiprocessor systems. In: 27th Euromicro Conference on Real-Time Systems, ECRTS 2015, Lund, Sweden, 8–10 July 2015, pp. 211–221. IEEE Computer Society (2015)

    Google Scholar 

  17. Nelissen, G., Fonseca, J., Raravi, G., Nelis, V.: Timing analysis of fixed priority self-suspending sporadic tasks (2015)

    Google Scholar 

  18. OMAP (2018). https://en.wikipedia.org/wiki/OMAP

  19. Tegra Processors (2018). https://www.nvidia.com/object/tegra.html

  20. Zynq-7000 SoC (2018). https://www.xilinx.com/products/silicon-devices/soc/zynq-7000.html

  21. Venkat, A., Tullsen, D.M.: Harnessing ISA diversity: design of a heterogeneous-ISA chip multiprocessor. In ACM/IEEE 41st International Symposium on Computer Architecture, ISCA 2014, Minneapolis, MN, USA, 14–18 June 2014, pp. 121–132. IEEE Computer Society (2014)

    Google Scholar 

  22. Yang, K., Yang, M., Anderson, J.H.: Reducing response-time bounds for DAG-based task systems on heterogeneous multicore platforms. In: Plantec, A., Singhoff, F., Faucou, S., Pinho, L.M. (eds.) Proceedings of the 24th International Conference on Real-Time Networks and Systems, RTNS 2016, Brest, France, 19–21 October 2016, pp. 349–358. ACM (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Meiling Han .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Peng, X., Han, M., Deng, Q. (2019). Response Time Analysis of Typed DAG Tasks for G-FP Scheduling. In: Guan, N., Katoen, JP., Sun, J. (eds) Dependable Software Engineering. Theories, Tools, and Applications. SETTA 2019. Lecture Notes in Computer Science(), vol 11951. Springer, Cham. https://doi.org/10.1007/978-3-030-35540-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-35540-1_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-35539-5

  • Online ISBN: 978-3-030-35540-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics