Using relative costs in workflow scheduling to cope with input data uncertainty

Proceedings of the 10th International Workshop on Middleware for Grids, Clouds and e-Science, MGC 2012 - Co-located with ACM/IFIP/USENIX 13th International Middleware Conference

Volumn , Issue , 2012, Pages

  Bittencourt, Luiz F ^a   Sakellariou, Rizos ^b   Madeira, Edmundo R M ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

scheduling; uncertainty; workflow

Indexed keywords

DEPENDENT TASKS; INPUT DATAS; UNCERTAINTY; WORK-FLOWS; WORKFLOW; WORKFLOW SCHEDULING;

COSTS; INPUT OUTPUT PROGRAMS; MIDDLEWARE;

SCHEDULING;

EID: 84871548054     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2405136.2405144     Document Type: Conference Paper

References (19)

1. G. Allen, D. Angulo, I. Foster, G. Lanfermann, C. Liu, T. Radke, E. Seidel, and J. Shalf. The cactus worm: Experiments with dynamic resource discovery and allocation in a grid environment. International Journal of High Performance Computing Applications, 15:2001, 2001.
2. 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. In Supercomputing '02: Proceedings of the 2002 ACM/IEEE Conference on Supercomputing, pp 1-14, Baltimore, USA, 2002. IEEE Computer Society Press.
3. M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia. A view of cloud computing. Communications of the ACM, 53:50-58, Apr. 2010.
4. D. M. Batista and N. L. S. da Fonseca. Robust scheduler for grid networks under uncertainties of both application demands and resource availability. Computer Networks, 55(1):3-19, 2011.
5. D. M. Batista, N. L. S. da Fonseca, F. K. Miyazawa, and F. Granelli. Self-adjustment of resource allocation for grid applications. Computer Networks, 52(9):1762-1781, June 2008.
6. L. F. Bittencourt and E. R. M. Madeira. A performance-oriented adaptive scheduler for dependent tasks on grids. Concurrency and Computation: Practice and Experience, 20(9):1029-1049, 2008.
7. H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman. Heuristics for scheduling parameter sweep applications in grid environments. In Heterogeneous Computing Workshop, 2000. (HCW 2000) Proceedings. 9th, pages 349-363, 2000.
8. E. Deelman, C. Kesselman, G. Mehta, L. Meshkat, L. Pearlman, K. Blackburn, P. Ehrens, A. Lazzarini, R. Williams, and S. Koranda. GriPhyN and LIGO, Building a Virtual Data Grid for Gravitational Wave Scientists. In HPDC '02: Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing, Edinburgh, UK, 2002. IEEE Computer Society.
9. E. Deelman, G. Singh, M.-H. Su, J. Blythe, Y. Gil, C. Kesselman, G. Mehta, K. Vahi, G. B. Berriman, J. Good, A. Laity, J. C. Jacob, and D. S. Katz. Pegasus: A framework for mapping complex scientific workflows onto distributed systems. Scientific Programming, 13(3):219-237, 2005.
10. F. Dong and S. G. Akl. Scheduling algorithms for grid computing: state of the art and open problems. Technical report, Queen's University School of Computing, Kingston, Canada, jan. 2006.
11. T. A. L. Genez, L. F. Bittencourt, and E. R. M. Madeira. Workflow Scheduling for SaaS / PaaS Cloud Providers Considering Two SLA Levels. In IEEE/IFIP Network Operations and Management Symposium (NOMS 2012), Maui, USA, 2012. IEEE.
12. M. Grajcar. Genetic list scheduling algorithm for scheduling and allocation on a loosely coupled heterogeneous multiprocessor system. In DAC '99: Proceedings of the 36th ACM/IEEE conference on Design automation, New York, USA, 1999. ACM Press.
13. J.Yu, R. Buyya, and K. Ramamohanarao. Workflow scheduling algorithms for grid computing. Studies in Computational Intelligence, 146:173-214, 2008.
14. G. Malewicz, A. L. Rosenberg, and M. Yurkewych. Toward a theory for scheduling DAGs in internet-based computing. IEEE Transactions on Computers, 55:757-768, 2006.
15. C. Phillips, C. Stein, and J. Wein. Task scheduling in networks. SIAM Journal on Discrete Mathematics, 10(4):573-598, 1997.
16. R. Sakellariou and H. Zhao. A low-cost rescheduling policy for efficient mapping of workflows on grid systems. Scientific Programming, 12(4):253-262, Dec. 2004.
17. I. J. Taylor, E. Deelman, D. B. Gannon, and M. Shields. Workflows for e-Science. Scientific Workflows for Grids. Springer, 2007.
18. H. Topcuoglu, S. Hariri, and M.-Y. Wu. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems, 13(3):260-274, 2002.
19. Y. Zhao, J. Dobson, I. Foster, L. Moreau, and M. Wilde. A notation and system for expressing and executing cleanly typed workflows on messy scientific data. SIGMOD Record, 34(3):37-43, 2005.