Proceedings of the Joint Conference on Languages, Compilers and Tools for Embedded Systems: Software and Compilers for Embedded 2002
DOI: 10.1145/513829.513866
|View full text |Cite
|
Sign up to set email alerts
|

Perfecting preemption threshold scheduling for object-oriented real-time system design

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
26
0

Year Published

2007
2007
2017
2017

Publication Types

Select...
3
3
1

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(26 citation statements)
references
References 11 publications
0
26
0
Order By: Relevance
“…Many resource sharing protocols and real-time synchronization schemes have been adapted to PTS [11,13]. Kim et al [13] showed how the priority inheritance and priority ceiling protocols could be used with PTS when shared resources are present.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Many resource sharing protocols and real-time synchronization schemes have been adapted to PTS [11,13]. Kim et al [13] showed how the priority inheritance and priority ceiling protocols could be used with PTS when shared resources are present.…”
Section: Related Workmentioning
confidence: 99%
“…Kim et al [13] showed how the priority inheritance and priority ceiling protocols could be used with PTS when shared resources are present. Gai et al [11] showed how Baker's stack resource policy [3] can be extended to support PTS, resulting in the stack resource policy with preemption thresholds (SRPT).…”
Section: Related Workmentioning
confidence: 99%
“…Therefore, studying the preemption of RM algorithm and reducing the context-switch overhead in practical applications has real value. The research (preemption threshold model) of Wang and Saksena [4] reduced a part of extra preemptions through setting double priorities for tasks, based on which Kim et al [5,6] went on further studying. However, the realization of preemption threshold model needs a certain modification to the RTOS kernel and costs a certain storage overhead and scheduling overhead.…”
Section: Introductionmentioning
confidence: 99%
“…The approaches to reduce the number of preemptions in fixed priority scheduling have been presented in [56,57,58,11]. In the approaches presented in [56,57,58,59], the tasks are assigned a threshold value in addition to their priorities such th a t they can be preempted only by other tasks with priorities higher than the threshold.…”
Section: R Elated W Orksmentioning
confidence: 99%
“…In the approaches presented in [56,57,58,59], the tasks are assigned a threshold value in addition to their priorities such th a t they can be preempted only by other tasks with priorities higher than the threshold. This is similar to dual priority system and requires to simulate preemption threshold using mutexes -generally not desirable or not possible in all systems.…”
Section: R Elated W Orksmentioning
confidence: 99%