Sciweavers

70 search results - page 7 / 14
» Online Scheduling to Minimize the Maximum Delay Factor
Sort
View
FOCS
2007
IEEE
13 years 11 months ago
Minimizing Average Flow-time : Upper and Lower Bounds
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg, Amit Kumar
BIRTHDAY
2009
Springer
13 years 11 months ago
Minimizing Average Flow-Time
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg
INFOCOM
1999
IEEE
13 years 12 months ago
A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees
With the proliferationof multimediagroup applications, the construction of multicast trees satisfying Qualityof ServiceQoS requirementsis becominga problemof prime importance. Man...
R. Sriram, G. Manimaran, C. Siva Ram Murthy
ICCD
2006
IEEE
126views Hardware» more  ICCD 2006»
14 years 4 months ago
Task Merging for Dynamic Power Management of Cyclic Applications in Real-Time Multi-Processor Systems
—In this paper we propose the method of task merging and idle period clustering for dynamic power management (DPM) in a real-time system with multiple processing elements. We sho...
Shaobo Liu, Qinru Qiu, Qing Wu
TC
2010
13 years 2 months ago
Scheduling Concurrent Bag-of-Tasks Applications on Heterogeneous Platforms
Abstract-- Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper we deal with t...
Anne Benoit, Loris Marchal, Jean-Francois Pineau, ...