Sciweavers

188 search results - page 31 / 38
» Regret Minimization and Job Scheduling
Sort
View
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
13 years 11 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
EOR
2006
70views more  EOR 2006»
13 years 7 months ago
A multi-period machine assignment problem
In this paper, a multi-period assignment problem is studied that arises as part of a weekly planning problem at mail processing and distribution centers. These facilities contain ...
Xinhui Zhang, Jonathan F. Bard
IPCCC
2006
IEEE
14 years 1 months ago
SHARP: a new real-time scheduling algorithm to improve security of parallel applications on heterogeneous clusters
This paper addresses the problem of improving quality of security for real-time parallel applications on heterogeneous clusters. We propose a new security- and heterogeneity-drive...
Tao Xie 0004, Xiao Qin, Mais Nijim
HPCA
2002
IEEE
14 years 8 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
RTSS
2005
IEEE
14 years 1 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