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

Tai Chang

dblp:47/9153 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-author · 2 since 2021

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
Memory systems · 53% Storage systems · 47%

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

TopicWeightPapersLastEvidence papers
Storage systems
flash and SSD
0.612022
EMT: Elegantly Measured Tanner for Key-Value Store on SSD · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Storage systems › flash and SSD › flash memory management
flash translation layer
0.612022
EMT: Elegantly Measured Tanner for Key-Value Store on SSD · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Storage systems › flash and SSD
SSD-based key-value store
0.612022
EMT: Elegantly Measured Tanner for Key-Value Store on SSD · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Memory systems
cache
0.512021
TSE: Two-Step Elimination for MLC STT-RAM Last-Level Cache · IEEE Trans. Computers 2021
Memory systems › memory hierarchy › cache hierarchy
last-level cache
0.512021
TSE: Two-Step Elimination for MLC STT-RAM Last-Level Cache · IEEE Trans. Computers 2021
Memory systems
non-volatile memory
0.512021
TSE: Two-Step Elimination for MLC STT-RAM Last-Level Cache · IEEE Trans. Computers 2021
Memory systems › non-volatile memory › magnetic random access memory
STT-MRAM
0.512021
TSE: Two-Step Elimination for MLC STT-RAM Last-Level Cache · IEEE Trans. Computers 2021
Storage systems › flash and SSD
read amplification
0.212022
EMT: Elegantly Measured Tanner for Key-Value Store on SSD · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022
Memory systems › non-volatile memory › multi-level cell
multi-level cell memory
0.112021
TSE: Two-Step Elimination for MLC STT-RAM Last-Level Cache · IEEE Trans. Computers 2021
YearPublicationVenuePosition
2022 EMT: Elegantly Measured Tanner for Key-Value Store on SSD
abstract
With the emergence of big data era, NoSQL key-value database is considered as a promising candidate for replacing relational database management system (RDBMS). As cost per GB of flash memory is getting closer to HDD, high performance solid state drive (SSD) is regarded as the best substitute of HDD. However, there are still some issues that need to be taken into consideration.et al.have reported that applying key-value store to SSD with conventional FTL would incur internal fragmentation and further cause the degradation of device lifespan. Although they proposed KVFTL to deal with the above issues, their work gave rise to the read amplification problem. In this article, we investigate the root cause of the read amplification problem and propose elegantly measured tanner FTL (EMT-FTL) to mitigate internal fragmentation and read amplification with acceptable memory overhead. Different from KVFTL that slices a variable-sized value into multiple partitions (up to 20) of different sizes and manages them as a linked chain, EMT-FTL slices a value into 16 KiB full partitions with its remaining bytes treated as a fragment partition and appended to the fragment buffer. For a 64 GiB SSD with 16 KiB pages, the overall memory usage of EMT-FTL is only 8.81% of KVFTL. The experiments showed that EMT-FTL achieved almost the optimal space utilization as KVFTL did under most of traces and averagely improved thegetperformance by 78.57% (compared with KVFTL) under the traces with request sizes ranging from 1 byte to 16 KiB.
Tai Chang, Jen-Wei Hsieh, Tai-Chieh Chang, Liang-Wei Lai
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
2021 TSE: Two-Step Elimination for MLC STT-RAM Last-Level Cache
abstract
Spin-transfer torque RAM (STT-RAM) is an emerging non-volatile memory that has been recognized as the potential candidate to replace SRAM. Compared with SRAM, STT-RAM has advantages of non-volatility, zero leakage power, and higher density. To further improve data density, multi-level cell (MLC) STT-RAM that can store two bits per cell has been proposed. However, writing hard bit of a cell would write its soft bit to the same value as well, which complicates the write operation of MLC STT-RAM. Although two-step transition (TT) is usually adopted to ensure the data correctness during a write operation, it incurs overhead of additional energy consumption and performance degradation. In this article, we propose the two-step elimination (TSE) scheme to eliminate TTs while ensure data integrity. By flipping hard bits of the cells that suffered from TTs, the TSE scheme could reduce TTs to soft transitions (STs) or zero transitions (ZTs), which incur much less overhead than TTs. To keep track of the flipped cells effectively, 6-bit TSE tag is introduced. We exploit tag reversing and advanced mode of the TSE scheme to further improve the performance. The experimental results showed that our scheme could reduce 61 percent TTs and achieve significant lifetime improvement, compared with conventional MLC STT-RAM (CMLC) scheme.
Jen-Wei Hsieh, Yi-Yu Liu, Hung-Tse Lee, Tai Chang
IEEE Trans. Computers4