Scheduling of scientific workflows on data grids

Proceedings CCGRID 2008 - 8th IEEE International Symposium on Cluster Computing and the Grid

Volumn , Issue , 2008, Pages 548-553

  Pandey, Suraj ^a   Buyya, Rajkumar ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; MANAGEMENT; SCHEDULING ALGORITHMS; TECHNICAL PRESENTATIONS;

DATA GRIDS; WORKFLOW SCHEDULING;

GRID COMPUTING;

EID: 50649098318     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCGRID.2008.32     Document Type: Conference Paper

References (25)

1. E. Balas and M. W. Padberg. On the set-covering problem. Operations Research, 20(6), 1972.
2. W. H. Bell, D. G. Cameron, L. Capozza, A. P. Millar, K. Stockinger, and F. Zini. Simulation of dynamic grid replication strategies in optorsim. In GRID '02: Proceedings of the Third International Workshop on Grid Computing, UK, 2002. Springer-Verlag.
3. J. Cao. Enabling LIGO applications on scientific grids. OSG Consortium Meeting, 2005.
4. H. Casanova, D. Zagorodnov, F. Berman, and A. Legrand. Heuristics for scheduling parameter sweep applications in grid environments. In Proceedings of the 9th Heterogeneous Computing Workshop, USA, 2000. IEEE.
5. A. Chervenak, E. Deelman, I. Foster, and et al. Giggle: a framework for constructing scalable replica location services. In Proceedings of the 2002 ACM/IEEE conference on Supercomputing, USA, 2002. IEEE.
6. E. Deelman, J. Blythe, and et al. Mapping abstract complex workflows onto grid environments. Journal of Grid Computing, 1, 2003.
7. E. Deelman, J. Blythe, Y. Gil, and C. Kesselman. Grid resource management: state of the art and future trends, chapter Workflow management in GriPhyN. Kluwer Academic Publishers, USA, 2004.
8. P. C. Fishburn. Interval Orders and Interval Graphs-A Study of Partially Ordered Sets. John Wiley, USA, 1985.
9. S. Fitzgerald. Grid information services for distributed resource sharing. In HPDC '01: Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing, USA, 2001. IEEE.
10. T. C. Hu. Parallel sequencing and assembly line problems. Operations Research, 9(3), 1961.
11. Y.-K. Kwok and I. Ahmad. Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE Trans. Parallel Distrib. Syst., 7(5), 1996.
12. E. Mayr and H. Stadtherr. Optimal parallel algorithms for two processor scheduling with tree precedence constraints. Technical Report Feb1-1, 1996.
13. A. Rajasekar, M. Wan, and R. Moore. Mysrb & srb: Components of a data grid. In Proceedings of the 11 th IEEE International Symposium on High Performance Distributed Computing, UK, 2002.
14. A. Ramakrishnan, G. Singh, and et al. Scheduling dataintensive workflows onto storage-constrained distributed resources. In Proceedings of CCGRID, Washington, DC, USA, 2007. IEEE Computer Society.
15. K. Ranganathan and I. Foster. Decoupling computation and data scheduling in distributed data-intensive applications. In Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing, USA, 2002. IEEE.
16. K. Ranganathan and I. T. Foster. Identifying dynamic replication strategies for a high-performance data grid. In Proceedings of the Second International Workshop on Grid Computing, UK, 2001. Springer-Verlag.
17. S. Shankar and D. J. DeWitt. Data driven workflow planning in cluster management systems. In Proceedings of the 16th international symposium on High performance distributed computing, USA, 2007. ACM Press.
18. A. W. Toga and J. C. Mazziotta. Brain Mapping: The Methods(2nd Edition). Academic Press, 2002.
19. H. Topcuouglu, S. Hariri, and M. you Wu. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst., 13(3), 2002.
20. J. D. Ullman. Np-complete scheduling problems. J. Comput. Syst. Sci., 10(3), 1975.
21. S. Venugopal and R. Buyya. A set coverage-based mapping heuristic for scheduling distributed data-intensive applications on global grids. In Proceedings of the 7th IEEE/ACM International Conference on Grid Computing, 2006.
22. S. Venugopal, R. Buyya, and K. Ramamohanarao. A taxonomy of data grids for distributed data sharing, management, and processing. ACM Comput. Surv., 38(1), 2006.
23. J. Yu and R. Buyya. A taxonomy of scientific workflow systems for grid computing. SIGMOD Rec., 34(3), 2005.
24. J. Yu and R. Buyya. Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms. Scientific Programming Journal, 2006.
25. D. Zinn, T. H. Wong, and B. Ludaescher. Scheduling data-intensive workflows in kepler. Presentation, 2007.