Central Library

Normal view MARC view ISBD view

Multiprocessor Scheduling for Real-Time Systems [electronic resource] / by Sanjoy Baruah, Marko Bertogna, Giorgio Buttazzo.

By: Baruah, Sanjoy [author.].
Contributor(s): Bertogna, Marko [author.] | Buttazzo, Giorgio [author.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Embedded Systems: Publisher: Cham : Springer International Publishing : Imprint: Springer, 2015Description: XV, 228 p. 45 illus., 4 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319086965.Subject(s): Engineering | Microprocessors | Electronics | Microelectronics | Electronic circuits | Engineering | Circuits and Systems | Processor Architectures | Electronics and Microelectronics, InstrumentationAdditional physical formats: Printed edition:: No titleDDC classification: 621.3815 Online resources: Click here to access online
Contents:
Introduction: background, scope, and context -- Preliminaries: workload and platform models -- Preliminaries: scheduling concepts and goals -- A review of selected results on uniprocessors -- Implicit-deadline (L&L) tasks -- Partitioned scheduling of L&L tasks -- Global dynamic-priority scheduling of L&L tasks -- Global Fixed-Job-Priority scheduling of L&L tasks -- Global Fixed-Task-Priority scheduling of L&L tasks.
In: Springer eBooksSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

Introduction: background, scope, and context -- Preliminaries: workload and platform models -- Preliminaries: scheduling concepts and goals -- A review of selected results on uniprocessors -- Implicit-deadline (L&L) tasks -- Partitioned scheduling of L&L tasks -- Global dynamic-priority scheduling of L&L tasks -- Global Fixed-Job-Priority scheduling of L&L tasks -- Global Fixed-Task-Priority scheduling of L&L tasks.

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.

There are no comments for this item.

Log in to your account to post a comment.