Schedulability Analysis for Rate Monotonic Algorithm-Shortest Job First Using UML-RT
System modelling with a unified modelling language (UML) is an active research area for developing real-time system development. UML is widely used modelling language in software engineering community, to specify the requirement, and analyse the target system successfully. UML can be used to provide...
Saved in:
| Published in | Modelling and Simulation in Engineering Vol. 2014; no. 2014; pp. 64 - 73 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Hindawi Limiteds
01.01.2014
Hindawi Publishing Corporation John Wiley & Sons, Inc Wiley |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1687-5591 1687-5605 1687-5605 |
| DOI | 10.1155/2014/206364 |
Cover
| Summary: | System modelling with a unified modelling language (UML) is an active research area for developing real-time system development. UML is widely used modelling language in software engineering community, to specify the requirement, and analyse the target system successfully. UML can be used to provide multiple views of the system under design with the help of a variety of structural and behavioural diagrams at an early stage. UML-RT (unified modelling language-real time) is a language used to build an unambiguous executable specification of a real-time system based on UML concepts. This paper presents a unified modeling approach for a newly proposed rate monotonic scheduling algorithm-shortest job first (RMA-SJF) for partitioned, semipartitioned and global scheduling strategies in multiprocessor architecture using UML-RT for different system loads. As a technical contribution, effective processor utilization of individual processors and success ratio are analyzed for various scheduling principles and compared with EDF and D_EDF to validate our proposal. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ISSN: | 1687-5591 1687-5605 1687-5605 |
| DOI: | 10.1155/2014/206364 |