Sciweavers

120 search results - page 7 / 24
» Tractable Optimal Competitive Scheduling
Sort
View
ALGORITHMICA
2005
84views more  ALGORITHMICA 2005»
14 years 9 months ago
Optimal Read-Once Parallel Disk Scheduling
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the n...
Mahesh Kallahalla, Peter J. Varman
COR
2011
14 years 4 months ago
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
Sven Oliver Krumke, Alfred Taudes, Stephan Westpha...
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
15 years 3 months ago
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
In real systems, such as operating systems, the scheduler is often unaware of the remaining work in each job or of the ability of the job to take advantage of more resources. In th...
Julien Robert, Nicolas Schabanel
ICWN
2007
14 years 11 months ago
Utility-Based Divisible Sensing Task Scheduling in Wireless Sensor Networks
This paper presents a tractable optimization strategies of sensing workload scheduling in wireless sensor networks using Divisible Load Theory (DLT). Because of the limited batter...
Xiaolin Li, Xinxin Liu, Peng Guan, Hui Kang
WIOPT
2005
IEEE
15 years 3 months ago
Minimum Energy Transmission Scheduling Subject to Deadline Constraints
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
Alessandro Tarello, Jun Sun 0007, Murtaza Zafer, E...