Skip to main content
SpringerLink
Log in

Scheduling of Real-Time Networks with a Column Generation Approach

  • Chapter
  • First Online:
IAENG Transactions on Engineering Technologies

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 247))

Abstract

We present an algorithm based on column generation for the real-time scheduling problem of allocating periodic tasks to electronic control units in multiple subsystems connected by a global bus. The allocation has to ensure that tasks can be scheduled, and messages between tasks in different subsystems can be transmitted over the global bus and meet their deadlines. Also tasks and messages occurring in a task chain must be scheduled in a way such that the sequence of execution meets their end-to-end deadline. We show that our approach computes the optimal allocation in our model and due to the column generation approach early provides lower bounds on the optimal value.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Althaus E, Hoffmann S, Kupilas J, Thaden E (2012) A column generation approach to scheduling of real-time networks. In: Proceedings of the world congress on engineering and computer science (WCECS), vol 1, IAENG, San Francisco, USA, pp 224–229

    Google Scholar 

  2. Althaus E, Naujoks R, Thaden E (2011) A column generation approach to scheduling of periodic tasks. In: Experimental slgorithms—10th international symposium, SEA 2011, Proceedings, LNCS 6630, vol 1, Springer, Berlin, pp 340–351

    Google Scholar 

  3. Audsley NC (1990) Deadline monotonic scheduling

    Google Scholar 

  4. Büker M (2012) An automated semantic-based approach for creating task structures. Ph.D. thesis

    Google Scholar 

  5. Büker M, Damm W, Ehmen G, Metzner A, Stierand I, Thaden E (2011) Automating the design flow for distributed embedded automotive applications: keeping your time promises, and optimizing costs, too. In: Proceedings international symposium on industrial embedded systems (SIES’11)

    Google Scholar 

  6. Burns A, Wellings A (2001) Real-time systems and programming languages: Ada 95, real-time Java, and real-time POSIX. Addison-Wesley, International computer science series, Reading

    Google Scholar 

  7. Clark B, Stierand I, Thaden E (2011) Cost-minimal pre-allocation of software tasks under real-time constraints. In: Proceedings of the 2011 ACM symposium on research in applied computation (RACS 2011), Miami, Florida, pp 77–83

    Google Scholar 

  8. Davis RI, Burns A, Bril RJ, Lukkien JJ (2007) Controller area network (CAN) schedulability analysis: Refuted, revisited and revised. Real-Time Syst 35(3):239–272

    Article  Google Scholar 

  9. Eisenbrand F, Damm W, Metzner A, Shmonin G, Wilhelm R, Winkel S (2006) Mapping task-graphs on distributed ecu networks: efficient algorithms for feasibility and optimality. In: Proceedings of the 12th IEEE conference on embedded and real-time computing systems and applications. IEEE Computer Society

    Google Scholar 

  10. Gurobi Optimization, Inc. (2012) Gurobi optimizer reference manual (2012).http://www.gurobi.com

  11. Joseph M, Pandya PK (1986) Finding response times in a real-time system. Comput J 29:390–395

    Article  MathSciNet  Google Scholar 

  12. Lehoczky JP, Sha L, Ding Y (1989) The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: IEEE Real-time systems, symposium, pp 166–171

    Google Scholar 

  13. Leung JYT, Whitehead J (1982) On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perform Eval 2(4):237–250

    Article  MathSciNet  MATH  Google Scholar 

  14. Lukasiewycz M, Glaß M, Teich J, Milbredt P (2009) FlexRay schedule optimization of the static segment. In: CODES+ISSS, ACM, pp 363–372

    Google Scholar 

  15. Thaden E (2013) Semi-automatic optimization of hardware architectures in embedded systems. Ph.D. thesis

    Google Scholar 

  16. Thaden E, Lipskoch H, Metzner A, Stierand I (2010) Exploiting gaps in fixed-priority preemptive schedules for task insertion. In: Proceedings of the 16th international conference on embedded and real-time computing systems and applications (RTCSA), (IEEE) Computer Society, pp 212–217

    Google Scholar 

  17. Tindell K, Burns A, Wellings A (1992) Allocating hard real time tasks (an NPhard problem made easy). J Real-Time Syst 4:145–165

    Article  Google Scholar 

  18. Zhu Q, Yang Y, Natale MD, Scholte E, Sangiovanni-Vincentelli AL (2010) Optimizing the software architecture for extensibility in hard real-time distributed systems. IEEE Trans Industr Inf 6(4):621–636

    Article  Google Scholar 

Download references

Acknowledgments

This work was partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center Automatic Verification and Analysis of Complex Systems (SFB/TR 14 AVACS, www.avacs.org).

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Campus E14, 66123, Saarbrücken, Germany

    Ernst Althaus & Joschka Kupilas

  2. Institut für Informatik, Johannes Gutenberg-Universität, Staudingerweg 9, 55128, Mainz, Germany

    Ernst Althaus & Sebastian Hoffmann

  3. Department für Informatik, Carl von Ossietzky-Universität, 26111, Oldenburg, Germany

    Eike Thaden

Authors
  1. Ernst Althaus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sebastian Hoffmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joschka Kupilas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Eike Thaden
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sebastian Hoffmann .

Editor information

Editors and Affiliations

  1. Computer & Communication Dean of Engineering College, Catholic University of DaeGu Engineering College, DaeGu, Korea, Republic of (South Korea)

    Haeng Kon Kim

  2. Unit 1, 1/F, International Association of Engineers, Hong Kong, Hong Kong SAR

    Sio-Iong Ao

  3. College of Engineering, California State Polytechnic University, Pomona, California, USA

    Mahyar A. Amouzegar

  4. Abt. Linguistische Datenverarbeitung, Universität Trier Inst.Computerlinguistik, Trier, Germany

    Burghard B. Rieger

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Althaus, E., Hoffmann, S., Kupilas, J., Thaden, E. (2014). Scheduling of Real-Time Networks with a Column Generation Approach. In: Kim, H., Ao, SI., Amouzegar, M., Rieger, B. (eds) IAENG Transactions on Engineering Technologies. Lecture Notes in Electrical Engineering, vol 247. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-6818-5_28

Download citation

  • DOI: https://doi.org/10.1007/978-94-007-6818-5_28

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-007-6817-8

  • Online ISBN: 978-94-007-6818-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation