Sciweavers

ICDCS
2006
IEEE
13 years 10 months ago
On Scheduling Expansive and Reductive Dags for Internet-Based Computing
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...
Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Ros...
IPPS
2007
IEEE
13 years 11 months ago
Applying IC-Scheduling Theory to Familiar Classes of Computations
Earlier work has developed the underpinnings of IC-Scheduling Theory, an algorithmic framework for scheduling computations having intertask dependencies for Internet-based computi...
Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Ros...
IPPS
2009
IEEE
13 years 11 months ago
On scheduling dags to maximize area
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...
Gennaro Cordasco, Arnold L. Rosenberg