July 4, 2006 to July 7, 2006
Gennaro Cordasco , Univ. of Salerno
Grzegorz Malewicz , Google, Inc.
Arnold L. Rosenberg , Univ. of Massachusetts
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCS.2006.58
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 always having work to allocate to an available client; (b) to lessen the likelihood of the "gridlock" that ensues when a computation stalls for lack of eligible tasks. The dags handled by the theory thus far are those that can be constructed from a given collection of bipartite building-block dags via the operation of dagcomposition. The current paper extends the range of applicability of the theory by significantly expanding the repertoire of building-block dags that the scheduling algorithms can handle. Thereby, the theory can now schedule large classes of "expansive" and "reductive" dags optimally.
Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg, "On Scheduling Expansive and Reductive Dags for Internet-Based Computing", ICDCS, 2006, 26th IEEE International Conference on Distributed Computing Systems, 26th IEEE International Conference on Distributed Computing Systems 2006, pp. 29, doi:10.1109/ICDCS.2006.58