Sciweavers

614 search results - page 22 / 123
» Resource Minimization Job Scheduling
Sort
View
STOC
1997
ACM
129views Algorithms» more  STOC 1997»
15 years 3 months ago
Better Bounds for Online Scheduling
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
Susanne Albers
CORR
2007
Springer
131views Education» more  CORR 2007»
14 years 11 months ago
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
Guolong Lin, Rajmohan Rajaraman
LATIN
2004
Springer
15 years 5 months ago
On the Competitiveness of AIMD-TCP within a General Network
This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when...
Jeff Edmonds
SPAA
2010
ACM
14 years 12 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
JSSPP
2000
Springer
15 years 3 months ago
Time-Sharing Parallel Jobs in the Presence of Multiple Resource Requirements
Abstract. Buffered coscheduling is a new methodology that can substantially increase resource utilization, improve response time, and simplify the development of the run-time suppo...
Fabrizio Petrini, Wu-chun Feng