312 search results - page 8 / 63 » On the Design and Evaluation of Job Scheduling Algorithms |
113
click to vote
IOR
2010
14 years 10 months ago
2010
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
101
click to vote
ICA3PP
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we present an algorithm for scheduling of distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring ...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
The performance of computer systems depends, among other things, on the workload. This motivates the use of real workloads (as recorded in activity logs) to drive simulations of n...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
NIPS
2008
15 years 1 months ago
2008
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...