
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Gennaro Cordasco, Grzegorz Malewicz, Arnold Rosenberg, "Advances in ICScheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 11, pp. 16071617, November, 2007.  
BibTex  x  
@article{ 10.1109/TPDS.2007.1067, author = {Gennaro Cordasco and Grzegorz Malewicz and Arnold Rosenberg}, title = {Advances in ICScheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {18}, number = {11}, issn = {10459219}, year = {2007}, pages = {16071617}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2007.1067}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Advances in ICScheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality IS  11 SN  10459219 SP1607 EP1617 EPD  16071617 A1  Gennaro Cordasco, A1  Grzegorz Malewicz, A1  Arnold Rosenberg, PY  2007 KW  ICScheduling theory KW  Internetbased computing KW  Grid computing KW  Global computing KW  Scheduling dags KW  Theory VL  18 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] R. Buyya, D. Abramson, and J. Giddy, “A Case for Economy Grid Architecture for ServiceOriented Grid Computing,” Proc. 10th Heterogeneous Computing Workshop (HCW '01), 2001.
[2] W. Cirne and K. Marzullo, “The Computational CoOp: Gathering Clusters into a Metacomputer,” Proc. 13th Int'l Parallel Processing Symp. (IPPS '99), pp. 160166, 1999.
[3] Condor Project, Univ. of Wisconsin, http://www.cs.wisc.educondor, 2007.
[4] G. Cordasco, G. Malewicz, and A.L. Rosenberg, “Extending ICScheduling Theory via the Sweep Algorithm,” Univ. of Massachusetts, 2007, submitted for publication.
[5] G. Cordasco, G. Malewicz, and A.L. Rosenberg, “Applying ICScheduling Theory to Some Familiar Computations,” Proc. Workshop LargeScale, Volatile Desktop Grids (PCGrid '07), 2007.
[6] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press, 1999.
[7] I. Foster and C. Kesselman, eds., The Grid: Blueprint for a New Computing Infrastructure, second ed. Morgan Kaufmann, 2004.
[8] I. Foster, C. Kesselman, and S. Tuecke, “The Anatomy of the Grid: Enabling Scalable Virtual Organizations,” Int'l J. Supercomputer Applications, 2001.
[9] L. Gao and G. Malewicz, “Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably,” Theory of Computing Systems, to appear, 2007.
[10] R. Hall, A.L. Rosenberg, and A. Venkataramani, “A Comparison of DagScheduling Strategies for InternetBased Computing,” Proc. 22nd Int'l Parallel and Distributed Processing Symp. (IPDPS), 2007.
[11] H.T. Hsu, “An Algorithm for Finding a Minimal Equivalent Graph of a Digraph,” J. ACM, vol. 22, pp. 1116, 1975.
[12] D. Kondo, H. Casanova, E. Wing, and F. Berman, “Models and Scheduling Mechanisms for Global Computing Applications,” Proc. 16th Int'l Parallel and Distributed Processing Symp. (IPDPS '02), 2002.
[13] E. Korpela, D. Werthimer, D. Anderson, J. Cobb, and M. Lebofsky, “SETI@home: Massively Distributed Computing for SETI,” P.F.Dubois, ed., Computing in Science and Eng., IEEE CS Press, 2000.
[14] G. Malewicz, I. Foster, A.L. Rosenberg, and M. Wilde, “A Tool for Prioritizing DAGMan Jobs and Its Evaluation,” J. Grid Computing, vol 5., no. 2, pp.197212, 2007.
[15] G. Malewicz and A.L. Rosenberg, “On BatchScheduling Dags for InternetBased Computing,” Proc. 11th EuroPar Conf. (EuroPar'05), pp. 262271, 2005.
[16] G. Malewicz, A.L. Rosenberg, and M. Yurkewych, “Toward a Theory for Scheduling Dags in InternetBased Computing,” IEEE Trans. Computing, vol. 55, pp. 757768, 2006.
[17] M. Mitchell, “Creating Minimal Vertex Series Parallel Graphs from Directed Acyclic Graphs,” Proc. Australasian Symp. Information Visualisation (InVis.au '04), pp. 133139, 2004.
[18] A.L. Rosenberg, “On Scheduling MeshStructured Computations for InternetBased Computing,” IEEE Trans. Computing, vol. 53, pp. 11761186, 2004.
[19] A.L. Rosenberg and M. Yurkewych, “Guidelines for Scheduling Some Common ComputationDags for InternetBased Computing,” IEEE Trans. Computing, vol. 54, pp. 428438, 2005.
[20] X.H. Sun and M. Wu, “GHS: A Performance Prediction and Node Scheduling System for Grid Computing,” Proc. 17th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '03), 2003.