Speedam 2010 2010
DOI: 10.1109/speedam.2010.5542060
|View full text |Cite
|
Sign up to set email alerts
|

OSEK-based multiple controllers with schedule feasibility self-testing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…However, OSEK/VDX offers flexibility and scalability, as it may consider various attributes' values for each available object. Moreover, it should be noted that OSEK/VDX provides enhanced capabilities for developing multitasking approaches (rapid commutation between different contexts, predictable interrupts handling, simple access to shared resources, events' handling, management of time through counters and alarms, centralised and local management of errors), as well as extended tracer facilities [14], [15] which permit to monitor the sequence of processed tasks, the execution times and the memory consumption.…”
Section: Osek-based Controller Implementationmentioning
confidence: 99%
“…However, OSEK/VDX offers flexibility and scalability, as it may consider various attributes' values for each available object. Moreover, it should be noted that OSEK/VDX provides enhanced capabilities for developing multitasking approaches (rapid commutation between different contexts, predictable interrupts handling, simple access to shared resources, events' handling, management of time through counters and alarms, centralised and local management of errors), as well as extended tracer facilities [14], [15] which permit to monitor the sequence of processed tasks, the execution times and the memory consumption.…”
Section: Osek-based Controller Implementationmentioning
confidence: 99%
“…If 2 D is connected to 1 G at CAN1 module, a message sent from the 2 D domain to a device of 9 D is received by the 1 G gateway which determines the fastest route 1 3 4 5 G G G G (of cost 5), instead of 1 5 G G (which has a cost of 8). On the contrary, whenever 11 n is detected as overloaded, the corresponding flag aOVLD [11] is set and the 11 n bus is omitted during the route calculation performed by the Task_Gateway_CAN 1 , so the message is sent on 13 n . A solution for avoiding the overload is to re-design the system in such a way that the traffic is diminished between the gateway devices.…”
Section: Study Casementioning
confidence: 99%
“…Moreover, global or partitioned scheduling algorithms can be adopted in order to increase the performance of the distributed gateway system and allow a better CAN traffic control. Some results regarding the feasibility analysis for multi-processor systems are given in [9], [10] and [11].…”
Section: Introductionmentioning
confidence: 99%