Sciweavers

614 search results - page 82 / 123
» Resource Minimization Job Scheduling
Sort
View
HPCA
2002
IEEE
16 years 2 months ago
A New Memory Monitoring Scheme for Memory-Aware Scheduling and Partitioning
We propose a low overhead, on-line memory monitoring scheme utilizing a set of novel hardware counters. The counters act like pressure gauges indicating the marginal gain in the n...
G. Edward Suh, Srinivas Devadas, Larry Rudolph
115
Voted
RTSS
2005
IEEE
15 years 7 months ago
A Hybrid Static/Dynamic DVS Scheduling for Real-Time Systems with (m, k)-Guarantee
Energy reduction is critical to increase the mobility and to extend the mission period in the development of today’s pervasive computing systems. On the other hand, however, ene...
Linwei Niu, Gang Quan
IPPS
2006
IEEE
15 years 8 months ago
A probabilistic approach for fault tolerant multiprocessor real-time scheduling
In this paper we tackle the problem of scheduling a periodic real-time system on identical multiprocessor platforms, moreover the tasks considered may fail with a given probabilit...
Vandy Berten, Joël Goossens, Emmanuel Jeannot
DAM
2007
100views more  DAM 2007»
15 years 1 months ago
Partially ordered knapsack and applications to scheduling
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
Stavros G. Kolliopoulos, George Steiner
INFOCOM
2011
IEEE
14 years 5 months ago
A nearly-optimal index rule for scheduling of users with abandonment
—We analyze a comprehensive model for multi-class job scheduling accounting for user abandonment, with the objective of minimizing the total discounted or time-average sum of lin...
Urtzi Ayesta, Peter Jacko, Vladimir Novak