2006
DOI: 10.1007/11875567_29
|View full text |Cite
|
Sign up to set email alerts
|

Encapsulating Application Subsystems Using the DECOS Core OS

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2007
2007
2019
2019

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 1 publication
0
4
0
Order By: Relevance
“…We select n= [6,10], m= [2,4,6,8], 𝛼= [7,20], u=[0.1 to 1.0 step=0.05], R max = [1,2,3,4], and R=[3,4, … ,12, … ,16] and generate a total of 1.28x10 6 task sets and allocates these task sets using SRTA, SPA, ROP, and FFD. The results presented in Figure 10 show that the SRTA performance is comparable on multiple processor configurations, eg, on two, four, six, and eight processors (cores).…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…We select n= [6,10], m= [2,4,6,8], 𝛼= [7,20], u=[0.1 to 1.0 step=0.05], R max = [1,2,3,4], and R=[3,4, … ,12, … ,16] and generate a total of 1.28x10 6 task sets and allocates these task sets using SRTA, SPA, ROP, and FFD. The results presented in Figure 10 show that the SRTA performance is comparable on multiple processor configurations, eg, on two, four, six, and eight processors (cores).…”
Section: Resultsmentioning
confidence: 99%
“…In the real‐time partitioned scheduling, the tasks are allocated statically on all processors with scheduler running on each processor independently, and the migration of statically allocated tasks to the other processors is not permitted. There are many Real‐Time Operating Systems (RTOS) that support partitioned scheduling, eg, Tresos, 6 LynxOS, 7 DECOS, 8 and VxWorks 9 . The uniprocessor fixed priority Rate Monotonic Scheduling (RMS), 10 dynamic priority Earlier Deadline First (EDF), 10 and dynamic priority Deadline Monotonic (DM) 11 schemes can be used in partitioned scheduling, eg, Partitioned‐RMS, Partitioned‐EDF, and partitioned‐DM scheduling.…”
Section: Introductionmentioning
confidence: 99%
“…The allocation of computational resources (e. g., memory, CPU time) to jobs occurs using a partitioning operating system with support for fault isolation and modular certification [21,22]. The partitioning operating system implements mechanisms for spatial and temporal partitioning in order to encapsulate the individual jobs.…”
Section: Node Computersmentioning
confidence: 99%
“…Temporal and spatial partitioning between applications is ensured by encapsulated execution environments (in nodes) [4] and virtual networks (communication bus) [5]. The foundation for the DECOS technology is a time-triggered core architecture which has to provide services such as predictable message transport and fault-tolerant clock synchronization.…”
Section: Introductionmentioning
confidence: 99%