Multiprocessor Scheduling for Real-Time Systems

  • Sanjoy Baruah
  • Marko Bertogna
  • Giorgio Buttazzo
Part of the Embedded Systems book series (EMSY)

Table of contents

  1. Front Matter
    Pages i-xv
  2. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 1-12
  3. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 13-22
  4. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 23-28
  5. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 29-33
  6. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 35-37
  7. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 39-52
  8. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 53-66
  9. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 67-85
  10. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 87-93
  11. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 95-102
  12. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 103-114
  13. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 115-119
  14. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 121-124
  15. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 125-132
  16. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 133-142
  17. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 143-153
  18. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 155-164
  19. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 165-172
  20. Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo
    Pages 173-188

About this book

Introduction

This book provides a comprehensive overview of both theoretical and pragmatic aspects of resource-allocation and scheduling in multiprocessor and multicore hard-real-time systems.  The authors derive new, abstract models of real-time tasks that capture accurately the salient features of real application systems that are to be implemented on multiprocessor platforms, and identify rules for mapping application systems onto the most appropriate models.  New run-time multiprocessor scheduling algorithms are presented, which are demonstrably better than those currently used, both in terms of run-time efficiency and tractability of off-line analysis.  Readers will benefit from a new design and analysis framework for multiprocessor real-time systems, which will translate into a significantly enhanced ability to provide formally verified, safety-critical real-time systems at a significantly lower cost.

Keywords

Embedded Systems Hard-Real-Time Systems Multicore Scheduling for Hard-Real-Time Systems Multiprocessor Scheduling Algorithms Multiprocessor Scheduling for Hard-Real-Time Systems Resource Allocation in Hard-Real-Time Systems

Authors and affiliations

  • Sanjoy Baruah
    • 1
  • Marko Bertogna
    • 2
  • Giorgio Buttazzo
    • 3
  1. 1.Computer Science Sitterson HallThe University of North CarolinaChapel HillUSA
  2. 2.Università di ModenaModenaItaly
  3. 3.Scuola Superiore Sant’Anna TeCIP InstitutePisaItaly

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-08696-5
  • Copyright Information Springer International Publishing Switzerland 2015
  • Publisher Name Springer, Cham
  • eBook Packages Engineering
  • Print ISBN 978-3-319-08695-8
  • Online ISBN 978-3-319-08696-5
  • Series Print ISSN 2193-0155
  • Series Online ISSN 2193-0163
  • About this book