Sciweavers

375 search results - page 52 / 75
» On-Line Scheduling of Parallel Jobs
Sort
View
JCO
2010
99views more  JCO 2010»
13 years 6 months ago
Online scheduling with a buffer on related machines
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
György Dósa, Leah Epstein
SPAA
2009
ACM
14 years 8 months ago
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs
ICALP
2004
Springer
14 years 1 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
IPPS
2005
IEEE
14 years 1 months ago
Self-Adaptive Scheduler Parameterization via Online Simulation
High-end parallel systems present a tremendous research challenge on how to best allocate their resources to match dynamic workload characteristics and user habits that are often ...
Barry Lawson, Evgenia Smirni
PDPTA
2008
13 years 9 months ago
A Genetic Algorithm Based Dynamic Load Balancing Scheme for Heterogeneous Distributed Systems
- Load balancing is a crucial issue in parallel and distributed systems to ensure fast processing and optimum utilization of computing resources. Load balancing strategies try to e...
Bibhudatta Sahoo, Sudipta Mohapatra, Sanjay Kumar ...