Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gyeongyeol Choi

dblp:200/5852 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 100%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › flash and SSD › flash memory
flash storage
0.722018
Bringing Order to Chaos: Barrier-Enabled I/O Stack for Flash Storage · ACM Trans. Storage 2018
Barrier-Enabled IO Stack for Flash Storage · FAST 2018
Storage systems › i/o architecture › i/o subsystem
i/o stack
0.722018
Bringing Order to Chaos: Barrier-Enabled I/O Stack for Flash Storage · ACM Trans. Storage 2018
Barrier-Enabled IO Stack for Flash Storage · FAST 2018
Storage systems
file systems
0.312018
Bringing Order to Chaos: Barrier-Enabled I/O Stack for Flash Storage · ACM Trans. Storage 2018
Storage systems › file systems
journaling file system
0.312018
Bringing Order to Chaos: Barrier-Enabled I/O Stack for Flash Storage · ACM Trans. Storage 2018
Operating systems › i/o › i/o subsystem
i/o scheduling
0.112018
Barrier-Enabled IO Stack for Flash Storage · FAST 2018

Methods — techniques the papers use, named apart from their topics

order-preserving dispatch · 0.3epoch-based i/o scheduling · 0.3dual-mode journaling · 0.3
YearPublicationVenuePosition
2018 Barrier-Enabled IO Stack for Flash Storage
Youjip Won, Jaemin Jung, Gyeongyeol Choi, Joontaek Oh, Seongbae Son, Joo Young Hwang, Sangyeun Cho
FAST3
2018 Bringing Order to Chaos: Barrier-Enabled I/O Stack for Flash Storage
abstract
This work is dedicated to eliminating the overhead required for guaranteeing the storage order in the modern IO stack. The existing block device adopts a prohibitively expensive approach in ensuring the storage order among write requests: interleaving the write requests with Transfer-and-Flush . For exploiting the cache barrier command for flash storage, we overhaul the IO scheduler, the dispatch module, and the filesystem so that these layers are orchestrated to preserve the ordering condition imposed by the application with which the associated data blocks are made durable. The key ingredients of Barrier-Enabled IO stack are Epoch-based IO scheduling , Order-Preserving Dispatch , and Dual-Mode Journaling . Barrier-enabled IO stack can control the storage order without Transfer-and-Flush overhead. We implement the barrier-enabled IO stack in server as well as in mobile platforms. SQLite performance increases by 270% and 75%, in server and in smartphone, respectively. In a server storage, BarrierFS brings as much as by 43 × and by 73× performance gain in MySQL and SQLite, respectively, against EXT4 via relaxing the durability of a transaction.
Youjip Won, Joontaek Oh, Jaemin Jung, Gyeongyeol Choi, Seongbae Son, Joo Young Hwang, Sangyeun Cho
ACM Trans. Storage4