This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Scheduling Mesh-Structured Computations for Internet-Based Computing
September 2004 (vol. 53 no. 9)
pp. 1176-1186
Advances in technology have rendered the Internet a viable medium for employing multiple independent computers collaboratively in the solution of a single computational problem. A variety of mechanisms—e.g., Web-based computing, peer-to-peer computing, and grid computing—have been developed for such Internet-based computing (IC). Scheduling a computation for IC presents challenges that were not encountered with earlier modalities of parallel or distributed computing, especially when the computation's constituent tasks have interdependencies that constrain their order of execution. The process of scheduling such computations for IC is studied via a "pebble game” that abstracts the process of orchestrating the allocation of a computation's interdependent tasks to participating computers. A quality measure for plays of this game is developed that addresses the danger of "gridlock” in IC when a computation stalls because (due to dependencies) no tasks are eligible for execution. This measure rewards schedules that maximize the number of tasks that are eligible for execution at every step of the computation, one avenue for minimizing the likelihood of "gridlock.” The resulting formal setting is illustrated via the problem of scheduling computations whose intertask dependencies have the structure of "evolving” meshes of finite dimensionalities. Within an idealized setting, a simple scheduling strategy is shown to be optimal when the dependencies have the structure of a two-dimensional mesh and within a constant factor of optimal for meshes of higher dimensionalities. The strategy remains optimal for a generalization of two-dimensional meshes whose structures are determined by abelian monoids (a monoid-based version of Cayley graphs). The optimality results for the idealized setting provide scheduling guidelines for real settings.

