Sciweavers

3563 search results - page 170 / 713
» Scheduling Algorithms for Procrastinators
Sort
View
ICC
2007
IEEE
15 years 10 months ago
Achievable Sum-Rate Analysis of Practical Multiuser Scheduling Schemes with Limited Feedback
— We study the performance of fair physical layer schedulers that select a pair of orthogonal users for simultaneous transmission. The schemes rely on partial channel state infor...
Alexis A. Dowhuszko, Graciela Corral-Briones, Jyri...
ECRTS
2003
IEEE
15 years 9 months ago
An Improved Schedulability Test for Uniprocessor Periodic Task Systems
We present a sufficient linear-time schedulability test for preemptable, asynchronous, periodic task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an ...
UmaMaheswari C. Devi
110
Voted
ECRTS
2002
IEEE
15 years 9 months ago
POSIX-Compatible Application-Defined Scheduling in MaRTE OS
Abstract: This paper presents an application program interface (API) that enables applications to use applicationdefined scheduling algorithms in a way compatible with the scheduli...
Mario Aldea Rivas, Michael González Harbour
IJFCS
2006
63views more  IJFCS 2006»
15 years 4 months ago
Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...
Mourad Hakem, Franck Butelle
156
Voted
OPODIS
2010
15 years 2 months ago
Tardiness Bounds for Global EDF with Deadlines Different from Periods
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
Jeremy Erickson, Nan Guan, Sanjoy K. Baruah