Abstract
Many-Task Computing (MTC) is a widely used computing paradigm for large-scale task-parallel processing. One of the key issues in MTC is to schedule a large number of independent tasks onto heterogeneous resources. Traditional task-level scheduling heuristics, like Min-Min, Sufferage and MaxStd, cannot readily be applied in this scenario. As most of MTC tasks are usually fine-grained, the resource management overhead would be prominent and the multi-core nodes might become hard to be fully utilized. In this paper we propose an application-level scheduling with task bundling approach that utilizes the knowledge of both applications and tasks to overcome these difficulties. Furthermore we adapt the traditional task-level heuristics to our model for MTC scheduling. Experimental results show that these application-level scheduling approaches, when equipped with task bundling, can deliver good performance for Many-Task Computing in terms of both Makespan and Flowtime.
Chapter PDF
Similar content being viewed by others
Keywords
References
Raicu, I., Zhang, Z., Wilde, M., Foster, I.T., Beckman, P.H., Iskra, K., Clifford, B.: Toward Loosely Coupled Programming on Petascale Systems. IEEE/ACM Super Computing (2008)
Raicu, I., Foster, I., Zhao, Y.: Many-Task Computing for Grids and Supercomputers. In: IEEE Workshop on Many-Task Computing on Grids and Supercomputers, MTAGS 2008 (2008)
Isard, M., Prabhakaran, V., Currey, J., Wieder, U., Talwar, K., Goldberg, A.: Quincy: Fair Scheduling for distributed Computing Clusters. In: OSDI 2010 (2010)
Kim, N., et al.: ECgene: Genome-based EST clustering and gene modeling foralternative splicing. Genome. Res. 15, 566–576 (2005)
Yu, H., Li, Y., Wu, X., Xiao, J., Li, X.: A Self-Optimizing Computation Partitioning Algorithm for Distributed Many-task Computing. In: China Grid 2010 (2010)
Xu, J., Lam, A.Y.S., Li, V.O.K.: Chemical reaction optimization for task scheduling in grid computing. IEEE Trans. Parallel Distrib. Systems (2011)
Garey, M.R., Johnson, D.S.: ‘Strong’ NP-CompletenessResults: Motivation, Examples, and Implications. J. Association for Computing Machinery 25(3), 499–508 (1978)
Braun, T.D., Hensgen, D., Freund, R.F., Siegel, H.J., Beck, N., Boloni, L.L., Maheswaran, M., Reuther, A.I., Robertson, J.P., Theys, M.D., Yao, B.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J. Parallel and Distributed Comput. 61(6), 810–837 (2001)
Maheswaran, M., Ali, S., Siegel, H.J., Hensgen, D., Freund, R.F.: Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems. In: Proceedings of the Eighth Heterogeneous Computing Workshop (1999)
Munir, E.U., Li, J.-Z., Shi, S.-F., Zou, Z., Yang, D.: MaxStd: A Task Scheduling Heuristic for Heterogeneous Computing Environment. Information Technology Journal, ISSN-1812-5638
Izakian, H., Ladani, B.T., Zamanifar, K., Abraham, A.: A Novel Particle Swarm Optimization Approach for Grid Job Scheduling. In: Proc. Third Int’l Conf. Information Systems, Technology and Management, vol. 31, pp. 100–109 (March 2009)
Iosup, A., Sonmez, O.O., Anoep, S., Epema, D.H.J.: The performance of bags-of-tasks in large-scale distributed systems. In: International Symposium on High-Performance Distributed Computing (HPDC), pp. 97–108. ACM (2008)
Raicu, I., et al.: Falkon: a Fast and Light-weight task execution framework. IEEE/ACM Super Computing (2007)
Li, Y., Wu, X., Xiao, J., Zhang, Y., Yu, H.: A Scheduling Algorithm Based on Task Complexity Estimating for Many-Task Computing. In: SKG 2010 (2010)
Ali, S., Siegel, H.J., Maheswaran, M., Ali, S., Hensgen, D.: Task execution time modeling for heterogeneous computing systems. In: Proceedings of the Ninth Heterogeneous Computing Workshop, pp. 185–200 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Xiao, J., Zhang, Y., Chen, S., Yu, H. (2012). An Application-Level Scheduling with Task Bundling Approach for Many-Task Computing in Heterogeneous Environments. In: Park, J.J., Zomaya, A., Yeo, SS., Sahni, S. (eds) Network and Parallel Computing. NPC 2012. Lecture Notes in Computer Science, vol 7513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35606-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-35606-3_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35605-6
Online ISBN: 978-3-642-35606-3
eBook Packages: Computer ScienceComputer Science (R0)