Applying IC-Scheduling Theory to Familiar Classes of Computations
- 1 January 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 1-8
Abstract
Earlier work has developed the underpinnings of IC-scheduling theory, an algorithmic framework for scheduling computations having intertask dependencies for Internet-based computing (IC). The theory aims to produce schedules that render tasks eligible for execution at the maximum possible rate, so as to: (a) utilize remote clients' computational resources well, by always having work available for allocation; (b) lessen the likelihood that a computation can stall for lack of tasks that are eligible for execution. The current paper reconnects the theory, which models computations abstractly, with a variety of significant real computations and computational paradigms, by illustrating how to schedule these computations optimally.Keywords
This publication has 14 references indexed in Scilit:
- A Tool for Prioritizing DAGMan Jobs and its EvaluationJournal of Grid Computing, 2007
- A Comparison of Dag-Scheduling Strategies for Internet-Based Computing2007
- Toward a theory for scheduling dags in Internet-based computingIEEE Transactions on Computers, 2006
- The anatomy of the grid: enabling scalable virtual organizations2005
- Guidelines for Scheduling Some Common Computation-Dags for Internet-Based ComputingIEEE Transactions on Computers, 2005
- On scheduling mesh-structured computations for Internet-based computingIEEE Transactions on Computers, 2004
- Models and scheduling mechanisms for global computing applications2002
- SETI@home-massively distributed computing for SETIComputing in Science & Engineering, 2001
- Scans as primitive parallel operationsIEEE Transactions on Computers, 1989
- Optimal Rearrangeable Multistage Connecting NetworksBell System Technical Journal, 1964