Detailed Information

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

Avoiding Read Stalls on Flash Storage

Full metadata record
DC Field Value Language
dc.contributor.authorAn, Mijin-
dc.contributor.author송인영-
dc.contributor.authorSong, Yong Ho-
dc.contributor.authorLee, Sang-Won-
dc.date.accessioned2024-11-28T10:31:03Z-
dc.date.available2024-11-28T10:31:03Z-
dc.date.issued2022-06-
dc.identifier.issn0730-8078-
dc.identifier.urihttps://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/196122-
dc.description.abstractWhen a dirty victim page is selected for replacement upon page miss, the buffer manager has to first flush the dirty victim to the storage before reading the missing page. This conventional read-after-write (RAW) protocol, while working well on hard disks, causes the problem of read stall on flash storage with asymmetric read-write speed and parallelism; because of the resource conflict for a buffer frame between write and read operations, a page-missing process has to wait for the slow write to complete to secure a clean frame for the missing page. This strict write-then-read serialization under-utilizes CPU and storage, worsening transaction throughput and latency. To avoid the read stall problem on flash storage, this paper proposes write-after-read (WAR) protocol as a new I/O architecture between buffer manager and flash storage. In WAR, foreground processes make victim frames clean instantly by temporarily copying dirty pages at LRU tail into a separate DRAM space and read their missing pages into the cleaned frames with no stall. The dirty pages will be written to the storage asynchronously. By resolving resource conflict and thus avoiding read stalls, the database engine can issue more I/Os in parallel and better utilize CPU as well as storage, improving throughput and latency. We prototype WAR in two database storage engines, MySQL/InnoDB and Zero. Our comprehensive experimental results show that WAR improves transaction throughput by up to 2.9x compared to RAW.-
dc.format.extent14-
dc.language영어-
dc.language.isoENG-
dc.titleAvoiding Read Stalls on Flash Storage-
dc.typeArticle-
dc.identifier.doi10.1145/3514221.3526126-
dc.identifier.scopusid2-s2.0-85132733756-
dc.identifier.wosid000852705400102-
dc.identifier.bibliographicCitationProceedings of the ACM SIGMOD International Conference on Management of Data, pp 1404 - 1417-
dc.citation.titleProceedings of the ACM SIGMOD International Conference on Management of Data-
dc.citation.startPage1404-
dc.citation.endPage1417-
dc.type.docTypeProceedings Paper-
dc.description.isOpenAccessN-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaComputer Science-
dc.relation.journalWebOfScienceCategoryComputer Science, Information Systems-
dc.relation.journalWebOfScienceCategoryComputer Science, Theory & Methods-
dc.subject.keywordPlusDynamic random access storage-
dc.subject.keywordPlusEngines-
dc.subject.keywordPlusMemory architecture-
dc.subject.keywordPlusNetwork architecture-
dc.subject.keywordPlusVirtual storage-
dc.subject.keywordPlusManagers-
dc.subject.keywordPlusBuffer management-
dc.subject.keywordPlusBuffer manager-
dc.subject.keywordPlusFirst flush-
dc.subject.keywordPlusFlash storage-
dc.subject.keywordPlusInternal parallelism-
dc.subject.keywordPlusRead-after-write-
dc.subject.keywordPlusRead-write asymmetry-
dc.subject.keywordPlusResource conflict-
dc.subject.keywordPlusTransaction throughput-
dc.subject.keywordPlusWorking well-
dc.subject.keywordAuthorbuffer management-
dc.subject.keywordAuthorflash storage-
dc.subject.keywordAuthorinternal parallelism-
dc.subject.keywordAuthorread-write asymmetry-
dc.identifier.urlhttps://dl.acm.org/doi/10.1145/3514221.3526126-
Files in This Item
Go to Link
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