DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jung, KJ | - |
dc.contributor.author | Park, C | - |
dc.date.accessioned | 2016-04-01T02:01:30Z | - |
dc.date.available | 2016-04-01T02:01:30Z | - |
dc.date.created | 2009-02-28 | - |
dc.date.issued | 2005-01 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.other | 2006-OAK-0000005614 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/24242 | - |
dc.description.abstract | Partitioning and global scheduling are two approaches for scheduling real-time tasks in multiprocessor environments. Partitioning is the more favored approach, although it is sub-optimal. This is mainly due to the fact that popular uniprocessor real-time scheduling algorithms, such as EDF and RM, can be applied to the partitioning approach with low scheduling overhead. In recent years, much research has been done on global real-time multiprocessor scheduling algorithms based on the concept of "proportionate fairness". Proportionate fair (Pfair) scheduling [5][6] is the only known optimal algorithm for scheduling real-time tasks on multiprocessor. However, frequent preemptions caused by the small quantum length for providing optimal scheduling in the Pfair scheduling make it impractical. Deadline Fair Scheduling (DFS) [1] based on Pfair scheduling tried to reduce preempt ion-related overhead by means of extending quantum length and sharing a quantum among tasks. But extending quantum length causes a mis-estimation problem for eligibility of tasks and a non-work-conserving problem. In this paper, we propose the Enhanced Deadline Fair Scheduling (EDFS) algorithm to reduce preemption-related overhead. We show that E-DFS allows us to decrease quantum length by reducing overhead and save wasted CPU time that is caused by preemption-related overhead and miss-estimation of eligibility. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.relation.isPartOf | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.title | A technique to reduce preemption overhead in real-time multiprocessor task scheduling | - |
dc.type | Article | - |
dc.contributor.college | 컴퓨터공학과 | - |
dc.identifier.doi | 10.1007/11572961_46 | - |
dc.author.google | Jung, KJ | - |
dc.author.google | Park, C | - |
dc.relation.volume | 3740 | - |
dc.relation.startpage | 566 | - |
dc.relation.lastpage | 579 | - |
dc.contributor.id | 10054851 | - |
dc.relation.journal | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCIE | - |
dc.collections.name | Conference Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | LECTURE NOTES IN COMPUTER SCIENCE, v.3740, pp.566 - 579 | - |
dc.identifier.wosid | 000234508800046 | - |
dc.date.tcdate | 2018-03-23 | - |
dc.citation.endPage | 579 | - |
dc.citation.startPage | 566 | - |
dc.citation.title | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.citation.volume | 3740 | - |
dc.contributor.affiliatedAuthor | Park, C | - |
dc.identifier.scopusid | 2-s2.0-33646530258 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.