Spidermine: Low Overhead User-Level Prefetching
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Won, Jiwoong | - |
dc.contributor.author | Ahn, Jemin | - |
dc.contributor.author | Yun, Sangwoon | - |
dc.contributor.author | Kim, Jongchan | - |
dc.contributor.author | Kang, Kyungtae | - |
dc.date.accessioned | 2024-05-02T03:00:28Z | - |
dc.date.available | 2024-05-02T03:00:28Z | - |
dc.date.issued | 2023-03 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/118940 | - |
dc.description.abstract | Spidermine monitors the rate at which read requests are issued by an application, and thus detects bursts of disk reads. It then determines an address at which to insert a breakpoint into the application code or a library before each burst, and logs each breakpoint, together with the data required for the subsequent burst. When the application is subsequently run, Spidermine inserts breakpoints at each logged address by temporarily replacing the instruction. Spidermine is then invoked at each breakpoint, and prefetches the corresponding data blocks into the page cache. This use of breakpoints as triggers for prefetching eliminates the need for monitoring to determine when to prefetch data during program execution. Also, by operating at the user level, Spidermine avoids interference with other applications. Experiments on 11 benchmark applications demonstrated that Spidermine can reduce the time for launch by up to 54.1%, and for run-time data-loading by up to 70.1% on a hard disk drive, 13.3% and 47.0% respectively, on a solid-disk drive. | - |
dc.format.extent | 10 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | ASSOC COMPUTING MACHINERY | - |
dc.title | Spidermine: Low Overhead User-Level Prefetching | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1145/3555776.3577754 | - |
dc.identifier.scopusid | 2-s2.0-85162892144 | - |
dc.identifier.wosid | 001124308100192 | - |
dc.identifier.bibliographicCitation | SAC '23: Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, pp 1332 - 1341 | - |
dc.citation.title | SAC '23: Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing | - |
dc.citation.startPage | 1332 | - |
dc.citation.endPage | 1341 | - |
dc.type.docType | Proceedings Paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordAuthor | Spidermine | - |
dc.subject.keywordAuthor | Prefetching | - |
dc.subject.keywordAuthor | I/O optimization | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/3555776.3577754 | - |
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.