On Scheduling Expansive and Reductive Dags for Internet-Based Computing

Abstract

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 the schedules produced is to render tasks eligible for execution at the maximum possible rate. This goal aims: (a) to utilize remote clients’ computational resources well, by… (More)
DOI: 10.1109/ICDCS.2006.58

Topics

2 Figures and Tables

Cite this paper

@article{Cordasco2006OnSE, title={On Scheduling Expansive and Reductive Dags for Internet-Based Computing}, author={Gennaro Cordasco and Grzegorz Malewicz and Arnold L. Rosenberg}, journal={26th IEEE International Conference on Distributed Computing Systems (ICDCS'06)}, year={2006}, pages={29-29} }