Effective task mapping and scheduling techniques for heterogeneous multi-core systems based on zone refinement
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Jongdae | - |
dc.contributor.author | Lee, Sungchul | - |
dc.contributor.author | Shin, Hyunchul | - |
dc.contributor.author | Lee, Yongjoon | - |
dc.contributor.author | Bae, Hwangsik | - |
dc.date.accessioned | 2021-06-23T12:05:40Z | - |
dc.date.available | 2021-06-23T12:05:40Z | - |
dc.date.issued | 2011-00 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/39169 | - |
dc.description.abstract | To solve computationally expensive problems, multiple processor SoCs (MPSoCs) are frequently used. Mapping of applications to MPSoC architectures and scheduling of tasks are key problems in system level design of embedded systems. In this paper, iterative zone refinement algorithm is described, in which the tasks in the active zone is simultaneously mapped and scheduled for heterogeneous MPSoC architectures. The tradeoff between run-time and quality of solution is possible by adjusting the number of tasks in the zone. The experiments are processed by using both real applications and randomly generated task flow graphs. Experimental results show that our algorithm can obtain more effective solutions when compared to existing scheduling algorithms, such as Performance Effective Task Scheduling (PETS), Heterogeneous Earliest Finish Time (HEFT), and Critical-Path-On a Processor (CPOP). © 2011 AICIT. | - |
dc.format.extent | 4 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE | - |
dc.title | Effective task mapping and scheduling techniques for heterogeneous multi-core systems based on zone refinement | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.scopusid | 2-s2.0-84869464147 | - |
dc.identifier.wosid | 00309767600074 | - |
dc.identifier.bibliographicCitation | 2011 6th International Conference on Computer Sciences and Convergence Information Technology (ICCIT), pp 363 - 366 | - |
dc.citation.title | 2011 6th International Conference on Computer Sciences and Convergence Information Technology (ICCIT) | - |
dc.citation.startPage | 363 | - |
dc.citation.endPage | 366 | - |
dc.type.docType | Conference Paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | Active zone | - |
dc.subject.keywordPlus | Effective solution | - |
dc.subject.keywordPlus | Finish time | - |
dc.subject.keywordPlus | Heterogeneous multicore | - |
dc.subject.keywordPlus | Multiple processors | - |
dc.subject.keywordPlus | Quality of solution | - |
dc.subject.keywordPlus | Real applications | - |
dc.subject.keywordPlus | Refinement algorithms | - |
dc.subject.keywordPlus | Runtimes | - |
dc.subject.keywordPlus | Scheduling techniques | - |
dc.subject.keywordPlus | System level design | - |
dc.subject.keywordPlus | Task flow graph | - |
dc.subject.keywordPlus | Task mapping | - |
dc.subject.keywordPlus | Task-scheduling | - |
dc.subject.keywordPlus | Algorithms | - |
dc.subject.keywordPlus | Computer science | - |
dc.subject.keywordPlus | Embedded systems | - |
dc.subject.keywordPlus | Information technology | - |
dc.subject.keywordPlus | Iterative methods | - |
dc.subject.keywordPlus | Scheduling | - |
dc.subject.keywordPlus | Multiprocessing systems | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/6316638 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG 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.