1536 search results - page 58 / 308 » DPS - Dynamic Parallel Schedules |
142
click to vote
MST
2000
15 years 5 months ago
2000
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
153
click to vote
ISHPC
2003
Springer
15 years 11 months ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
164
click to vote
COR
2006
15 years 6 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
205
click to vote
IEEEPACT
1998
IEEE
15 years 10 months ago
1998
IEEE
In this paper, we present an efficient algorithm, called CASS-II, for task clustering without task duplication. Unlike the DSC algorithm, which is empirically the best known algor...
195
click to vote
PVG
2003
IEEE
15 years 11 months ago
2003
IEEE
Parallel volume rendering offers a feasible solution to the large data visualization problem by distributing both the data and rendering calculations among multiple computers con...