“Global Laxity-Based Scheduling on Multiprocessor Resource Reservations”

From Navigators

(Difference between revisions)
Jump to: navigation, search
 
Line 4: Line 4:
|title=Global Laxity-Based Scheduling on Multiprocessor Resource Reservations
|title=Global Laxity-Based Scheduling on Multiprocessor Resource Reservations
|author=João Pedro Craveiro, José Rufino,
|author=João Pedro Craveiro, José Rufino,
-
|Project=Project:READAPT,
+
|Project=Project:READAPT, Project:PROPHECY,  
|ResearchLine=Timeliness and Adaptation in Dependable Systems (TADS)
|ResearchLine=Timeliness and Adaptation in Dependable Systems (TADS)
|month=jul
|month=jul

Latest revision as of 13:21, 1 April 2017

João Pedro Craveiro, José Rufino

Extended Abstract in 4th International Real-Time Scheduling Open Problems Seminar (RTSOPS 2013), Paris, France, Jul. 2013, pp. 12–13.

Abstract: In this paper, we focus on the problem of scheduling a task set on a multiprocessor resource reservation, i.e., in a scenario in which some (or all) processors may be at some times unavailable. We focus on the approach of adding laxity-based priority assignment decisions to EDF, as in the case of EDZL.

Download paper

Download Global Laxity-Based Scheduling on Multiprocessor Resource Reservations

Export citation

BibTeX

Project(s): Project:READAPT, Project:PROPHECY

Research line(s): Timeliness and Adaptation in Dependable Systems (TADS)

Personal tools
Navigators toolbox