Introduction to algorithms
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
An Algorithm for Finding a Minimal Equivalent Graph of a Digraph
Journal of the ACM (JACM)
SETI@HOME—massively distributed computing for SETI
Computing in Science and Engineering
Models and Scheduling Mechanisms for Global Computing Applications
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
The Computational Co-op: Gathering Clusters into a Metacomputer
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
A Case for Economy Grid Architecture for Service Oriented Grid Computing
IPDPS '01 Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2
On Scheduling Mesh-Structured Computations for Internet-Based Computing
IEEE Transactions on Computers
Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing
IEEE Transactions on Computers
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
Creating minimal vertex series parallel graphs from directed acyclic graphs
APVis '04 Proceedings of the 2004 Australasian symposium on Information Visualisation - Volume 35
Toward a Theory for Scheduling Dags in Internet-Based Computing
IEEE Transactions on Computers
Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably
Theory of Computing Systems
Batch-Scheduling dags for internet-based computing
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Evaluation of Eligible Jobs Maximization Algorithm for DAG Scheduling in Grids
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Investigation of the DAG eligible jobs maximization algorithm in a grid
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Extending IC-scheduling via the Sweep Algorithm
Journal of Parallel and Distributed Computing
Area-maximizing schedules for series-parallel DAGs
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Assessing the computational benefits of AREA-oriented DAG-scheduling
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
On scheduling dag s for volatile computing platforms: Area-maximizing schedules
Journal of Parallel and Distributed Computing
Online parallel scheduling of non-uniform tasks: trading failures for energy
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Hi-index | 0.00 |
Earlier work has developed the underpinnings of IC-Scheduling Theory, a frame- work for 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, with the dual aim of: (a) utiliz- ing remote clients' computational resources well, by always having work to allocate to an available client; (b) lessening the likelihood of a computation's stalling for lack of eligible tasks. The dags handled by the Theory thus far are those that can be decomposed into a given collection of bipartite building-block dags via the operation of dag-decomposition. A basic tool in constructing schedules is a relation B, which allows one to "prioritize" the scheduling of a complex dag's building blocks. The current paper extends IC-Scheduling Theory in two ways: by expanding significantly the repertoire of dags that the Theory can schedule optimally, and by allowing one sometimes to shortcut the algorithmic process required to find optimal schedules. The expanded repertoire now allows the Theory to schedule optimally, among other dags, a large range of dags that are either "expansive," in the sense that they grow outward from their sources, or "reductive," in the sense that they grown inward toward their sinks. The algorithmic shortcuts allow one to "read off" an optimal schedule for a dag from a given optimal schedule for the dag's dual, which is obtained by reversing all arcs (thereby exchanging the roles of sources and sinks).