z-logo
open-access-imgOpen Access
Concurrent Real-time Schedulers, a Classification Based on Functions
Author(s) -
Pedro Guevara López,
Oscar A. Morales-Moreno,
José S. Falcón-López
Publication year - 2012
Publication title -
studies in informatics and control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.321
H-Index - 22
eISSN - 1841-429X
pISSN - 1220-1766
DOI - 10.24846/v21i1y201203
Subject(s) - computer science , distributed computing , real time computing
Real-time Systems (RTS) are generally implemented into digital computers with Real-time Operating Systems (RTOS) where all activities are performed by a set of Concurrent Real-time Tasks (CRTT) which requires attention by a processor through a Concurrent Real-time Task Scheduler (CRTTS). In this sense, this concept is commonly considered as a resource allocator to tasks by means of preset algorithm. However, a RTTCS is a function that maps the Set of Arrival Times (ATS) to the Starting Times Set (STS) of the instances related to CRTTS; this conception is general and independent from the scheduling algorithm used (RM, EDF, FIFO, etc.) and it will be useful to define the working environment of RTS in the analysis of schedulability, reconstruction, fail-safe and predictability. It is also useful to know the scheduler characteristics and determine the type of scheduler we are using in the System.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom