Diverse Soft Real-Time Processing in an Integrated System

Lin, Caixue; Kaldewey, Tim; Povzner, Anna; Brandt, Scott

doi:10.1109/rtss.2006.21

Cited by 15 publications

(12 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While our model treats it as dead processor time, that "dead time" can actually be employed for a number of purposes, including load balancing , improving performance (Andersson and Tovar 2006;Lin and Brandt 2005), creating a work-conserving scheduler (Funaoka et al 2008b(Funaoka et al , 2008a, or running nonreal-time tasks in a hybrid system (Lin et al 2006).…”

Section: Theoremmentioning

confidence: 99%

DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

et al. 2011

Self Cite

View full text Add to dashboard Cite

We consider the problem of optimal real-time scheduling of periodic and sporadic tasks on identical multiprocessors. A number of recent papers have used the notions of fluid scheduling and deadline partitioning to guarantee optimality and improve performance. This article develops a unifying theory with the DP-FAIR scheduling policy and examines how it overcomes problems faced by greedy scheduling algorithms. In addition, we present DP-WRAP, a simple DP-FAIR scheduling algorithm which serves as a least common ancestor to other recent algorithms. The DP-FAIR scheduling policy is extended to address the problem of scheduling sporadic task sets with arbitrary deadlines.

show abstract

Section: Theoremmentioning

confidence: 99%

DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

et al. 2011

Self Cite

View full text Add to dashboard Cite

show abstract

“…While our model treats it as dead processor time, that "dead time" can actually be employed for a number of purposes, including load balancing [4], improving performance [3,19], creating a work-conserving scheduler [12,13], or running non-real-time tasks in a hybrid system [20].…”

Section: Dp-fair Conditions For Periodic Tasksmentioning

confidence: 99%

DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling

Levin

Funk

Sadowski

et al. 2010

2010 22nd Euromicro Conference on Real-Time Systems

Self Cite

133

100

View full text Add to dashboard Cite

We consider the problem of optimal real-time scheduling of periodic and sporadic tasks for identical multiprocessors. A number of recent papers have used the notions of fluid scheduling and deadline partitioning to guarantee optimality and improve performance. In this paper, we develop a unifying theory with the DP-FAIR scheduling policy and examine how it overcomes problems faced by greedy scheduling algorithms. We then present a simple DP-FAIR scheduling algorithm, DP-WRAP, which serves as a least common ancestor to many recent algorithms. We also show how to extend DP-FAIR to the scheduling of sporadic tasks with arbitrary deadlines.

show abstract

“…Other techniques that could possibly be used as a basis for adaptive scheduling of legacy applications have been proposed in the past [12], [13], but to the best knowledge of the authors the first technique developed explicitly to this purpose is in [5], where a feedback scheme for legacy applications was proposed (by almost the same authors of this paper) that uses a simple multiplicative/additive scheme to identify the resource requirements by using a coarsely quantised feedback variable.…”

Section: Related Workmentioning

confidence: 99%

The wizard of OS: a heartbeat for Legacy multimedia applications

Cucinotta

Abeni

Palopoli

et al. 2009

2009 IEEE/ACM/IFIP 7th Workshop on Embedded Systems for Real-Time Multimedia

View full text Add to dashboard Cite

Abstract-Multimedia applications are often characterised by implicit temporal constraints but, in many cases, they are not programmed using any specialised real-time API. These "Legacy applications" have no way to communicate their temporal constraints to the OS kernel, and their quality of service (QoS), being necessarily linked to the temporal behaviour, fails to satisfy acceptable standards. In this paper we propose an innovative way for dealing with these applications, based on the combination of an on-line identification mechanism (which extracts from high-level observations such important parameters as the execution rate) and an adaptive scheduler (specialised for legacy applications) that identifies the correct amount of CPU needed by each application.Preliminary experimental results are reported, proving the effectiveness of the proposed idea in providing a widely used multimedia player on Linux with appropriate QoS guarantees, through an appropriate choice of the scheduling parameters. Finally, a detailed road-map is presented with the possible extensions to the approach.

show abstract

Diverse Soft Real-Time Processing in an Integrated System

Cited by 15 publications

References 26 publications

DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling

The wizard of OS: a heartbeat for Legacy multimedia applications

Contact Info

Product

Resources

About