281 search results - page 32 / 57 » A Dynamic Load Balancing Strategy for Parallel Datacube Comp... |
128
click to vote
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
136
Voted
ICPP
2006
IEEE
15 years 9 months ago
2006
IEEE
Modeling the performance behavior of parallel applications to predict the execution times of the applications for larger problem sizes and number of processors has been an active ...
149
click to vote
EGPGV
2004
Springer
15 years 8 months ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
127
click to vote
ICPP
2008
IEEE
15 years 9 months ago
2008
IEEE
We introduce Scioto, Shared Collections of Task Objects, a lightweight framework for providing task management on distributed memory machines under one-sided and globalview parall...
127
click to vote
MIDDLEWARE
2007
Springer
15 years 9 months ago
2007
Springer
In ad-hoc Grids where the availability of resources and tasks changes over the time, distributing the tasks among the scarce resources in a balanced way is a challenging task. In ...