Abstract
Scheduling workflow applications in grid environments is a great challenge, because it is an NP-complete problem. Many heuristic methods have been presented in the literature and most of them deal with a single workflow application at a time. In recent years, there are several heuristic methods proposed to deal with concurrent workflows or online workflows, but they do not work with workflows composed of data-parallel tasks. In this paper, we present an online scheduling approach for multiple mixed-parallel workflows in grid environments. The proposed approach was evaluated with a series of simulation experiments and the results show that the proposed approach delivers good performance and outperforms other methods under various workloads.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Miguel, L.B., Yannis, A.D., Eduardo, G.S.: Grid Characteristics and uses: a Grid Definition. In: Fernández Rivera, F., Bubak, M., Gómez Tato, A., Doallo, R. (eds.) Across Grids 2003. LNCS, vol. 2970, pp. 291–298. Springer, Heidelberg (2004)
Ullman, J.D.: NP-Complete Scheduling Problems. J. Computer and Systems Sciences 10, 384–393 (1975)
Wu, M., Gajski, D.: Hypertool: A Programming Aid for Message Passing Systems. IEEE Transactions on Parallel and Distributed Systems 1, 330–343 (1990)
Kwok, Y., Ahmad, I.: Dynamic Critical-Path Scheduling: An Effective Technique for Allocation Task Graphs to Multi-processors. IEEE Transactions on Parallel and Distributed Systems 7(5), 506–521 (1996)
Sih, G.C., Lee, E.A.: A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures. IEEE Transactions on Parallel and Distributed Systems 4(2), 175–186 (1993)
EI-Rewini, H., Lewis, T.G.: Scheduling Parallel Program Tasks onto Arbitrary Target Machines. J. Parallel and Distributed Computing 9, 138–153 (1990)
Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Transactions on Parallel and Distributed Systems 2(13), 260–247 (2002)
Yang, T., Gerasoulis, A.: DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. IEEE Transactions on Parallel and Distributed Systems 5(9), 951–967 (1994)
Park, G., Shirazi, B., Marquis, J.: DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multi-processor Systems. In: Proc. Int’l. Conf. Parallel Processing, pp. 157–166 (1997)
Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)
Ludtke, S., Baldwin, P., Chiu, W.: EMAN: Semiautomated Software for High Resolution Single-Particle Reconstructions. J. Struct. Biol. (128), 82–97 (1999)
Singh, G., Deelman, E., Berriman, G.B., et al.: Montage: a Grid Enabled Image Mosaic Service for the National Virtual Observatory. In: Astronomical Data Analysis Software and Systems (ADASS), vol. (13) (2003)
N’takpe’, T., Suter, F.: A Comparison of Scheduling Approaches for Mixed-Parallel Applications on Heterogeneous Platforms. In: 6th International Symposium on Parallel and Distributed Computing (IS-PDC), Hagenberg, Austria, July 2007, pp. 250–257 (2007)
Mandal, A., Kennedy, K., Koelbel, C., Marin, G., Mellor-Crummey, J., Liu, B., Johnsson, L.: Scheduling Strategies for Mapping Application workflows on to the Grid. In: 14thIEEE Symposium on High Performance Distributed Computing (HPDC 14), pp. 125–134 (2005)
N’takpe’, T., Suter, F.: Concurrent Scheduling of Parallel Task Graphs on Multi-Clusters Using Constrained Resource Allocations. Rapport de recherché n° 6774 (December 2008)
Mu’alem, A.W., Feitelson, D.G.: Utilization, Predictability, Workloads,and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling. IEEE Transactions onParalleland Distributed Systems 12(6) (June 2001)
Yu, Z., Shi, W.: A Planner-Guided Scheduling Strategy for Multiple Workflow Applications. In: On Parallel Processing Workshops, ICPP-W 2008, September 8-12 (2008)
Sakellariou, R., Zhao, H.: A hybrid heuristic for DAG scheduling on heterogeneous systems. In: 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), p. 111. IEEE Computer Society, Los Alamitos (2004)
Zhao, H., Sakellarious, R.: Scheduling Multiple DAGs onto Heterogeneous Systems. In: Proceedings ofthe 15th Heterogeneous Computing Workshop (HCW), Rhodes Island, Greece (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsu, CC., Huang, KC., Wang, FJ. (2010). Online Scheduling of Workflow Applications in Grid Environment. In: Bellavista, P., Chang, RS., Chao, HC., Lin, SF., Sloot, P.M.A. (eds) Advances in Grid and Pervasive Computing. GPC 2010. Lecture Notes in Computer Science, vol 6104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13067-0_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-13067-0_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13066-3
Online ISBN: 978-3-642-13067-0
eBook Packages: Computer ScienceComputer Science (R0)