Sciweavers

505 search results - page 8 / 101
» Dual Priority Scheduling
Sort
View
RTAS
2009
IEEE
14 years 2 months ago
Semi-partitioned Fixed-Priority Scheduling on Multiprocessors
This paper presents a new algorithm for ï¬xed-priority scheduling of sporadic task systems on multiprocessors. The algorithm is categorized to such a scheduling class that qualiï...
Shinpei Kato, Nobuyuki Yamasaki
ETFA
2006
IEEE
14 years 2 months ago
Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors
In this paper we study the global scheduling of periodic task systems upon uniform multiprocessor platforms. We ï¬rst show two very general properties which are wellknown for uni...
Liliana Cucu, Joël Goossens
ISORC
2002
IEEE
14 years 1 months ago
Integrating Real-Time Synchronization Schemes into Preemption Threshold Scheduling
Preemption threshold scheduling (PTS) provides prominent benefits for fixed priority scheduling such as increased schedulability, reduced context switches, and decreased memory re...
Saehwa Kim, Seongsoo Hong, Tae-Hyung Kim
LCN
2003
IEEE
14 years 1 months ago
Analysis of Prioritized Scheduling of Assured Forwarding in DiffServ Architectures
Assured Service has been proposed within the Differentiated Services (DiffServ) model to provide relative service differentiation by attempting to allocate bandwidth to different ...
Nzinga D. Kiameso, Hossam S. Hassanein, Hussein T....
SCHEDULING
2010
116views more  SCHEDULING 2010»
13 years 6 months ago
Characterizing sets of jobs that admit optimal greedy-like algorithms
The “ Priority Algorithm†is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
Periklis A. Papakonstantinou, Charles Rackoff