254 search results - page 39 / 51 » Approximation Algorithms for Scheduling Parallel Jobs |
AAAI
1998
14 years 10 months ago
1998
Scheduling of multiple parallel machinesin the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteedto pro...
91
Voted
RTS
2008
14 years 9 months ago
2008
There has been much recent interest in the use of the earliest-deadline-first (EDF) algorithm for scheduling soft real-time sporadic task systems on identical multiprocessors. In ...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
In a grid computing environment, resources are autonomous, wide-area distributed, and what’s more, they are usually not free. These unique characteristics make scheduling in a s...
DAM
2007
14 years 9 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
HPDC
1999
IEEE
15 years 1 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...