Proceedings Fourth International Workshop on Real-Time Computing Systems and Applications
DOI: 10.1109/rtcsa.1997.629172
|View full text |Cite
|
Sign up to set email alerts
|

HARTIK 3.0: a portable system for developing real-time applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 20 publications
(8 citation statements)
references
References 14 publications
0
8
0
Order By: Relevance
“…The elastic task model has been implemented on top of the HARTIK kernel [5], [11] to perform some experiments on multimedia applications and verify the results predicted by the theory. In particular, the elastic guarantee mechanism has been implemented as a high priority task, the QoS manager, activated by the other tasks when they are created or when they want to change their period.…”
Section: Resultsmentioning
confidence: 94%
See 1 more Smart Citation
“…The elastic task model has been implemented on top of the HARTIK kernel [5], [11] to perform some experiments on multimedia applications and verify the results predicted by the theory. In particular, the elastic guarantee mechanism has been implemented as a high priority task, the QoS manager, activated by the other tasks when they are created or when they want to change their period.…”
Section: Resultsmentioning
confidence: 94%
“…Furthermore, the elastic mechanism can easily be implemented on top of classical real-time kernels and can be used under fixed or dynamic priority scheduling algorithms. The experimental results shown in this paper have been conducted by implementing the elastic mechanism on the HARTIK kernel [5], [11].…”
Section: Table 5 Task Set Parameters Used For the Second Experimentsmentioning
confidence: 99%
“…The proposed CBS algorithm has been implemented on the HARTIK kernel (Buttazzo, 1993;Lamastra et al, 1997), to support some sample multimedia applications. The algorithm can also be easily implemented in different real-time kernels where time accounting is provided.…”
Section: Implementation and Experimental Resultsmentioning
confidence: 99%
“…Both benefits are mainly due to the CSP's early blocking, a feature shown to be especially appropriate in a system where hard and soft tasks must share memory. As a curiosity, it is interesting to note that Lamastra et al [Lam97] reached a similar conclusion in their operating system, HARTIK, which also mixes hard and soft tasks but uses a different scheduling paradigm (Earliest Deadline First) and a different synchronization protocol (Stack Resource Protocol). …”
Section: High-level Evaluationmentioning
confidence: 83%
“…However, typical research studies in FRTS do not address the issue of communication among tasks of different criticality, but define soft tasks (or even all types of tasks) to be independent. Exception of this are the Open System architecture [Den97], which proposes the Non-Preemptable Critical Section (NPS) protocol as a mechanism for safely sharing global data, and the HARTIK operating system [Lam97], in which the Stack Resource Protocol [Bak91] has been adapted in order to allow both hard and soft tasks to share memory.…”
Section: Introductionmentioning
confidence: 99%