Abstract
Many large-scale scientific applications are usually constructed as workflows due to large amounts of interrelated computation and communication. Workflow scheduling has long been a research topic in parallel and distributed computing. However, most previous research focuses on single workflow scheduling. As cloud computing emerges, users can now have easy access to on-demand high performance computing resources, usually called HPC cloud. Since HPC cloud has to serve many users simultaneously, it is common that many workflows submitted from different users are running concurrently. Therefore, how to schedule concurrent workflows efficiently becomes an important issue in HPC cloud environments. Due to the dependency and communication costs between tasks in a workflow, there usually are gaps formed in the schedule of a workflow. In this paper, we propose a method which exploits such schedule gaps to efficiently schedule concurrent workflows in HPC cloud. The proposed scheduling method was evaluated with a series of simulation experiments and compared to the existing method in the literature. The results indicate that our method can deliver good performance and outperform the existing method significantly in terms of average makespan, up to 18% performance improvement.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bittencourt, L.F., Madeira, E.R.M.: Towards the Scheduling of Multiple Workflows on Computational Grids. Journal of Grid Computing 8, 419–441 (2009)
Kwok, Y.K., Ahmad, I.: Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys 31(4), 406–471 (1999)
Adam, T.L., Chandy, K.M., Dickson, J.R.: A Comparison of List Schedules for Parallel Processing Systems. Communications of the ACM 17(12), 685–690 (1974)
Bittencourt, L.F., Madeira, E.R.M.: Fulfilling Task Dependence Gaps for Workflow Scheduling on Grids. In: 3rd IEEE International Conference on Signal-Image Technology and Internet Based Systems, pp. 468–475 (2007)
Stavrinides, G.L., Karatza, H.D.: Scheduling Multiple Task Graphs in Heterogeneous Distributed Real-Time Systems by Exploiting Schedule Holes with Bin Packing Techniques. Simulation Modelling Practice and Theory, vol 19(1), 540–552 (2011)
Bittencourt, L.F., Sakellariou, R., Madeira, E.R.M.: DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm. In: 18th ‘Conference on Parallel, Distributed and Network-based Processing, pp. 27–34 (2010)
Wieczorek, M., Prodan, R., Hoheisel, A.: Taxonomies of the Multi-Criteria Grid Workflow Scheduling Problem. In: Grid Middleware and Services, pp. 237–264 (2008)
Rahman, M., Ranjan, R., Buyya, R.: Cooperative and Decentralized Workflow Scheduling in Global Grids. Future Generation Computer Systems 26, 753–768 (2010)
Ding, F., Zhang, R., Ruan, K., Lin, J., Zhao, Z.: A QoS-based Scheduling Approach for Complex Workflow Applications. In: 5th Annual ChinaGrid Conference, pp. 67–73 (2010)
Bittencourt, L.F., Madeira, E.R.M.: A Performance-Oriented Adaptive Scheduler for Dependent Tasks on Grids. Concurrency and Computation: Practice and Experience 20, 1029–1049 (2008)
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)
Ullman, J.D.: NP-Complete Scheduling Problems. Journal of Computer and Systems Sciences 10, 384–393 (1975)
Zhao, H., Sakellarious, R.: Scheduling Multiple DAGs onto Heterogeneous Systems. In: 15th Heterogeneous Computing Workshop, 14 pp (2006)
Yu, Z., Shi, W.: A Planner-Guided Scheduling Strategy for Multiple Workflow Applications. In: 37th International Conference on Parallel Processing Workshops, pp. 8–12 (2008)
N’takpé, T., Suter, F.: Concurrent Scheduling of Parallel Task Graphs on Multi-Clusters Using Constrained Resource Allocations. In: IEEE International Symposium on Parallel and Distributed Processing, pp. 1–8 (2009)
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. Journal of Parallel and Distributed Computing 9, 138–153 (1990)
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: International Conference on Parallel Processing, pp. 157–166 (1997)
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: 14th IEEE Symposium on High Performance Distributed Computing, pp. 125–134 (2005)
Braun, T.D., Siegel, H.J., Beck, N., Bölöni, L.L., Maheswaran, M., Reuther, A.I., Robertson, J.P., Theys, M.D., Yao, B., Hensgen, D., Freund, R.F.: A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems. Journal of Parallel and Distributed Computing 61(6), 810–837 (2001)
Hofmann, P., Woods, D.: Cloud Computing: The Limits of Public Clouds for Business Applications. IEEE Internet Computing, 90–93 (November 2010)
Wei, Y., Blake, M.B.: Service-Oriented Computing and Cloud Computing: Challenges and Opportunities. IEEE Internet Computing, 72–75 (November 2010)
Armbrust, M., Fox, A., Griffith, R., Joseph, A.D., Katz, R.H., Konwinski, A., Lee, G., Patterson, D.A., Rabkin, A., Stoica, I., Zaharia, M.: Above the Clouds: A Berkeley View of Cloud Computing. Technical report no. UCB/EECS-2009-28, EECS Department, University of California, Berkeley (2009)
salesforce.com, http://www.salesforce.com
Gmail, http://gamil.com
Google App Engine, http://code.google.com/intl/en/appengine
Microsoft Azure Platform, http://www.microsoft.com/windowsazure/
Amazon Elastic Compute Cloud, http://aws.amazon.com/ec2/
Akioka, S., Muraoka, Y.: HPC Benchmarks on Amazon EC2. In: 24th IEEE International Conference on Advanced Information Networking and Applications Workshops, pp. 1029–1034 (2010)
Kim, H.: el-Khamra, Y., Jha, S., Parashar, M.: An Autonomic Approach to Integrated HPC Grid and Cloud Usage. In: 5th IEEE International Conference on e-Science, pp. 366–373 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, HJ., Huang, KC., Chang, HY., Gu, DS., Shih, PJ. (2011). Scheduling Concurrent Workflows in HPC Cloud through Exploiting Schedule Gaps. In: Xiang, Y., Cuzzocrea, A., Hobbs, M., Zhou, W. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2011. Lecture Notes in Computer Science, vol 7016. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24650-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-24650-0_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24649-4
Online ISBN: 978-3-642-24650-0
eBook Packages: Computer ScienceComputer Science (R0)