An Application-Level Scheduling with Task Bundling Approach for Many-Task Computing in Heterogeneous Environments

详细信息    查看全文

• 作者：Jian Xiao (20)
  Yu Zhang (20)
  Shuwei Chen (20)
  Huashan Yu (20)
  
• 关键词：application ; level scheduling ; many task computing ; task bundling ; traditional scheduling heuristics
• 刊名：Lecture Notes in Computer Science
• 出版年：2012
• 出版时间：2012
• 年：2012
• 卷：7513
• 期：1
• 页码：14-21
• 全文大小：295KB
• 参考文献：1. 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)
  2. 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)
  3. Isard, M., Prabhakaran, V., Currey, J., Wieder, U., Talwar, K., Goldberg, A.: Quincy: Fair Scheduling for distributed Computing Clusters. In: OSDI 2010 (2010)
  4. Kim, N., et al.: ECgene: Genome-based EST clustering and gene modeling foralternative splicing. Genome. Res.聽15, 566鈥?76 (2005) CrossRef
  5. 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)
  6. 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)
  7. Garey, M.R., Johnson, D.S.: 鈥楽trong鈥?NP-CompletenessResults: Motivation, Examples, and Implications. J. Association for Computing Machinery聽25(3), 499鈥?08 (1978) CrossRef
  8. 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鈥?37 (2001) CrossRef
  9. 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)
  10. 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
  11. Izakian, H., Ladani, B.T., Zamanifar, K., Abraham, A.: A Novel Particle Swarm Optimization Approach for Grid Job Scheduling. In: Proc. Third Int鈥檒 Conf. Information Systems, Technology and Management, vol.聽31, pp. 100鈥?09 (March 2009)
  12. 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鈥?08. ACM (2008)
  13. Raicu, I., et al.: Falkon: a Fast and Light-weight task execution framework. IEEE/ACM Super Computing (2007)
  14. 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)
  15. 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鈥?00 (2000)
  
• 作者单位：Jian Xiao (20)
  Yu Zhang (20)
  Shuwei Chen (20)
  Huashan Yu (20)
  
  20. School of Electronic Engineering and Computer Science, Peking University, Beijing, 100871, P.R. China
  
• ISSN：1611-3349

文摘

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.