Optimal broadcast and summation in the LogP model
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Optimal speedup for backtrack search on a butterfly network
Proceedings of the 3rd ACM symposium on Parallel algorithms and architectures
The complexity of scheduling trees with communication delays
Journal of Algorithms
Optimal emulations by butterfly-like networks
Journal of the ACM (JACM)
Scheduling tree-dags using FIFO queues: a control-memory trade-off
Journal of Parallel and Distributed Computing
Simple Algorithms for Routing on Butterfly Networks with Bounded Queues
SIAM Journal on Computing
Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments
IEEE Transactions on Parallel and Distributed Systems
SETI@HOME—massively distributed computing for SETI
Computing in Science and Engineering
Managing trust in a peer-2-peer information system
Proceedings of the tenth international conference on Information and knowledge management
Introduction to Algorithms
IEEE Transactions on Parallel and Distributed Systems
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
The Complexity of Scheduling Problems with Communication Delays for Trees
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Uncheatable Distributed Computations
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
I/O complexity: The red-blue pebble game
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
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
On Scheduling Complex Dags for Internet-Based Computing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Parallel scheduling of complex dags under uncertainty
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Toward a Theory for Scheduling Dags in Internet-Based Computing
IEEE Transactions on Computers
A probabilistic scheduling heuristic for computational grids
Multiagent and Grid Systems
IEEE Transactions on Parallel and Distributed Systems
Evaluation of Eligible Jobs Maximization Algorithm for DAG Scheduling in Grids
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
New worker-centric scheduling strategies for data-intensive grid applications
Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware
Efficient on-demand operations in dynamic distributed infrastructures
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
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
New worker-centric scheduling strategies for data-intensive grid applications
MIDDLEWARE2007 Proceedings of the 8th ACM/IFIP/USENIX international conference on Middleware
An incentive approach for computational resource sharing in the autonomous environment
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive 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
Batch-Scheduling dags for internet-based computing
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Internet computing of tasks with dependencies using unreliable workers
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
A pebble game for internet-based computing
Theoretical Computer Science
On scheduling dag s for volatile computing platforms: Area-maximizing schedules
Journal of Parallel and Distributed Computing
| Hi-index | 14.99 |
A "pebble game驴 is developed to model the process of scheduling computation-dags for Internet-based computing (IC, for short). Strategies are derived for scheduling three common, significant families of such dags for IC: reduction-meshes, which represent (the intertask dependencies of) computations that can be performed by "up-sweeps驴 of meshes; reduction-trees, which represent "accumulative驴 computations that can be performed by "up-sweeps驴 of trees; and FFT (Fast Fourier Transform) dags, which represent a large variety of convolutional computations. Two criteria are used to assess the quality of a schedule: its memory requirements and its rate of producing tasks that are eligible for allocation to remote clients. These criteria are important because of, respectively, the typically enormous sizes of IC computations and the typical temporal unpredictability of remote clients in IC. In particular, a high production rate of eligible tasks decreases a computation's vulnerability to the gridlock that can occur when a computation stalls pending the return of intermediate results by remote clients. Under idealized assumptions, the schedules derived are optimal in the rate of producing eligible tasks and are either exactly or approximately optimal in memory requirements.