1536 search results - page 134 / 308 » DPS - Dynamic Parallel Schedules |
107
Voted
EUROPAR
2010
Springer
15 years 4 months ago
2010
Springer
The bag-of-tasks application model, albeit simple, arises in many application domains and has received a lot of attention in the scheduling literature. Previous works propose eithe...
116
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
IJHPCA
2006
15 years 3 months ago
2006
Divide-and-conquer is a well-suited programming paradigm for parallel Grid applications. Our Satin system efficiently schedules the finegrained tasks of a divide-and-conquer appli...
106
Voted
JSSPP
2009
Springer
15 years 10 months ago
2009
Springer
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...
125
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
The duration of time for which each application locks each shared resource is critically important in composing multiple independently-developed applications upon a shared “open...