2438 search results - page 21 / 488 » Scheduling problems for parallel and distributed systems |
156
click to vote
HIPC
2000
Springer
15 years 7 months ago
2000
Springer
Heterogeneous computing environments have become attractive platforms to schedule computationally intensive jobs. We consider the problem of mapping independent tasks onto machines...
134
click to vote
IPPS
1996
IEEE
15 years 8 months ago
1996
IEEE
In a shared-memory multiprocessor system, it is possible that certain synchronization operations are redundant -that is, their corresponding sequencing requirements are enforced c...
158
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
197
Voted
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
123
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...