Sciweavers

24 search results - page 5 / 5
» Randomized Approximation Schemes for Scheduling Unrelated Pa...
Sort
View
145
Voted
FOCS
2007
IEEE
15 years 5 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
113
Voted
IPPS
2007
IEEE
15 years 7 months ago
Stochastic Approach to Scheduling Multiple Divisible Tasks on a Heterogeneous Distributed Computing System
Heterogeneity has been considered in scheduling, but without taking into account the temporal variation of completion times of the sub-tasks for a divisible, independent task. In ...
Ankur Kamthe, Soo-Young Lee
102
Voted
HPDC
2006
IEEE
15 years 7 months ago
Path Grammar Guided Trace Compression and Trace Approximation
Trace-driven simulation is an important technique used in the evaluation of computer architecture innovations. However using it for studying parallel computers and applications is...
Xiaofeng Gao, Allan Snavely, Larry Carter
115
Voted
ICALP
2004
Springer
15 years 6 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella