default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChong-Sang Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[j14]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)- 2001
- [j13]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) - [j12]Chang-Gun Lee, Kwangpo Lee, Joosun Hahn, Yang-Min Seo, Sang Lyul Min, Rhan Ha, Seongsoo Hong, Chang Yun Park, Minsuk Lee, Chong-Sang Kim:
Bounding Cache-Related Preemption Delay for Real-Time Systems. IEEE Trans. Software Eng. 27(9): 805-826 (2001) - 2000
- [j11]Byoung Wan Kim, Sang Lyul Min, Hyun Suk Yang, Chong-Sang Kim:
A predictive call admission control scheme for low Earth orbit satellite networks. IEEE Trans. Veh. Technol. 49(6): 2320-2335 (2000) - [c13]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
1990 – 1999
- 1999
- [j10]Sheayun Lee, Sang Lyul Min, Chong-Sang Kim, Chang-Gun Lee, Minsuk Lee:
Cache-Conscious Limited Preemptive Scheduling. Real Time Syst. 17(2-3): 257-282 (1999) - [c12]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 - 1998
- [j9]Jesung Kim, Sang Lyul Min, Chong-Sang Kim:
U-cache: A cost-effective solution to the virtual cache synonym problem. Microprocess. Microsystems 22(1): 33-40 (1998) - [j8]Chang-Gun Lee, Joosun Hahn, Yang-Min Seo, Sang Lyul Min, Rhan Ha, Seongsoo Hong, Chang Yun Park, Minsuk Lee, Chong-Sang Kim:
Analysis of Cache-Related Preemption Delay in Fixed-Priority Preemtive Scheduling. IEEE Trans. Computers 47(6): 700-713 (1998) - [c11]Sheayun Lee, Chang-Gun Lee, Minsuk Lee, Sang Lyul Min, Chong-Sang Kim:
Limited Preemptible Scheduling to Embrace Cache Memory in Real-Time Systems. LCTES 1998: 51-64 - 1997
- [j7]Tae-Jin Kim, Jong Min Kim, Sang Lyul Min, Chong-Sang Kim, Soo-Mook Moon, Seongsoo Hong:
Cache performance improvement through on-demand, in-cache page clearing. Microprocess. Microsystems 20(6): 361-371 (1997) - [j6]Minsuk Lee, Sang Lyul Min, Heonshik Shin, Chong-Sang Kim, Chang Yun Park:
Threaded Prefetching: A New Instruction Memory Hierarchy for Real-Time Systems. Real Time Syst. 13(1): 47-65 (1997) - [c10]Yun Seok Chang, Chong-Sang Kim:
The Design and Performance Evaluation of the RAID 5 Controller using the Load-Balanced Destage Algorithm. ICPADS 1997: 28-34 - [c9]Chang-Gun Lee, Joosun Hahn, Yang-Min Seo, Sang Lyul Min, Rhan Ha, Seongsoo Hong, Chang Yun Park, Minsuk Lee, Chong-Sang Kim:
Enhanced analysis of cache-related preemption delay in fixed-priority preemptive scheduling. RTSS 1997: 187-198 - 1996
- [c8]Chang-Gun Lee, Young-Kuk Kim, Sang Hyuk Son, Sang Lyul Min, Chong-Sang Kim:
Efficiently supporting hard/soft deadline transactions in real-time database systems. RTCSA 1996: 74-80 - [c7]Chang-Gun Lee, Joosun Hahn, Sang Lyul Min, Rhan Ha, Seongsoo Hong, Chang Yun Park, Minsuk Lee, Chong-Sang Kim:
Analysis of cache-related preemption delay in fixed-priority preemptive scheduling. RTSS 1996: 264-274 - 1995
- [j5]Sung-Soo Lim, Young Hyun Bae, Gyu Tae Jang, Byung-Do Rhee, Sang Lyul Min, Chang Yun Park, Heonshik Shin, Kunsoo Park, Soo-Mook Moon, Chong-Sang Kim:
An Accurate Worst Case Timing Analysis for RISC Processors. IEEE Trans. Software Eng. 21(7): 593-604 (1995) - [c6]Jesung Kim, Sang Lyul Min, Sanghoon Jeon, ByoungChul Ahn, Deog-Kyoon Jeong, Chong-Sang Kim:
U-Cache: A Cost-Effective Solution to the Synonym Problem. HPCA 1995: 243-252 - [c5]Yerang Hur, Young Hyun Bae, Sung-Soo Lim, Sung-Kwan Kim, Byung-Do Rhee, Sang Lyul Min, Chang Yun Park, Heonshik Shin, Chong-Sang Kim:
Worst Case Timing Analysis of RISC Processors: R3000/R3010 Case Study. RTSS 1995: 308-319 - 1994
- [j4]Minsuk Lee, Sang Lyul Min, Chong-Sang Kim:
A worst case timing analysis technique for instruction prefetch buffers. Microprocess. Microprogramming 40(10-12): 681-684 (1994) - [j3]Jongwan Kim, Jesung Ahn, Chong-Sang Kim, Heeyeung Hwang, Seongwon Cho:
Competitive learning neural network with dynamic output neuron generation. Neural Parallel Sci. Comput. 2(4): 431-450 (1994) - [c4]Jongwan Kim, Jesung Ahn, Chong-Sang Kim, Heeyeung Hwang, Seongwon Cho:
Multiple neural networks using the reduced input dimension. ICASSP (2) 1994: 601-604 - [c3]Sung-Soo Lim, Young Hyun Bae, Gyu Tae Jang, Byung-Do Rhee, Sang Lyul Min, Chang Yun Park, Heonshik Shin, Kunsoo Park, Chong-Sang Kim:
An Accurate Worst Case Timing Analysis Technique for RISC Processors. RTSS 1994: 97-108 - 1993
- [j2]Seong Baeg Kim, Myung Soon Park, Sun-Ho Park, Sang Lyul Min, Heonshik Shin, Chong-Sang Kim, Deog-Kyoon Jeong:
Threaded prefetching: An adaptive instruction prefetch mechanism. Microprocess. Microprogramming 39(1): 1-15 (1993) - [j1]Sang Lyul Min, Jesung Kim, Chong-Sang Kim, Heonshik Shin, Deog-Kyoon Jeong:
V-P cache: a storage efficient virtual cache organization. Microprocess. Microsystems 17(9): 537-546 (1993) - [c2]Minsuk Lee, Sang Lyul Min, Chang Yun Park, Young Hyun Bae, Heonshik Shin, Chong-Sang Kim:
A Dual-Mode Instruction Prefetch Scheme for Improved Worst Case and Average Case Program Execution Times. RTSS 1993: 98-105 - [c1]Hyun Tae Jung, Haelyong Kim, Yang-Min Seo, Ghun Choe, Sang Lyul Min, Chong-Sang Kim, Kern Koh:
Caller ID System in the Internet Environment. USENIX Security Symposium 1993
Coauthor Index
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-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
