IPPS
2005
IEEE
13 years 10 months ago
2005
IEEE
With the latest high-end computing nodes combining shared-memory multiprocessing with hardware multithreading, new scheduling policies are necessary for workloads consisting of mu...
ADAEUROPE
2006
Springer
13 years 10 months ago
2006
Springer
When a middleware layer is designed for providing semi-transparent distribution facilities to real-time applications, a trade-off must be made between the expressiveness and contro...
RTAS
2006
IEEE
13 years 10 months ago
2006
IEEE
Prior research on schedulability bounds focused primarily on bounding utilization as a means to meet deadline constraints. Non-trivial bounds were found for a handful of schedulin...
DATE
2007
IEEE
13 years 11 months ago
2007
IEEE
In deep submicron circuits, elevation in temperatures has brought new challenges in reliability, timing, performance, cooling costs and leakage power. Conventional thermal managem...
RTAS
2008
IEEE
13 years 11 months ago
2008
IEEE
A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid...
HPDC
2008
IEEE
13 years 11 months ago
2008
IEEE
Ever more scientists are employing large-scale distributed systems such as grids for their computational work, instead of tightly coupled high-performance computing systems. Howev...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—The design of scheduling policies for wireless data systems has been driven by a compromise between the objectives of high overall system throughput and the degree of fairness a...