Sciweavers

20 search results - page 1 / 4
» The Partitioned Scheduling of Sporadic Tasks According to St...
Sort
View
ECRTS
2006
IEEE
13 years 10 months ago
The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
Nathan Fisher, Sanjoy K. Baruah, Theodore P. Baker
RTAS
2011
IEEE
12 years 8 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
ECRTS
2009
IEEE
13 years 2 months ago
Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors
This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept o...
Shinpei Kato, Nobuyuki Yamasaki, Yutaka Ishikawa
RTSS
2005
IEEE
13 years 9 months ago
The Partitioned Multiprocessor Scheduling of Sporadic Task Systems
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform. Since the partitioning probl...
Sanjoy K. Baruah, Nathan Fisher
RTCSA
2005
IEEE
13 years 9 months ago
Real-Time Scheduling of Sporadic Task Systems When the Number of Distinct Task Types Is Small
In some real-time application systems, there are only a few distinct kinds of tasks, each of which may be instantiated several times during runtime. The scheduling of such sporadi...
Sanjoy K. Baruah, Nathan Fisher