109 search results - page 10 / 22 » Convex programming for scheduling unrelated parallel machine... |
148
click to vote
FOCS
2007
IEEE
15 years 5 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
188
click to vote
HPDC
1995
IEEE
15 years 4 months ago
1995
IEEE
In this paper, we study the problem of scheduling parallel loops at compile-time for a heterogeneous network of machines. We consider heterogeneity in three aspects of parallel pr...
112
click to vote
CCGRID
2001
IEEE
15 years 5 months ago
2001
IEEE
High performance computing on parallel architectures currently uses different approaches depending on the hardory model of the architecture, the abstraction level of the programmi...
PLDI
1996
ACM
15 years 5 months ago
1996
ACM
High performance compilers increasingly rely on accurate modeling of the machine resources to efficiently exploit the instruction level parallelism of an application. In this pape...
124
click to vote
PLDI
2011
ACM
14 years 4 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...