138 search results - page 13 / 28 » A Parallel Branch-and-Bound Algorithm for Computing Optimal ... |
ISCA
2002
IEEE
13 years 7 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
ISPDC
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper presents a new approach for analyzing the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Gr...
IPPS
2003
IEEE
14 years 23 days ago
2003
IEEE
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
EUROPAR
2005
Springer
14 years 1 months ago
2005
Springer
The process of scheduling computations for Internet-based computing presents challenges not encountered with more traditional platforms for parallel and distributed computing. The...
ISPAN
2002
IEEE
14 years 12 days 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...