Sciweavers

1292 search results - page 31 / 259
» Revisiting the optimal scheduling problem
Sort
View
PE
2010
Springer
175views Optimization» more  PE 2010»
13 years 3 months ago
Generalized ERSS tree model: Revisiting working sets
Accurately characterizing the resource usage of an application at various levels in the memory hierarchy has been a long-standing research problem. Existing characterization studi...
Ricardo Koller, Akshat Verma, Raju Rangaswami
PPAM
2005
Springer
14 years 1 months ago
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...
Krzysztof Giaro, Marek Kubale
JTRES
2010
ACM
13 years 8 months ago
Cyclic executive for safety-critical Java on chip-multiprocessors
Chip-multiprocessors offer increased processing power at a low cost. However, in order to use them for real-time systems, tasks have to be scheduled efficiently and predictably. I...
Anders P. Ravn, Martin Schoeberl
JACM
2006
146views more  JACM 2006»
13 years 8 months ago
Limits on the ability of quantum states to convey classical messages
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
Ashwin Nayak, Julia Salzman
AUSAI
2005
Springer
14 years 2 months ago
Adaptive Utility-Based Scheduling in Resource-Constrained Systems
This paper addresses the problem of scheduling jobs in soft real-time systems, where the utility of completing each job decreases over time. We present a utility-based framework fo...
David Vengerov