首页 | 本学科首页   官方微博 | 高级检索  
     


Scheduling online mixed-parallel workflows of rigid tasks in heterogeneous multi-cluster environments
Affiliation:1. Department of Computer Science, Instituto Tecnológico Autónomo de México, 1 Rio Hondo St., Progreso Tizapan, Mexico City, DF 01080, Mexico;2. School of Computing, The University of Kent, Chatham Maritime, Kent ME4 4AG, United Kingdom;1. Departamento de Computacion, CINVESTAV-IPN, Mexico City, Av. IPN. 2508, Col. Zacatenco, Ciudad de Mexico, 07360 Mexico;2. Microsoft, Redmond, Wa., Redmond, WA, USA;3. Department of Computer Science, George Mason University, FaixFax Virginia., Fairfax, Virginia, USA;4. Instituto Tecnologico de Mexicali, Mexico, Mexicali, Baja California, Mexico;1. Al-Hussein Bin Talal University, Ma’an, Jordan;2. Princess Sumaya University for Technology, Amman, Jordan;3. Macquarie University, Sydney, NSW, Australia;1. Distributed and Parallel Systems Group, Institute for Computer Science, University of Innsbruck, Technikerstr. 21a, A-6020 Innsbruck, Austria;2. Faculty of Computer Science and Engineering, Ss. Cyril and Methodius University in Skopje, 1000 Skopje, Macedonia;3. Institute of Information Technology, University of Klagenfurt, Universitätsstr. 65-67, 9020 Klagenfurt, Austria
Abstract:Workflow scheduling on parallel systems has long been known to be a NP-complete problem. As modern grid and cloud computing platforms emerge, it becomes indispensable to schedule mixed-parallel workflows in an online manner in a speed-heterogeneous multi-cluster environment. However, most existing scheduling algorithms were not developed for online mixed-parallel workflows of rigid data-parallel tasks and multi-cluster environments, therefore they cannot handle the problem efficiently. In this paper, we propose a scheduling framework, named Mixed-Parallel Online Workflow Scheduling (MOWS), which divides the entire scheduling process into four phases: task prioritizing, waiting queue scheduling, task rearrangement, and task allocation. Based on this framework, we developed four new methods: shortest-workflow-first, priority-based backfilling, preemptive task execution and All-EFT task allocation, for scheduling online mixed-parallel workflows of rigid tasks in speed-heterogeneous multi-cluster environments. To evaluate the proposed scheduling methods, we conducted a series of simulation studies and made comparisons with previously proposed approaches in the literature. The experimental results indicate that each of the four proposed methods outperforms existing approaches significantly and all these approaches in MOWS together can achieve more than 20% performance improvement in terms of average turnaround time.
Keywords:Workflow scheduling  Mixed-parallel applications  Heterogeneous multi-cluster environment
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号