254 search results - page 13 / 51 » Approximation Algorithms for Scheduling Parallel Jobs |
GCC
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
101
click to vote
STOC
1997
ACM
15 years 1 months ago
1997
ACM
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...
CCGRID
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper addresses the potential benefit of sharing jobs between independent sites in a grid computing environment. Also the aspect of parallel multi-site job execution on diff...
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
Previous work on scheduling dynamic competitive jobs is focused on multiprocessors configurations. This paper presents a new distributed dynamic scheduling scheme for sporadic re...
CLUSTER
2005
IEEE
15 years 3 months ago
2005
IEEE
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...