30 search results - page 1 / 6 » On scheduling dags to maximize area |
IPPS
2009
IEEE
14 years 5 months ago
2009
IEEE
A new quality metric, called area, is introduced for schedules that execute dags, i.e., computations having intertask dependencies. Motivated by the temporal unpredictability enco...
ISPDC
2008
IEEE
14 years 5 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
2007
IEEE
14 years 5 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...
CPM
1994
Springer
14 years 3 months ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
PIMRC
2008
IEEE
14 years 5 months ago
2008
IEEE
—WiMAX mesh mode, recently standardized, enables direct communications between subscriber stations without referring to the base station (BS). It can be a great solution for prov...