Lock-Free Synchronization for Dynamic Embedded Real-Time Systems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cho, Hyeonjoong | - |
dc.contributor.author | Ravindran, Binoy | - |
dc.contributor.author | Jensen, E. Douglas | - |
dc.date.accessioned | 2021-09-08T05:15:33Z | - |
dc.date.available | 2021-09-08T05:15:33Z | - |
dc.date.created | 2021-06-11 | - |
dc.date.issued | 2010-02 | - |
dc.identifier.issn | 1539-9087 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/117023 | - |
dc.description.abstract | We consider lock-free synchronization for dynamic embedded real-time systems that are subject to resource overloads and arbitrary activity arrivals. We model activity arrival behaviors using the unimodal arbitrary arrival model (or UAM). UAM embodies a stronger "adversary" than most traditional arrival models. We derive an upper bound on lock-free retries under the UAM with utility accrual scheduling-the first such result. We establish the tradeoffs between lock-free and lock-based sharing under UAM. These include conditions under which activities' accrued timeliness utility is greater under lock-free than lock-based, and the consequent lower and upper bound on the total accrued utility that is possible with lock-free and lock-based sharing. We confirm our analytical results with a POSIX RTOS implementation. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ASSOC COMPUTING MACHINERY | - |
dc.title | Lock-Free Synchronization for Dynamic Embedded Real-Time Systems | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Cho, Hyeonjoong | - |
dc.identifier.doi | 10.1145/1698772.1698781 | - |
dc.identifier.scopusid | 2-s2.0-77949467234 | - |
dc.identifier.wosid | 000275540000009 | - |
dc.identifier.bibliographicCitation | ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, v.9, no.3 | - |
dc.relation.isPartOf | ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS | - |
dc.citation.title | ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS | - |
dc.citation.volume | 9 | - |
dc.citation.number | 3 | - |
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.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.subject.keywordAuthor | Experimentation | - |
dc.subject.keywordAuthor | Performance | - |
dc.subject.keywordAuthor | Theory | - |
dc.subject.keywordAuthor | Time/utility function | - |
dc.subject.keywordAuthor | utility accrual criteria | - |
dc.subject.keywordAuthor | real-time | - |
dc.subject.keywordAuthor | lock-free | - |
dc.subject.keywordAuthor | scheduling | - |
dc.subject.keywordAuthor | synchronization | - |
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.