108 search results - page 1 / 22 » A Lower Bound for Dynamic Scheduling of Data Parallel Progra... |
EUROPAR
1998
Springer
13 years 9 months ago
1998
Springer
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
SPAA
1995
ACM
13 years 8 months ago
1995
ACM
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
ISPAN
2002
IEEE
13 years 10 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
CPAIOR
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...