Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Jungkeol Lee"'
Publikováno v:
IEEE Access, Vol 9, Pp 8006-8027 (2021)
Recently, semantic segmentation based on deep neural network (DNN) has attracted attention as it exhibits high accuracy, and many studies have been conducted on this. However, DNN-based segmentation studies focused mainly on improving accuracy, thus
Externí odkaz:
https://doaj.org/article/657e54d0da364efc88bc3f780bb64691
Publikováno v:
IEEE Access, Vol 9, Pp 157681-157698 (2021)
The number of applications that can access a storage device simultaneously has increased as a result of the increase in storage capacity and the emergence of hyperscale environments. In multi-application environments, the request for append-only data
Externí odkaz:
https://doaj.org/article/48fd35f571e54e23abbc7d4939040a40
Autor:
Youngil Kim, Seungdo Choi, Daeyong Lee, Joonyong Jeong, Jaewook Kwak, Jungkeol Lee, Gyeongyong Lee, Sangjin Lee, Kibin Park, Jinwoo Jeong, Wang Kexin, Yong Ho Song
Publikováno v:
IEEE Access, Vol 8, Pp 37105-37123 (2020)
As big data has evolved over the past few years, a lack of storage space and I/O bandwidth has become one of the most important challenges to overcome. To mitigate these problems, data compression schemes reduce the amount of data to be stored and tr
Externí odkaz:
https://doaj.org/article/d42a88efe21148a486b466b6ff2e4198
Autor:
Jaewook Kwak, Jungkeol Lee, Daeyong Lee, Joonyong Jeong, Gyeongyong Lee, Jungwook Choi, Yong Ho Song
Publikováno v:
IEEE Access, Vol 8, Pp 185360-185372 (2020)
Many flash storage systems divide input/output (I/O) requests that require large amounts of data into sub-requests to exploit their internal parallelism. In this case, an I/O request can be completed only after all sub-requests have been completed. T
Externí odkaz:
https://doaj.org/article/564700dcc878486fb0e6a6dc2e47eee1
Autor:
Joonyong Jeong, Jaewook Kwak, Daeyong Lee, Seungdo Choi, Jungkeol Lee, Jungwook Choi, Yong Ho Song
Publikováno v:
IEEE Access, Vol 8, Pp 188256-188268 (2020)
A log-structured merge-tree-based key value store (LSMKV) is an append-only database for storing and retrieving unstructured data, especially in a write-intensive environment. This database uses hierarchical components to store and manage data. Upper
Externí odkaz:
https://doaj.org/article/f61f04c4d01142b7b67da786132fc2ce
Publikováno v:
IEEE Access, Vol 9, Pp 157681-157698 (2021)
The number of applications that can access a storage device simultaneously has increased as a result of the increase in storage capacity and the emergence of hyperscale environments. In multi-application environments, the request for append-only data
Autor:
Seungdo Choi, Jungwook Choi, Jaewook Kwak, Jungkeol Lee, Daeyong Lee, Joonyong Jeong, Yong Ho Song
Publikováno v:
IEEE Access, Vol 8, Pp 188256-188268 (2020)
A log-structured merge-tree-based key value store (LSMKV) is an append-only database for storing and retrieving unstructured data, especially in a write-intensive environment. This database uses hierarchical components to store and manage data. Upper
Autor:
Gyeongyong Lee, Joonyong Jeong, Jungkeol Lee, Jungwook Choi, Jaewook Kwak, Yong Ho Song, Daeyong Lee
Publikováno v:
IEEE Access, Vol 8, Pp 185360-185372 (2020)
Many flash storage systems divide input/output (I/O) requests that require large amounts of data into sub-requests to exploit their internal parallelism. In this case, an I/O request can be completed only after all sub-requests have been completed. T
Autor:
Seungdo Choi, Youngil Kim, Sangjin Lee, Jungkeol Lee, Jinwoo Jeong, Joonyong Jeong, Yong Ho Song, Jaewook Kwak, Gyeongyong Lee, Wang Kexin, Kibin Park, Daeyong Lee
Publikováno v:
IEEE Access, Vol 8, Pp 37105-37123 (2020)
As big data has evolved over the past few years, a lack of storage space and I/O bandwidth has become one of the most important challenges to overcome. To mitigate these problems, data compression schemes reduce the amount of data to be stored and tr
Publikováno v:
Journal of the Institute of Electronics and Information Engineers. 56:28-38