89 search results - page 4 / 18 » Fault-Tolerant Partitioning Scheduling Algorithms in Real-Ti... |
155
Voted
ECRTS
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper investigates resource allocation policies for achieving real-time content distribution with subsecond delay bounds on the current Internet. Resource allocation in real-...
150
Voted
VLSID
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents Frame Based Fair Multiprocessor Scheduler (FBFMS) which provides accurate real-time proportional fair scheduling for a set of dynamic tasks on a symmetric mult...
155
Voted
RTSS
2002
IEEE
15 years 9 months ago
2002
IEEE
Simultaneous multithreading (SMT) improves processor throughput by processing instructions from multiple threads each cycle. This is the first work to explore soft real-time sche...
134
Voted
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
After having drawn up a state of the art on the theoretical feasibility of a system of periodic tasks scheduled by a preemptive algorithm at fixed priorities, we show in this art...
140
click to vote
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...