192 search results - page 17 / 39 » Preemptive Scheduling with Rejection |
RTSS
2000
IEEE
14 years 2 months ago
2000
IEEE
A framework for scheduling a number of di erent real-time applications on a single shared preemptable processor is proposed. This framework enforces complete isolation among the d...
RTAS
2008
IEEE
14 years 4 months ago
2008
IEEE
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
DAC
1997
ACM
14 years 2 months ago
1997
ACM
Task scheduling forreactive real time systems is a di cult problem due to tight constraints that the schedule must satisfy. A static priority scheme is proposed here that can be f...
ICPP
1998
IEEE
14 years 2 months ago
1998
IEEE
This paper presents a new schedulability analysis methodology for distributed hard real-time systems with bursty job arrivals. The schedulability is analyzed by comparing worst-ca...
AAIM
2006
Springer
14 years 3 months ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...