Cited 1 time in
Genetic-Based Two Granularity Ordering Methods for Multiple Workflow Scheduling
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Li, Feng | - |
| dc.contributor.author | Tan, Wen Jun | - |
| dc.contributor.author | Seok, Moon Gi | - |
| dc.contributor.author | Cai, Wentong | - |
| dc.date.accessioned | 2024-08-08T09:00:51Z | - |
| dc.date.available | 2024-08-08T09:00:51Z | - |
| dc.date.issued | 2024-01 | - |
| dc.identifier.issn | 2169-3536 | - |
| dc.identifier.issn | 2169-3536 | - |
| dc.identifier.uri | https://scholarworks.dongguk.edu/handle/sw.dongguk/20830 | - |
| dc.description.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. | - |
| dc.format.extent | 14 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | IEEE | - |
| dc.title | Genetic-Based Two Granularity Ordering Methods for Multiple Workflow Scheduling | - |
| dc.type | Article | - |
| dc.publisher.location | 미국 | - |
| dc.identifier.doi | 10.1109/ACCESS.2023.3337832 | - |
| dc.identifier.scopusid | 2-s2.0-85182283789 | - |
| dc.identifier.wosid | 001137629600001 | - |
| dc.identifier.bibliographicCitation | IEEE Access, v.12, pp 1747 - 1760 | - |
| dc.citation.title | IEEE Access | - |
| dc.citation.volume | 12 | - |
| dc.citation.startPage | 1747 | - |
| dc.citation.endPage | 1760 | - |
| dc.type.docType | Article | - |
| dc.description.isOpenAccess | Y | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Computer Science | - |
| dc.relation.journalResearchArea | Engineering | - |
| dc.relation.journalResearchArea | Telecommunications | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
| dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
| dc.relation.journalWebOfScienceCategory | Telecommunications | - |
| dc.subject.keywordPlus | SCIENTIFIC WORKFLOWS | - |
| dc.subject.keywordPlus | ALGORITHM | - |
| dc.subject.keywordPlus | TASKS | - |
| dc.subject.keywordAuthor | Task analysis | - |
| dc.subject.keywordAuthor | Costs | - |
| dc.subject.keywordAuthor | Scheduling | - |
| dc.subject.keywordAuthor | Resource management | - |
| dc.subject.keywordAuthor | Optimization | - |
| dc.subject.keywordAuthor | Clustering algorithms | - |
| dc.subject.keywordAuthor | Quality of service | - |
| dc.subject.keywordAuthor | Cloud computing | - |
| dc.subject.keywordAuthor | multi-workflow | - |
| dc.subject.keywordAuthor | multi-objective optimization | - |
| dc.subject.keywordAuthor | task ordering | - |
| dc.subject.keywordAuthor | cluster ordering | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
30, Pildong-ro 1-gil, Jung-gu, Seoul, 04620, Republic of Korea+82-2-2260-3114
Copyright(c) 2023 DONGGUK UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
