Applying IC-scheduling theory to familiar classes of computations

Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM

Volumn , Issue , 2007, Pages

  Cordasco, Gennaro ^a   Malewicz, Grzegorz ^b   Rosenberg, Arnold L ^c  

^a UNIVERSITY OF SALERNO   (Italy)

^b GOOGLE INC   (United States)

^c The Manning College of Information and Computer Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; INTERNET; MATHEMATICAL MODELS; RESOURCE ALLOCATION;

ALGORITHMIC FRAMEWORK; COMPUTATIONAL PARADIGMS; IC-SCHEDULING THEORY; INTERNET-BASED COMPUTING (IC);

SCHEDULING;

EID: 34548758118     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2007.370673     Document Type: Conference Paper

References (21)

1. A. Avior, T Calamoneri, S. Even, A. Litman, A.L. Rosenberg (1998): A tight layout of the butterfly network. Theory of Computing Systs. 31, 475-487.
2. V.E. Beneš (1964): Optimal rearrangeable multistage connecting networks. Bell Syst. Tech. J. 43, 1641-1656.
3. G.E. Blelloch (1989): Scans as primitive parallel operations. IEEE Trans. Comput. 38, 1526-1538.
4. L.I. Bluestein (1970): A linear filtering approach to the computation of the Discrete Fourier Transform. IEEE Trans. Audio Electroacoustics, AU-18, 451-455.
5. R. Buyya, D. Abramson, J. Giddy (2001): A case for economy Grid architecture for service oriented Grid computing. 10th Heterogeneous Computing Wkshp.
6. Condor Project, University of Wisconsin. http://www.cs.wisc.edu/condor
7. G. Cordasco, G. Malewicz, A.L. Rosenberg (2007): Advances in IC-scheduling theory: scheduling expansive and reductive dags and scheduling dags via duality. IEEE Trans. Parallel and Distributed Systs., to appear.
8. G. Cordasco, G. Malewicz, A.L. Rosenberg (2006): Extending IC-Scheduling Theory via the Sweep Algorithm. Type-script, Univ. Massachusetts.
9. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein (1999): Introduction to Algorithms (2nd Ed.) MIT Press, Cambridge.
10. I. Foster and C. Kesselman [eds.] (2004): The Grid: Blueprint for a New Computing Infrastructure (2nd Edition). Morgan-Kaufmann, San Francisco.
11. I. Foster, C. Kesselman, S. Tuecke (2001): The anatomy of the Grid: enabling scalable virtual organizations. Intl. J. Supercomputer Applications.
12. R. Hall, A.L. Rosenberg, A. Venkataramani (2007): A comparison of dag-scheduling strategies for Internet-based computing. IEEE Intl. Parallel and Distributed Processing Symp.
13. D. Kondo, H. Casanova, E. Wing, F. Berman (2002): Models and scheduling mechanisms for global computing applications. Intl. Parallel and Distributed Processing Symp.
14. E. Korpela, D. Werthimer, D. Anderson, J. Cobb, M. Lebofsky (2000): SETI@home: massively distributed computing for SETI. In Computing in Science and Engineering (PF. Dubois, Ed.) IEEE Computer Soc. Press, Los Alamitos.
15. F.T. Leighton (1992): Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Francisco.
16. G. Malewicz, I. Foster, A.L. Rosenberg, M. Wilde (2007): A tool for prioritizing DAGMan jobs and its evaluation. J. Grid Computing, to appear.
17. G. Malewicz and A.L. Rosenberg (2005): On batchscheduling dags for Internet-based computing. Euro-Par 2005. In LNCS 3648, Springer-Verlag, Berlin, 262-271.
18. G. Malewicz, A.L. Rosenberg, M. Yurkewych (2006): Toward a theory for scheduling dags in Internet-based computing. IEEE Trans. Comput. 55, 757-768.
19. A.L. Rosenberg (2004): On scheduling mesh-structured computations for Internet-based computing. IEEE Trans. Comput. 53, 1176-1186.
20. A.L. Rosenberg and M. Yurkewych (2005): Guidelines for scheduling some common computation-dags for Internet-based computing. IEEE Trans. Comput. 54, 428-438.
21. X.-H. Sun and M. Wu (2003): GHS: A performance prediction and node scheduling system for Grid computing. IEEE Intl. Parallel and Distributed Processing Symp.