13 search results - page 2 / 3 » Preemptive on-line scheduling for two uniform processors |
ICPPW
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— In the sporadic task model, a task is characterized by three parameters — an execution requirement, a relative deadline, and a period parameter — and has the interp...
DATE
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper presents two fully polynomial-time sufficient feasibility tests for EDF when considering periodic tasks with arbitrary deadlines and preemptive scheduling on uniproces...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
RTSS
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract—The functional consolidation induced by the costreduction trends in embedded systems can force tasks of different criticality (e.g. ABS Brakes with DVD) to share a proce...
EUROPAR
2005
Springer
13 years 10 months ago
2005
Springer
Dynamic instruction scheduling logic is one of the most critical and cycle-limiting structures in modern superscalar processors, and it is not easily pipelined without significant ...