
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych, "Toward a Theory for Scheduling Dags in InternetBased Computing," IEEE Transactions on Computers, vol. 55, no. 6, pp. 757768, June, 2006.  
BibTex  x  
@article{ 10.1109/TC.2006.91, author = {Grzegorz Malewicz and Arnold L. Rosenberg and Matthew Yurkewych}, title = {Toward a Theory for Scheduling Dags in InternetBased Computing}, journal ={IEEE Transactions on Computers}, volume = {55}, number = {6}, issn = {00189340}, year = {2006}, pages = {757768}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2006.91}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Toward a Theory for Scheduling Dags in InternetBased Computing IS  6 SN  00189340 SP757 EP768 EPD  757768 A1  Grzegorz Malewicz, A1  Arnold L. Rosenberg, A1  Matthew Yurkewych, PY  2006 KW  Internetbased computing KW  grid computing KW  global computing KW  Web computing KW  scheduling dags KW  dag decomposition KW  theory. VL  55 JA  IEEE Transactions on Computers ER   
[1] J. Annis, Y. Zhao, J. Voeckler, M. Wilde, S. Kent, and I. Foster, “Applying Chimera Virtual Data Concepts to Cluster Finding in the Sloan Sky Survey,” Proc. 15th Conf. High Performance Networking and Computing, p. 56, 2002.
[2] R. Buyya, D. Abramson, and J. Giddy, “A Case for Economy Grid Architecture for Service Oriented Grid Computing,” Proc. 10th Heterogeneous Computing Workshop, 2001.
[3] W. Cirne and K. Marzullo, “The Computational CoOp: Gathering Clusters into a Metacomputer,” Proc. 13th Int'l Parallel Processing Symp., pp. 160166, 1999.
[4] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. Cambridge, Mass.: MIT Press, 2001.
[5] The Grid: Blueprint for a New Computing Infrastructure, second ed., I. Foster and C. Kesselman, eds. San Francisco: Morgan Kaufmann, 2004.
[6] I. Foster, C. Kesselman, and S. Tuecke, “The Anatomy of the Grid: Enabling Scalable Virtual Organizations,” Int'l J. High Performance Computing Applications, vol. 15, pp. 200222, 2001.
[7] L. Gao and G. Malewicz, “Internet Computing of Tasks with Dependencies Using Unreliable Workers,” Thoery of Computing Systems, to appear.
[8] A. Gerasoulis and T. Yang, “A Comparison of Clustering Heuristics for Scheduling Dags on Multiprocessors,” J. Parallel and Distributed Computing, vol. 16, pp. 276291, 1992.
[9] L. He, Z. Han, H. Jin, L. Pan, and S. Li, “DAGBased Parallel Real Time Task Scheduling Algorithm on a Cluster,” Proc. Int'l Conf. Parallel and Distruted Processing Techniques and Applications, pp. 437443, 2000.
[10] H.T. Hsu, “An Algorithm for Finding a Minimal Equivalent Graph of a Digraph,” J. ACM, vol. 22, pp. 1116, 1975.
[11] D. Kondo, H. Casanova, E. Wing, and F. Berman, “Models and Scheduling Guidelines for Global Computing Applications,” Proc. Int'l Parallel and Distruted Processing Symp., p. 79, 2002.
[12] E. Korpela, D. Werthimer, D. Anderson, J. Cobb, and M. Lebofsky, “SETI@home: Massively Distributed Computing for SETI,” Computing in Science and Eng., P.F. Dubois, ed., Los Alamitos, Calif.: IEEE CS Press, 2000.
[13] G. Malewicz, “Parallel Scheduling of Complex Dags under Uncertainty,” Proc. 17th ACM Symp. Parallelism in Algorithms and Architectures, 2005.
[14] G. Malewicz and A.L. Rosenberg, “On BatchScheduling Dags for InternetBased Computing,” Proc. 11th European Conf. Parallel Processing, 2005.
[15] A.L. Rosenberg, “On Scheduling MeshStructured Computations for InternetBased Computing,” IEEE Trans. Computers, vol. 53, pp. 11761186, 2004.
[16] A.L. Rosenberg and I.H. Sudborough, “Bandwidth and Pebbling,” Computing, vol. 31, pp. 115139, 1983.
[17] A.L. Rosenberg and M. Yurkewych, “Guidelines for Scheduling Some Common ComputationDags for InternetBased Computing,” IEEE Trans. Computers, vol. 54, pp. 428438, 2005.
[18] X.H. Sun and M. Wu, “Grid Harvest Service: A System for LongTerm, ApplicationLevel Task Scheduling,” Proc. IEEE Int'l Parallel and Distributed Processing Symp., p. 25, 2003.
[19] D. Thain, T. Tannenbaum, and M. Livny, “Distributed Computing in Practice: The Condor Experience,” Concurrency and Computation: Practice and Experience, 2005.