Sciweavers

52 search results - page 5 / 11
» Generalized Tardiness Bounds for Global Multiprocessor Sched...
Sort
View
RTAS
2011
IEEE
12 years 9 months ago
A Lookup-Table Driven Approach to Partitioned Scheduling
The partitioned preemptive EDF scheduling of implicitdeadline sporadic task systems on an identical multiprocessor platform is considered. Lookup tables, at any selected degree of...
Bipasa Chattopadhyay, Sanjoy K. Baruah
OPODIS
2008
13 years 6 months ago
Deadline Monotonic Scheduling on Uniform Multiprocessors
The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented a...
Sanjoy K. Baruah, Joël Goossens
OPODIS
2007
13 years 6 months ago
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
Theodore P. Baker, Michele Cirinei
RTAS
2011
IEEE
12 years 9 months ago
FPZL Schedulability Analysis
— This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor realtime systems. FPZL is similar to global fixed priority preemptive sc...
Robert I. Davis, Alan Burns
RTAS
2002
IEEE
13 years 10 months ago
The Aperiodic Multiprocessor Utilization Bound for Liquid Tasks
Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task schedulability guarantees. The main breakthrough ...
Tarek F. Abdelzaher, Björn Andersson, Jan Jon...