On scheduling complex dags for internet-based computing

Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Volumn 2005, Issue , 2005, Pages 66-

  Malewicz, Grzegorz ^a   Rosenberg, Arnold L ^b   Yurkewych, Matthew ^b  

^a Department of Computer Science   (United States)

^b Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX DAGS; INTERNET-BASED COMPUTING; OPTIMIZATION PROBLEM;

ALGORITHMS; COMPUTATION THEORY; INTERNET; OPTIMAL CONTROL SYSTEMS; OPTIMIZATION;

LARGE SCALE SYSTEMS;

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

References (16)

1. R. Buyya, D. Abramson, J. Giddy (2001): A case for economy Grid architecture for service oriented Grid computing. 10th Heterogeneous Computing Wkshp.
2. W. Cirne and K. Marzullo (1999): The Computational CoOp: gathering clusters into a metacomputer. 13th Intl. Parallel Processing Symp., 160-166.
3. S.A. Cook (1974): An observation on time-storage tradeoff. J. Comp. Syst. Scis. 9, 308-316.
4. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein (2001): Introduction to Algorithms (2nd ed.). MIT Press, Cambridge, MA.
5. I. Foster and C. Kesselman [eds.] (2004): The Grid: Blueprint for a New Computing Infrastructure (2nd ed.). Morgan-Kaufmann, San Francisco, CA.
6. I. Foster, C. Kesselman, S. Tuecke (2001): The anatomy of the Grid: enabling scalable virtual organizations. Intl. J. Supercomputer Applications.
7. L. Gao and G. Malewicz (2004): Internet computing of tasks with dependencies using unreliable workers. 8th Intl. Conf. on Principles of Distributed Systems, 315-325.
8. H.T. Hsu (1975): An algorithm for finding a minimal equivalent graph of a digraph. J. ACM 22, 11-16.
9. D. Kondo, H. Casanova, E. Wing, F. Berman (2002): Models and scheduling guidelines for global computing applications. Intl. Parallel and Distr. Processing Symp.
10. E. Korpela, D. Werthimer, D. Anderson, J. Cobb, M. Lebofsky (2000): SETI@home: massively distributed computing for SETI. In Computing in Science and Engineering (P.P. Dubois, Ed.) IEEE Computer Soc. Press, Los Alamitos, CA.
11. G. Malewicz and A.L. Rosenberg (2004): On batchscheduling dags for Internet-based computing. Typescript, Univ. Massachusetts; submitted for publication.
12. M.S. Paterson, C.E. Hewitt (1970): Comparative schematology. Project MAC Conf. on Concurrent Systems and Parallel Computation, ACM Press, 119-127.
13. A.L. Rosenberg (2004): On scheduling mesh-structured computations for Internet-based computing. IEEE Trans. Comput. 53, 1176-1186.
14. A.L. Rosenberg and I.H. Sudborough (1983): Bandwidth and pebbling. Computing 31, 115-139.
15. A.L. Rosenberg and M. Yurkewych (2004): Guidelines for scheduling some common computation-dags for Internet-based computing. IEEE Trans. Comput., to appear. See also: 17th Intl. Conf. on Parallel and Distributed Computing Systems.
16. 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.