Applying IC-Scheduling Theory to Familiar Classes of Computations

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.

[1]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[2]  David P. Anderson,et al.  SETI@home-massively distributed computing for SETI , 2001, Comput. Sci. Eng..

[3]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[4]  V. Benes.  Optimal rearrangeable multistage connecting networks , 1964 .

[5]  Arnold L. Rosenberg,et al.  On Scheduling Expansive and Reductive Dags for Internet-Based Computing , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[6]  Arnold L. Rosenberg,et al.  A Tight Layout of the Butterfly Network , 1998, Theory of Computing Systems.

[7]  Grzegorz Malewicz,et al.  Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably , 2007, Theory of Computing Systems.

[8]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[9]  Arnold L. Rosenberg,et al.  A Comparison of Dag-Scheduling Strategies for Internet-Based Computing , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[10]  Arnold L. Rosenberg,et al.  Guidelines for scheduling some common computation-dags for Internet-based computing , 2005, IEEE Transactions on Computers.

[11]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[12]  Arnold L. Rosenberg,et al.  Batch-Scheduling Dags for Internet-Based Computing , 2005, Euro-Par.

[13]  Arnold L. Rosenberg,et al.  A Tool for Prioritizing DAGMan Jobs and its Evaluation , 2006, 2006 15th IEEE International Conference on High Performance Distributed Computing.

[14]  I. Foster,et al.  Advances in a Dag-Scheduling Theory for Internet-Based Computing , 2006 .

[15]  L. Bluestein.  A linear filtering approach to the computation of discrete Fourier transform , 1970 .

[16]  Guy E. Blelloch,et al.  Scans as Primitive Parallel Operations , 1989, ICPP.

[17]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[18]  Ian T. Foster,et al.  The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[19]  Arnold L. Rosenberg,et al.  On scheduling mesh-structured computations for Internet-based computing , 2004, IEEE Transactions on Computers.

[20]  Keith Marzullo,et al.  The computational Co-op: Gathering clusters into a metacomputer , 1999, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999.

[21]  Arnold L. Rosenberg,et al.  Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality , 2007, IEEE Transactions on Parallel and Distributed Systems.

[22]  Arnold L. Rosenberg,et al.  Toward a theory for scheduling dags in Internet-based computing , 2006, IEEE Transactions on Computers.

[23]  Francine Berman,et al.  Models and scheduling mechanisms for global computing applications , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[24]  Mit Press,et al.  A Linear Filtering Approach to the Computation of the Discrete Fourier Transform , 1969 .

[25]  Stephen A. Cook,et al.  An observation on time-storage trade off , 1973, J. Comput. Syst. Sci..

[26]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[27]  Arnold L. Rosenberg,et al.  A Tight Layout of the Butterfly Network , 1996, SPAA '96.

[28]  David Abramson,et al.  A case for economy grid architecture for service oriented grid computing , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.