Garbage Collector Scheduling in Dynamic, Multiprocessor Real-Time Systems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cho, Hyeonjoong | - |
dc.contributor.author | Ravindran, Binoy | - |
dc.contributor.author | Na, Chewoo | - |
dc.date.accessioned | 2021-09-08T16:35:50Z | - |
dc.date.available | 2021-09-08T16:35:50Z | - |
dc.date.created | 2021-06-10 | - |
dc.date.issued | 2009-06 | - |
dc.identifier.issn | 1045-9219 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/119953 | - |
dc.description.abstract | We consider garbage collection (GC) in dynamic, multiprocessor real-time systems. We consider the time-based, concurrent GC approach and focus on real-time scheduling to obtain mutator timing assurances, despite memory allocation and garbage collection. We present a scheduling algorithm called GCMUA. The algorithm considers mutator activities that are subject to time/utility function time constraints, stochastic execution-time and memory demands, and overloads. We establish that GCMUA probabilistically lower bounds each mutator activity's accrued utility, lower bounds the system-wide total accrued utility, and upper bounds the timing assurances' sensitivity to variations in mutator execution-time and memory demand estimates. Our simulation experiments validate our analytical results and confirm GCMUA's effectiveness. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.title | Garbage Collector Scheduling in Dynamic, Multiprocessor Real-Time Systems | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Cho, Hyeonjoong | - |
dc.identifier.doi | 10.1109/TPDS.2009.20 | - |
dc.identifier.scopusid | 2-s2.0-67349186254 | - |
dc.identifier.wosid | 000265412500008 | - |
dc.identifier.bibliographicCitation | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, v.20, no.6, pp.845 - 856 | - |
dc.relation.isPartOf | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | - |
dc.citation.title | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | - |
dc.citation.volume | 20 | - |
dc.citation.number | 6 | - |
dc.citation.startPage | 845 | - |
dc.citation.endPage | 856 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
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.keywordAuthor | Real time | - |
dc.subject.keywordAuthor | garbage collection | - |
dc.subject.keywordAuthor | time/utility functions | - |
dc.subject.keywordAuthor | scheduling | - |
dc.subject.keywordAuthor | multiprocessors | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea 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.