Abstract
In this paper we study the problem of scheduling a collection of workflows, identical or not, on a SOA (Service Oriented Architecture) grid . A workflow (job) is represented by a directed acyclic graph (DAG) with typed tasks. All of the grid hosts are able to process a set of typed tasks with unrelated processing costs and are able to transmit files through communication links for which the communication times are not negligible. The goal of our study is to minimize the maximum completion time (makespan) of the workflows. To solve this problem we propose a genetic approach. The contributions of this paper are both the design of a Genetic Algorithm taking the communication costs into account and its performance analysis.
Keywords
- Genetic Algorithm
- Directed Acyclic Graph
- Communication Cost
- Communication Link
- Precedence Constraint
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download conference paper PDF
References
Beaumont, O., Legrand, A., Marchal, L., Robert, Y.: Assessing the impact and limits of steady-state scheduling for mixed task and data parallelism on heterogeneous platforms. In: HeteroPar 2004, pp. 296–302 (2004)
Caron, E., Desprez, F.: Diet: A scalable toolbox to build network enabled servers on the grid. IJHPCA 20(3), 335–352 (2006)
Casanova, H.: Modeling large-scale platforms for the analysis and the simulation of scheduling strategies. In: APDCM 2004 (2004)
Casanova, H., Legrand, A., Quinson, M.: Simgrid: A generic framework for large-scale distributed experiments. In: UKSIM 2008, pp. 126–131 (2008)
Daoud, M., Kharma, N.: GATS 1.0: A Novel GA-based Scheduling Algorithm for Task Scheduling on Heterogeneous Processor Nets. In: Genetic And Evolutionary Computation Conference (2005)
Diakité, S., Marchal, L., Nicod, J.-M., Philippe, L.: Steady-State for Batches of Identical Task Trees. In: Sips, H., Epema, D., Lin, H.-X. (eds.) Euro-Par 2009. LNCS, vol. 5704, pp. 203–215. Springer, Heidelberg (2009)
Diakité, S., Nicod, J.-M., Philippe, L.: Comparison of batch scheduling for identical multi-tasks jobs on heterogeneous platforms. In: PDP 2008, Toulouse, France, pp. 374–378 (2008)
Deelman, E., et al.: Pegasus: a framework for mapping complex scientific workflows onto distributed systems. Scientific Programming Journal 13, 219–237 (2005)
Braun, T.-D., et al.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. JPDC 61, 810–837 (2001)
Goh, C.K., Teoh, E.J., Tan, K.C.: A hybrid evolutionary approach for heterogeneous multiprocessor scheduling. Soft Comput. 13, 833–846 (2009)
Kwok, Y., Ahmad, I.: Dynamic critical-path scheduling: An effective technique for allocating task graphs to multi-processors. In: PDS, pp. 506 – 521 (1996)
Kwok, Y.-K., Ahmad, I.: Static Scheduling Algorithms for Allocating Task Graphs to Multiprocessors. ACM Computing Surveys 31(4), 406–471 (1999)
Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of scheduling under precedence constraints. Operations Research 26(1), 22–35 (1978)
Mandal, A., Kennedy, K., Koelbel, C., Marin, G., Mellor-Crummey, J., Liu, B., Johnsson, L.: Scheduling strategies for mapping application workflows onto the grid. In: HPDC 2005, NC, Triangle Park, USA, pp. 125–134 (July 2005)
Tanaka, Y., Takemiya, H., Nakada, H., Sekiguchi, S.: Design, implementation and performance evaluation of gridrpc programming middleware for a large-scale computational grid. In: GRID 2004, pp. 298–305 (2004)
Taylor, I.-J., Deelman, E., Gannon, D.-B., Shields, M.: Workflows for e-Science (2007)
Topcuouglu, H., Hariri, S., Wu, M.: Performance-effective and low-complexity task scheduling for heterogeneous computing. In: PDS, pp. 260–274 (2002)
Zhao, H., Sakellariou, R.: Scheduling multiple DAGs onto heterogeneous systems. In: HCW 2006, Rhodes, Greece (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nicod, JM., Philippe, L., Toch, L. (2012). A Genetic Algorithm with Communication Costs to Schedule Workflows on a SOA-Grid. In: Alexander, M., et al. Euro-Par 2011: Parallel Processing Workshops. Euro-Par 2011. Lecture Notes in Computer Science, vol 7155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29737-3_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-29737-3_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29736-6
Online ISBN: 978-3-642-29737-3
eBook Packages: Computer ScienceComputer Science (R0)
