Proceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium
DOI: 10.1109/rttas.2002.1137388
|View full text |Cite
|
Sign up to set email alerts
|

A measurement-based analysis of the real-time performance of linux

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
58
1
2

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 73 publications
(64 citation statements)
references
References 9 publications
1
58
1
2
Order By: Relevance
“…Multimedia applications, and more generally soft realtime applications, are characterized by implicit temporal constraints that must be met to provide the desired QoS [17]. Assuming that tracing the kernel scheduler has a negligible impact on the system, we can verify that temporal constraints are satisfied for one or multiple real-time applications, and whenever they are not, we can show what the system was doing at that time.…”
Section: Performance Debuggingmentioning
confidence: 99%
See 1 more Smart Citation
“…Multimedia applications, and more generally soft realtime applications, are characterized by implicit temporal constraints that must be met to provide the desired QoS [17]. Assuming that tracing the kernel scheduler has a negligible impact on the system, we can verify that temporal constraints are satisfied for one or multiple real-time applications, and whenever they are not, we can show what the system was doing at that time.…”
Section: Performance Debuggingmentioning
confidence: 99%
“…However, this shows how our approach was useful to identify suspicious code sequences. To support soft real-time applications, the kernel should respect the application's temporal constraints and therefore a predictable schedule is desired [17]. Such applications may require periodic scheduling where the period is derived from the frame rate of an audio/video stream, for example.…”
Section: Locking Validationmentioning
confidence: 99%
“…The real-time patch is a modification to a plain Linux kernel to support kernel preemption [5]. It achieves a few hundred µseconds latency [6], but still the result is slower by a factor of ten comparing to typical RTOSes. Even though the mechanism is potentially capable of achieving real-time responsiveness, it could be easily spoiled by a bad-mannered device driver, which holds a lock for a long period.…”
Section: Related Workmentioning
confidence: 99%
“…There is also an effort to reduce the overhead of scheduling by managing queues such that selection is O(1) instead of O(n) [10]. Another technique to reduce scheduling latency is to increase system clock frequencies [11]. The processing power of modern systems may tolerate the interrupt overhead [12].…”
Section: Related Workmentioning
confidence: 99%