Sciweavers

457 search results - page 11 / 92
» Decay-Usage Scheduling in Multiprocessors
Sort
View
RTAS
2011
IEEE
12 years 11 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
2005
IEEE
14 years 1 months ago
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
Multiprocessor hardware platforms are now being considered for embedded systems, due to their high computational power and little additional cost when compared to single processor...
Marko Bertogna, Michele Cirinei, Giuseppe Lipari
SODA
2004
ACM
96views Algorithms» more  SODA 2004»
13 years 8 months ago
Non-migratory online deadline scheduling on multiprocessors
In this paper we consider multiprocessor scheduling with hard deadlines and investigate the cost of eliminating migration in the online setting. Let I be any set of jobs that can ...
Ho-Leung Chan, Tak Wah Lam, Kar-Keung To
IPPS
2008
IEEE
14 years 1 months ago
Portioned static-priority scheduling on multiprocessors
This paper proposes an efficient real-time scheduling algorithm for multiprocessor platforms. The algorithm is a derivative of the Rate Monotonic (RM) algorithm, with its basis on...
Shinpei Kato, Nobuyuki Yamasaki
RTCSA
2009
IEEE
14 years 2 months ago
Accounting for Interrupts in Multiprocessor Real-Time Systems
The importance of accounting for interrupts in multiprocessor real-time schedulability analsysis is discussed. Three interrupt accounting methods, two of which are newly described...
Björn B. Brandenburg, Hennadiy Leontyev, Jame...