Jaechun No
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jaechun No has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Sung-Soon Park
Anyang University and Gluesys Co. Ltd
4 shared publications Sung-Soon Park
Anyang University and Gluesys Co, Ltd
2 shared publications- Alok Choudhary
Northwestern University
1 shared publication - Cheol-Su Lim
Department of Computer Engineering, Seokyeong University, 16-1 Jungneung-Dong, Sungbuk-Gu, Seoul 136-704, Republic of Korea
1 shared publication Hyungjun Seo
Sejong University
1 shared publicationJaehwan Kim
Sejong University
1 shared publication
Latest Publications
- 1 August 2024
- Published by Springer Nature
- p. 132-141
vThrot: Fine-Grained, Virtual I/O Resource Redistribution Scheme
- 1 August 2024
- Published by Springer Nature
- p. 132-141
vThrot: Fine-Grained, Virtual I/O Resource Redistribution Scheme
- 2 July 2024
- Published by Springer Nature
- p. 3-16
e-CLAS: Effective GPUDirect I/O Classification Scheme
- 16 February 2024
- Published by Springer Nature
- p. 75-85
Effective Resource Provisioning Scheme for Kubernetes Infrastructure
- 16 February 2024
- Published by Springer Nature
- p. 75-85
Effective Resource Provisioning Scheme for Kubernetes Infrastructure
- 2 April 2023
- Published by Springer Nature
- p. 113-125
Rio_DSA: Redirecting I/O Scheme for Dynamic Storage Allocation on Docker Container
- 2 April 2023
- Published by Springer Nature
- p. 113-125
Rio_DSA: Redirecting I/O Scheme for Dynamic Storage Allocation on Docker Container
- 25 January 2023
- Published by Springer Nature
- p. 195-203
ml-SFP: System Failure Prediction Method Based on Machine Learning
- 25 January 2023
- Published by Springer Nature
- p. 195-203
ml-SFP: System Failure Prediction Method Based on Machine Learning
- 17 April 2021
- Published by Springer Nature
- p. 79-86
vRAS: An Efficient Virtualized Resource Allocation Scheme
- 17 April 2021
- Published by Springer Nature
- p. 79-86
vRAS: An Efficient Virtualized Resource Allocation Scheme
- 31 May 2017
- Published by Springer Nature in Cluster Computing
- Vol. 20 (3) , 2143-2155
I/O access frequency-aware cache method on KVM/QEMU
- 31 May 2017
- Published by Springer Nature in Cluster Computing
- Vol. 20 (3) , 2143-2155
I/O access frequency-aware cache method on KVM/QEMU
- Open Access
- 4 August 2016
- Published by Wiley in Scientific Programming
- Vol. 2016, 1-13
MultiCache: Multilayered Cache Implementation for I/O Virtualization
As the virtual machine technology is becoming the essential component in the cloud environment, VDI is receiving explosive attentions from IT market due to its advantages of easier software management, greater data protection, and lower expenses. However, I/O overhead is the critical obstacle to achieve high system performance in VDI. Reducing I/O overhead in the virtualization environment is not an easy task, because it requires scrutinizing multiple software layers of guest-to-hypervisor and also hypervisor-to-host. In this paper, we propose multilayered cache implementation, called MultiCache, which combines the guest-level I/O optimization with the hypervisor-level I/O optimization. The main objective of the guest-level optimization is to mitigate the I/O latency between the back end, shared storage, and the guest VM by utilizing history logs of I/O activities in VM. On the other hand, the hypervisor-level I/O optimization was implemented to minimize the latency caused by the “passing I/O path to the host” and the “contenting physical I/O device among VMs” on the same host server. We executed the performance measurement of MultiCache using the postmark benchmark to verify its effectiveness.
- 4 August 2016
- Published by Wiley in Scientific Programming
- Vol. 2016, 1-13
Open AccessMultiCache: Multilayered Cache Implementation for I/O Virtualization
As the virtual machine technology is becoming the essential component in the cloud environment, VDI is receiving explosive attentions from IT market due to its advantages of easier software management, greater data protection, and lower expenses. However, I/O overhead is the critical obstacle to achieve high system performance in VDI. Reducing I/O overhead in the virtualization environment is not an easy task, because it requires scrutinizing multiple software layers of guest-to-hypervisor and also hypervisor-to-host. In this paper, we propose multilayered cache implementation, called MultiCache, which combines the guest-level I/O optimization with the hypervisor-level I/O optimization. The main objective of the guest-level optimization is to mitigate the I/O latency between the back end, shared storage, and the guest VM by utilizing history logs of I/O activities in VM. On the other hand, the hypervisor-level I/O optimization was implemented to minimize the latency caused by the “passing I/O path to the host” and the “contenting physical I/O device among VMs” on the same host server. We executed the performance measurement of MultiCache using the postmark benchmark to verify its effectiveness.
- Open Access
- 3 April 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-9
ReHypar: A Recursive Hybrid Chunk Partitioning Method Using NAND-Flash Memory SSD
Due to the rapid development of flash memory, SSD is considered to be the replacement of HDD in the storage market. Although SSD retains several promising characteristics, such as high random I/O performance and nonvolatility, its high expense per capacity is the main obstacle in replacing HDD in all storage solutions. An alternative is to provide a hybrid structure where a small portion of SSD address space is combined with the much larger HDD address space. In such a structure, maximizing the space utilization of SSD in a cost-effective way is extremely important to generate high I/O performance. We developed ReHypar (recursive hybrid chunk partitioning) that enables improving the space utilization of SSD in the hybrid structure. The first objective of ReHypar is to mitigate the fragmentation overhead of SSD address space, by reusing the remaining free space of I/O units as much as possible. Furthermore, ReHypar allows defining several, logical data sections in SSD address space, with each of those sections being configured with the different I/O unit. We integrated ReHypar with ext2 and ext4 and evaluated it using two public benchmarks including IOzone and Postmark.
- 3 April 2014
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-9
Open AccessReHypar: A Recursive Hybrid Chunk Partitioning Method Using NAND-Flash Memory SSD
Due to the rapid development of flash memory, SSD is considered to be the replacement of HDD in the storage market. Although SSD retains several promising characteristics, such as high random I/O performance and nonvolatility, its high expense per capacity is the main obstacle in replacing HDD in all storage solutions. An alternative is to provide a hybrid structure where a small portion of SSD address space is combined with the much larger HDD address space. In such a structure, maximizing the space utilization of SSD in a cost-effective way is extremely important to generate high I/O performance. We developed ReHypar (recursive hybrid chunk partitioning) that enables improving the space utilization of SSD in the hybrid structure. The first objective of ReHypar is to mitigate the fragmentation overhead of SSD address space, by reusing the remaining free space of I/O units as much as possible. Furthermore, ReHypar allows defining several, logical data sections in SSD address space, with each of those sections being configured with the different I/O unit. We integrated ReHypar with ext2 and ext4 and evaluated it using two public benchmarks including IOzone and Postmark.