A MARTE Extension for Global Scheduling Analysis of Multiprocessor Systems

Real-Time Systems are subject to Soft/Hard temporal constraints. Besides, a tasks scheduling step is required to meet the maximum of deadlines, for which there are different scheduling algorithms to do. However, nowadays real-time systems represent a serious issue for the worldwide industry due to t...

Full description

Saved in:
Bibliographic Details
Published in:2012 IEEE 23rd International Symposium on Software Reliability Engineering pp. 371 - 379
Main Authors: Magdich, Amina, Kacem, Yessine Hadj, Mahfoudhi, Adel, Abid, Mohamed
Format: Conference Proceeding
Language:English
Published: IEEE 01.11.2012
Subjects:
ISBN:9781467346382, 1467346381
ISSN:1071-9458
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Real-Time Systems are subject to Soft/Hard temporal constraints. Besides, a tasks scheduling step is required to meet the maximum of deadlines, for which there are different scheduling algorithms to do. However, nowadays real-time systems represent a serious issue for the worldwide industry due to their growing complexity. Indeed, since they are more susceptible to failures and deficiencies of development, it is crucial to rely on high level development methods. In this context, some researchers have proposed scheduling analysis within the new profile Modeling and Analysis of Real-Time and Embedded systems (MARTE), which supports both monoprocessor and multiprocessor scheduling algorithms. While supported multiprocessor scheduling algorithms are part of the partitioned approach, global approach algorithms have not been backed by MARTE yet. In the present paper, we seek to improve the meta-models of MARTE stereotypes to establish scheduling analysis for the global approach.
ISBN:9781467346382
1467346381
ISSN:1071-9458
DOI:10.1109/ISSRE.2012.2