Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms

Authors:
Marko Bertogna;Michele Cirinei;Giuseppe Lipari
Affiliations:
Scuola Superiore Sant' Anna, Pisa;Scuola Superiore Sant' Anna, Pisa;Scuola Superiore Sant' Anna, Pisa
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2009

Citing 0
Cited 25

A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees

Real-Time Systems
Task Parallel Scheduling over Multi-core System

CloudCom '09 Proceedings of the 1st International Conference on Cloud Computing
Sporadic Server revisited

Proceedings of the 2010 ACM Symposium on Applied Computing
Spin-based reader-writer synchronization for multiprocessor real-time systems

Real-Time Systems
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

Real-Time Systems
Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling

Journal of Systems Architecture: the EUROMICRO Journal
Tests for global EDF schedulability analysis

Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
An overview of interrupt accounting techniques for multiprocessor real-time systems

Journal of Systems Architecture: the EUROMICRO Journal
Multiprocessor extensions to real-time calculus

Real-Time Systems
Zero-laxity based real-time multiprocessor scheduling

Journal of Systems and Software
SESAM/Par4All: a tool for joint exploration of MPSoC architectures and dynamic dataflow code generation

Proceedings of the 2012 Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools
What to make of multicore processors for reliable real-time systems?

Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
AHDAM: an asymmetric homogeneous with dynamic allocator manycore chip

Facing the Multicore-Challenge II
An experimental evaluation of the scalability of real-time scheduling algorithms on large-scale multicore platforms

Journal of Experimental Algorithmics (JEA)
Laxity dynamics and LLF schedulability analysis on multiprocessor platforms

Real-Time Systems
FPSL, FPCL and FPZL schedulability analysis

Real-Time Systems
The generalized multiprocessor periodic resource interface model for hierarchical multiprocessor scheduling

Proceedings of the 20th International Conference on Real-Time and Network Systems
On using adversary simulators to evaluate global fixed-priority and FPZL scheduling of multiprocessors

Journal of Systems and Software
Resource Management in Real Time Distributed System with Security Constraints: A Review

International Journal of Distributed Systems and Technologies
Contention-free executions for real-time multiprocessor scheduling

ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers
Parallel scheduling for cyber-physical systems: analysis and case study on a self-driving car

Proceedings of the ACM/IEEE 4th International Conference on Cyber-Physical Systems
Limited carry-in technique for real-time multi-core scheduling

Journal of Systems Architecture: the EUROMICRO Journal
Global EDF scheduling of directed acyclic graphs on multiprocessor systems

Proceedings of the 21st International conference on Real-Time Networks and Systems
Demand-based schedulability analysis for real-time multi-core scheduling

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Research on real-time scheduling algorithms for multiprocessor systems is a hot topic, due to the recent popularity of multicore hardware platforms. When executing applications with dynamic requirements on symmetric multiprocessor platforms, a possibility is to use global scheduling, where ready tasks are inserted in a single system-wide queue and migration from one processor to another is allowed during task lifetime. This paper addresses the problem of schedulability analysis of globally scheduled periodic and sporadic task sets. First, a general method to derive schedulability conditions for multiprocessor real-time systems will be presented. The analysis will be applied to two typical scheduling algorithms: Earliest Deadline First (EDF) and Fixed Priority (FP). Then, the derived schedulability conditions will be tightened, refining the analysis with a simple and effective technique that significantly improves the percentage of accepted task sets. The effectiveness of the proposed test is shown through an extensive set of synthetic experiments.