Остановите войну!
for scientists:
default search action
Sang Lyul Min
- > Home > Persons > Sang Lyul Min
Publications
- 2009
- [j29]Sung-Kwan Kim, Hunki Kwon, Donghee Lee, Sam H. Noh, Sang Lyul Min:
A Flash-Aware Cluster Allocation Scheme for Legacy File Systems. J. Inf. Sci. Eng. 25(4): 1191-1220 (2009) - 2008
- [c50]Kyoungmoon Sun, Seungjae Baek, Jongmoo Choi, Donghee Lee, Sam H. Noh, Sang Lyul Min:
LTFTL: lightweight time-shift flash translation layer for flash memory based embedded storage. EMSOFT 2008: 51-58 - 2007
- [j25]Seongjun Ahn, Jongmoo Choi, Donghee Lee, Sam H. Noh, Sang Lyul Min, Yookun Cho:
Design, Implementation, and Performance Evaluation of Flash Memory-based File System on Chip. J. Inf. Sci. Eng. 23(6): 1865-1887 (2007) - [c46]Sung-Kwan Kim, Jongmoo Choi, Donghee Lee, Sam H. Noh, Sang Lyul Min:
Virtual framework for testing the reliability of system software on embedded systems. SAC 2007: 1192-1196 - 2003
- [j21]Jong Min Kim, Donghee Lee, Sam H. Noh, Sang Lyul Min, Yookun Cho, Chong-Sang Kim:
An accurate and practical buffer allocation model for the buffer cache based on marginal gains. Inf. Process. Lett. 85(2): 93-97 (2003) - 2002
- [j20]Hyokyung Bahn, Hyunsook Lee, Sam H. Noh, Sang Lyul Min, Kern Koh:
Replica-aware caching for Web proxies. Comput. Commun. 25(3): 183-188 (2002) - [j19]Hyokyung Bahn, Kern Koh, Sang Lyul Min, Sam H. Noh:
Efficient Replacement of Nonuniform Objects in Web Caches. Computer 35(6): 65-73 (2002) - [j17]Jongmoo Choi, Sam H. Noh, Sang Lyul Min, Eun-Yong Ha, Yookun Cho:
Design, Implementation, and Performance Evaluation of a Detection-Based Adaptive Block Replacement Scheme. IEEE Trans. Computers 51(7): 793-800 (2002) - [j16]Jesung Kim, Jong Min Kim, Sam H. Noh, Sang Lyul Min, Yookun Cho:
A space-efficient flash translation layer for CompactFlash systems. IEEE Trans. Consumer Electron. 48(2): 366-375 (2002) - 2001
- [j15]Donghee Lee, Jongmoo Choi, Jong-Hun Kim, Sam H. Noh, Sang Lyul Min, Yookun Cho, Chong-Sang Kim:
LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies. IEEE Trans. Computers 50(12): 1352-1361 (2001) - 2000
- [c26]Jong Min Kim, Jongmoo Choi, Jesung Kim, Sam H. Noh, Sang Lyul Min, Yookun Cho, Chong-Sang Kim:
A Low-Overhead, High-Performance Unified Buffer Management Scheme That Exploits Sequential and Looping References. OSDI 2000: 119-134 - [c25]Jongmoo Choi, Sam H. Noh, Sang Lyul Min, Yookun Cho:
Towards application/file-level characterization of block references: a case for fine-grained buffer management. SIGMETRICS 2000: 286-295 - 1999
- [c22]Donghee Lee, Jongmoo Choi, Jong-Hun Kim, Sam H. Noh, Sang Lyul Min, Yookun Cho, Chong-Sang Kim:
On the Existence of a Spectrum of Policies that Subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) Policies. SIGMETRICS 1999: 134-143 - [c21]Jongmoo Choi, Sam H. Noh, Sang Lyul Min, Yookun Cho:
An Implementation Study of a Detection-Based Adaptive Block Replacement Scheme. USENIX Annual Technical Conference, General Track 1999: 239-252 - [c20]Hyokyung Bahn, Sam H. Noh, Sang Lyul Min, Kern Koh:
Using Full Reference History for Efficient Document Replacement in Web Caches. USENIX Symposium on Internet Technologies and Systems 1999 - 1998
- [c19]Jongmoo Choi, Sam H. Noh, Sang Lyul Min, Yookun Cho:
An Adaptive Block Management Scheme Using On-Line Detection of Block Reference Patterns. IW-MMDBMS 1998: 172-179
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-06 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint