206 search results - page 20 / 42 » Parallel Job Scheduling with Overhead: A Benchmark Study |
AUSDM
2008
Springer
13 years 9 months ago
2008
Springer
Spreadsheets applications allow data to be stored with low development overheads, but also with low data quality. Reporting on data from such sources is difficult using traditiona...
ALGORITHMICA
2002
13 years 7 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
CLUSTER
2004
IEEE
13 years 11 months ago
2004
IEEE
We describe the use of component architecture in an area to which this approach has not been classically applied, the area of cluster system software. By "cluster system soft...
ESWA
2010
13 years 6 months ago
2010
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most prod...
IWOMP
2009
Springer
14 years 2 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...