16 search results - page 1 / 4 » On Scheduling Complex Dags for Internet-Based Computing |
58
Voted
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
66
Voted
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
A fundamental challenge in Internet computing (IC) is to efficiently schedule computations having complex interjob dependencies, given the unpredictability of remote machines, in...
EUROPAR
2005
Springer
15 years 3 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...
84
Voted
ICDCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Earlier work has developed the underpinnings of a theory of scheduling computations having intertask dependencies—modeled via dags—for Internet-based computing. The goal of th...
121
click to vote
ISPDC
2008
IEEE
15 years 4 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...