Sciweavers

RTS
2010
103views more  RTS 2010»
13 years 4 months ago
LRE-TL: an optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
This article presents a detailed discussion of LRE-TL (Local Remaining Execution - TL-plane), an algorithm that schedules hard real-time periodic and sporadic task sets with uncon...
Shelby Funk
ECRTS
2004
IEEE
13 years 10 months ago
A New Sufficient Feasibility Test for Asynchronous Real-Time Periodic Task Sets
The problem of feasibility analysis for asynchronous periodic task sets (i.e. where tasks can have an initial offset) is known to be co-NP-complete in the strong sense. A sufficie...
Rodolfo Pellizzoni, Giuseppe Lipari
RTSS
2000
IEEE
13 years 11 months ago
Static-Priority Periodic Scheduling on Multiprocessors
We present a new sufficient condition for the schedulability of preemptable, periodic, hard-real-time task sets using the very simple static-priority weight-monotonic scheduling ...
Srikanth Rarnarnurthy, Mark Moir
RTCSA
2000
IEEE
13 years 11 months ago
Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition
Traditional multiprocessor real-time scheduling partitions a task set and applies uniprocessor scheduling on each processor. By allowing a task to resume on another processor than...
Björn Andersson, Jan Jonsson
RTSS
2002
IEEE
13 years 11 months ago
The Space of Rate Monotonic Schedulability
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic ...
Enrico Bini, Giorgio C. Buttazzo
ECRTS
2005
IEEE
14 years 4 days 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
IESS
2007
Springer
110views Hardware» more  IESS 2007»
14 years 20 days ago
Run-Time efficient Feasibility Analysis of Uni-Processor Systems with Static Priorities
: The performance of feasibility tests is crucial in many applications. When using feasibility tests online only a limited amount of analysis time is available. Run-time efficiency...
Karsten Albers, Frank Bodmann, Frank Slomka
DATE
2007
IEEE
105views Hardware» more  DATE 2007»
14 years 26 days ago
Instruction-set customization for real-time embedded systems
Application-specific customization of the instruction set helps embedded processors achieve significant performance and power efficiency. In this paper, we explore customizatio...
Huynh Phung Huynh, Tulika Mitra
RTAS
2008
IEEE
14 years 27 days ago
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
Harini Ramaprasad, Frank Mueller