Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

Efficient Stack Distance Approximation Based on Workload Characteristics

Full metadata record
DC FieldValueLanguage
dc.contributor.authorLim Sooyoung-
dc.contributor.authorPark Dongchul-
dc.date.accessioned2022-07-13T06:40:17Z-
dc.date.available2022-07-13T06:40:17Z-
dc.date.issued2022-06-
dc.identifier.issn2169-3536-
dc.identifier.urihttps://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/151395-
dc.description.abstractA stack distance of a reference is the depth from which the reference must be extracted from a stack. It has been widely applied to a variety of applications utilizing temporal locality information. However, calculating an exact stack distance requires significant computational complexity that is impractical for online production systems. This paper proposes an efficient algorithm that approximates a stack distance based on workload characteristics. The proposed algorithm utilizes two simple reference metrics: interreference distance and a quasi-unique reference count. More importantly, its approximation algorithm requires surprisingly simple calculation. Consequently, it significantly reduces computational overhead while exhibiting exceptional accuracy and runs extremely fast. Moreover, it allows configurable parameters for performance optimization by making optimal use of workload characteristics. Our extensive experiments with diverse realistic workloads demonstrate our stack distance approximation algorithm outperforms the current state-of-the-art algorithm with higher accuracy (3.7 x), lower memory footprint (3.05 x) and fast execution (less than 0.05 seconds) on average. In addition, with configuration parameters, our refined algorithm can achieve a 28% average additional accuracy improvement.-
dc.format.extent14-
dc.language영어-
dc.language.isoENG-
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC-
dc.titleEfficient Stack Distance Approximation Based on Workload Characteristics-
dc.typeArticle-
dc.publisher.locationUnited States-
dc.identifier.doi10.1109/ACCESS.2022.3180327-
dc.identifier.scopusid2-s2.0-85131711870-
dc.identifier.wosid000809381500001-
dc.identifier.bibliographicCitationIEEE ACCESS, v.10, pp 59792 - 59805-
dc.citation.titleIEEE ACCESS-
dc.citation.volume10-
dc.citation.startPage59792-
dc.citation.endPage59805-
dc.description.isOpenAccessN-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaComputer Science-
dc.relation.journalResearchAreaEngineering-
dc.relation.journalResearchAreaTelecommunications-
dc.relation.journalWebOfScienceCategoryComputer Science, Information Systems-
dc.relation.journalWebOfScienceCategoryEngineering, Electrical & Electronic-
dc.relation.journalWebOfScienceCategoryTelecommunications-
dc.subject.keywordAuthorStack distance-
dc.subject.keywordAuthorreuse distance-
dc.subject.keywordAuthorcache-
dc.subject.keywordAuthorinter reference distance-
dc.subject.keywordAuthorMRC-
dc.subject.keywordAuthormiss ratio curve-
Files in This Item
There are no files associated with this item.
Appears in
Collections
공과대학 > 소프트웨어학부 > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetrics

Total Views & Downloads

BROWSE