Genetic-Based Two Granularity Ordering Methods for Multiple Workflow Schedulingopen access
- Authors
- Li, Feng; Tan, Wen Jun; Seok, Moon Gi; Cai, Wentong
- Issue Date
- Jan-2024
- Publisher
- IEEE
- Keywords
- Task analysis; Costs; Scheduling; Resource management; Optimization; Clustering algorithms; Quality of service; Cloud computing; multi-workflow; multi-objective optimization; task ordering; cluster ordering
- Citation
- IEEE Access, v.12, pp 1747 - 1760
- Pages
- 14
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE Access
- Volume
- 12
- Start Page
- 1747
- End Page
- 1760
- URI
- https://scholarworks.dongguk.edu/handle/sw.dongguk/20830
- DOI
- 10.1109/ACCESS.2023.3337832
- ISSN
- 2169-3536
2169-3536
- Abstract
- In cloud computing, multiple workflow scheduling is important to optimize resource allocation and utilization for concurrent execution of diverse workflows across different applications. While previous research has focused on clustering-based resource allocation to reduce communication overheads by grouping tasks, it often overlooks the significance of task execution ordering, limiting overall performance optimization. To address this limitation, we propose two genetic-based approaches, considering task and cluster-level characteristics, to introduce novel ordering techniques for multi-workflow scheduling under cluster-based resource allocation. By comparing two granularity ordering methods, we offer valuable insights for efficient task management in multi-workflow environments. Our experiments demonstrate that the proposed approaches, especially the task granularity-based ordering method, outperform existing primary clustering methods, particularly for scenarios involving a large number of workflows or highly parallel workflows.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Advanced Convergence Engineering > Department of Computer Science and Artificial Intelligence > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.