[1] F.S. Annexstein, M. Baumslag, and A.L. Rosenberg, Group Action Graphs and Parallel Architectures SIAM J. Computing, vol. 19, pp. 544-569, 1990.
[2] B.W. Arden and K.W. Tang,“Representation and routing of Cayley graphs,” IEEE Trans. Comm., vol. 39, no. 11, pp. 1,533-1,537, Nov. 1991.
[3] M. Baumslag and A.L. Rosenberg, Processor-Time Tradeoffs for Cayley Graph Interconnection Networks Proc. Sixth Distributed Memory Computing Conf., pp. 630-636, 1991.
[4] A.R. Butt, S. Adabala, N.H. Kapadia, R. Figueiredo, and J.A.B. Fortes, “Fine-Grain Access Control for Securing Shared Resources in Computational Grids,” Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS '02), 2002.
[5] R. Buyya, D. Abramson, and J. Giddy, A Case for Economy Grid Architecture for Service Oriented Grid Computing Proc. 10th Heterogeneous Computing Workshop, 2001.
[6] H. Casanova, Distributed Computing Research Issues in Grid Computing, typescript, Univ. of California, San Diego, 2002.
[7] W. Cirne and K. Marzullo, The Computational Co-Op: Gathering Clusters into a Metacomputer Proc. 13th Int'l Parallel Processing Symp., pp. 160-166, 1999.
[8] S.A. Cook, An Observation on Time-Storage Tradeoff J. Computer and System Sciences, vol. 9, pp. 308-316, 1974.
[9] V.V. Dimakopoulos and N.J. Dimopoulos, Optimal Total Exchange in Cayley Graphs IEEE Trans. Parallel and Distributed Systems, vol. 12, pp. 1162-1168, 2001.
[10] I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure. San Francisco: Morgan-Kaufmann, 1999.
[11] I. Foster, C. Kesselman, and S. Tuecke, The Anatomy of the Grid: Enabling Scalable Virtual Organizations Int'l J. Supercomputer Applications, 2001.
[12] A. Gerasoulis and T. Yang, A Comparison of Clustering Heuristics for Scheduling Dags on Multiprocessors J. Parallel and Distributed Computing, vol. 16, pp. 276-291, 1992.
[13] L. He, Z. Han, H. Jin, L. Pan, and S. Li, DAG-Based Parallel Real Time Task Scheduling Algorithm on a Cluster Proc. Int'l Conf. Parallel and Distributed Processing Techniques and Applications (PDPTA '2000), pp. 437-443, 2000.
[14] J.-W. Hong and H.T. Kung, I/O Complexity: The Red-Blue Pebble Game Proc. 13th ACM Symp. Theory of Computing, pp. 326-333, 1981.
[15] J.E. Hopcroft, W. Paul, and L.G. Valiant, On Time versus Space J. ACM, vol. 24, pp. 332-337, 1977.
[16] The Intel Philanthropic Peer-to-Peer program www.intel.comcure, 2003.
[17] R.M. Karp, R.E. Miller, and S. Winograd, The Organization of Computations for Uniform Recurrence Equations J. ACM, vol. 4, pp. 563-590, 1967.
[18] R.M. Karp, A. Sahay, E. Santos, and K.E. Schauser, Optimal Broadcast and Summation in the logP Model Proc. Fifth ACM Symp. Parallel Algorithms and Architectures, pp. 142-153, 1993.
[19] D. Kondo, H. Casanova, E. Wing, and F. Berman, Models and Scheduling Guidelines for Global Computing Applications Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS '02), 2002.
[20] E. Korpela, D. Werthimer, D. Anderson, J. Cobb, and M. Lebofsky, SETI@home: Massively Distributed Computing for SETI Computing in Science and Eng., 2000.
[21] The Olson Laboratory Fight AIDS@Home Project, www.fight aidsathome.org, 2003.
[22] M.S. Paterson and C.E. Hewitt, Comparative Schematology Proc. Project MAC Conf. Concurrent Systems and Parallel Computation, pp. 119-127, 1970.
[23] N.J. Pippenger, Pebbling Proc. Fifth IBM Symp. Math. Foundations of Computer Science, 1980.
[24] A.L. Rosenberg, Data Graphs and Addressing Schemes J. Computing Systems Sciences, vol. 5, pp. 193-238, 1971.
[25] A.L. Rosenberg, Addressable Data Graphs J. ACM, vol. 19, pp. 309-340, 1972.
[26] A.L. Rosenberg, Accountable Web-Computing IEEE Trans. Parallel and Distributed Systems, vol. 14, pp. 97-106, 2003.
[27] A.L. Rosenberg, On Scheduling Collaborative Computations on the Internet: Mesh-Dags and Their Close Relatives Int'l Parallel and Distributed Processing Symp. (IPDPS '03), 2003.
[28] A.L. Rosenberg and I.H. Sudborough, Bandwidth and Pebbling Computing, vol. 31, pp. 115-139, 1983.
[29] A.L. Rosenberg and M. Yurkewych, Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing, submitted for publication, 2004.
[30] The RSA Factoring by Web Project, http://www.npac.syr.edufactoring(with foreword by A. Lenstra). Northeast Parallel Architecture Center, 2003.
[31] W. Shang and J.A.B. Fortes, "Time Optimal Linear Schedules for Algorithms with Uniform Dependencies," IEEE Trans. Computers, vol. 40, June 1991.
[32] X.-H. Sun and M. Wu, GHS: A Performance Prediction and Task Scheduling System for Grid Computing Proc. IEEE Int'l Parallel and Distributed Processing Symp., 2003.
[33] C. Weth, U. Kraus, J. Freuer, M. Ruder, R. Dannecker, P. Schneider, M. Konold, and H. Ruder, XPulsar@home-Schools Help Scientists, typescript, Univ. of Tübingen, 2000.
[34] S.W. White and D.C. Torney, Use of a Workstation Cluster for the Physical Mapping of Chromosomes SIAM NEWS, pp. 14-17, Mar. 1993.

Index Terms:
Internet-based computing, grid computing, P2P computing, Web computing, scheduling, mesh-structured computations, monoid dags, Cayley graphs.
Citation:
Arnold L. Rosenberg, "On Scheduling Mesh-Structured Computations for Internet-Based Computing," IEEE Transactions on Computers, vol. 53, no. 9, pp. 1176-1186, Sept. 2004, doi:10.1109/TC.2004.64
Usage of this product signifies your acceptance of the Terms of Use.