Hokyoon Lee
Korea University
8 Papers
25 Citations
Hokyoon Lee is an academic researcher from Korea University. The author has contributed to research in topics: Compiler & Hamming distance. The author has an hindex of 3, co-authored 8 publications. Previous affiliations of Hokyoon Lee include SK Hynix.
Chat about Author
Papers
Content-Aware Bit Shuffling for Maximizing PCM Endurance
TL;DR: This article proposes a noble content-aware bit shuffling (CABS) technique that minimizes bit flips and evenly distributes them to maximize the lifetime of PCM at the bit level and introduces two additional optimizations, namely, addition of an inversion bit and use of an XOR key, to further reduce bit flips.
15
Performance Comparison between LLVM and GCC Compilers for the AE32000 Embedded Processor
TL;DR: This study compared the performance of two major compilers, LLVM and GCC on a32-bit EISC embedded processor with the EEMBC benchmarks and found that LLVM generally performed better in the ALU intensive benchmarks, whereas GCC produced a better register allocation and jump optimization.
8
Lowering Minimum Supply Voltage for Power-Efficient Cache Design by Exploiting Data Redundancy
TL;DR: The VCCMIN of a 2MB L2 cache can be further lowered by 0.1V in 32nm technology with negligible degradation in performance and the scheme requires only minor modifications to the existing cache design.
5
Performance comparison of GCC and LLVM on the EISC processor
Chanhyun Park,Miseon Han,Hokyoon Lee,Seon Wook Kim +3 more
- 02 Oct 2014
TL;DR: This comparison shows that LLVM is good at optimizing calculation intensive benchmarks, and GCC performs register allocation and jump optimization better than LLVM in perspective of the code size and the dynamic instruction count for the EISC embedded processor.
5
Patent
Method for extending lifetime of resistive change memory and data storage system using the same
Kim Seon Wook,Miseon Han,Hokyoon Lee,Il Woo Park +3 more
- 03 Jul 2017
TL;DR: In this paper, a method for extending the lifetime of a resistive change memory includes generating data and hash candidates by shuffling bit positions of write data with the hash candidates in response to a write request for the resistive memory.
2