138 search results - page 9 / 28 » A Parallel Branch-and-Bound Algorithm for Computing Optimal ... |
ISPAN
1997
IEEE
13 years 11 months ago
1997
IEEE
The thesis of this research is that the task of exposing the parallelism in a given application should be left to the algorithm designer, who has intimate knowledge of the applica...
IEEEPACT
1997
IEEE
13 years 11 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
CLUSTER
2006
IEEE
14 years 1 months ago
2006
IEEE
The paper addresses the problem of matching and scheduling of DAG-structured application to both minimize the makespan and maximize the robustness in a heterogeneous computing sys...
EUROPAR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We consider approaches that allow task migration for scheduling recurrent directed-acyclic-graph (DAG) tasks on symmetric, shared-memory multiprocessors (SMPs) in order t...
IPPS
1998
IEEE
13 years 11 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 ...