• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.3
• /
• pp.169-176
• /
• 2017

To replace conventional DRAM, many researches have been done on nonvolatile memories. The DRAM&PCM hybrid memory is one of the effective structure because it can utilize an advantage of DRAM and PCM. However, in order to use this characteristics, pages can be replaced frequently between DRAM and PCM. Therefore, PCM still has major problem that has write-limits. Therefore, it needs an effective page management method for exploiting each memory characteristics dynamically and adaptively. So we aim reducing an average access time and write count of PCM by utilizing two locality for an effective page replacement. We proposed a page selection algorithm which is recently requested to write in DRAM and an algorithm witch uses two locality in PCM. According to our simulation, the proposed algorithm for the DRAM&PCM hybrid can reduce the PCM write count by around 22% and the average access time by 31% given the same PCM size, compared with CLOCK-DWF algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1383-1386
• /
• 2001

Internet 이용자의 급격한 증가와 광대역 통신망(B-ISDN) 구축의 확산에 따라 ATM(Asynchronous Transfer Mode)망 접속장치의 큰 수요가 기대되며, 또한 ATM망 접속장치의 성능 향상도 요구되고 있다. 기존의 연구들은 컴퓨터 프로그램의 메모리에 대한 참조가 지역적이라는 특성을 이용한 가상 메모리의 효율적인 페이지 교체 알고리즘 및 캐쉬 처리 방안들이 진행되어 왔다. 본 논문은 ATM 프로토콜 프로세서를 설계하는데 있어 네트워크 트래픽의 지역성(Locality of Reference)을 고려한 캐쉬 메모리 구조를 적용하여 보다 향상된 ATM 셀 수신이 가능하도록 한다. ATM 셀의 가상 패스 식별자/가상 채널 식별자(VPI/VCI)를 캐쉬 처리함으로써, 패킷을 분해, 재조립(Segmentation and Reassembly)할 때 관련 테이블의 검색 시간을 줄일 수 있다. 캐쉬 메모리 적용으로 인한 성능 향상을 평가하기 위해 ATM NIC 프로세서와 내부 캐시 메모리 그리고, 외부 SRAM 사이에 셀 수신 정보의 Read 와 Write에 드는 시간 비용(System Clock Cycle)을 캐시의 Hit 또는 Miss 등에 따라 구분하고, 이를 기반으로 한 시뮬레이터에 3 종류의 ATM 셀 스트림을 가하여 각각에 대해 평균 셀 처리시간, 데이터 버스의 트래픽 비율 그리고, 히트율의 3가지 평가요소를 측정하고, 비교하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.373-375
• /
• 2002

하이퍼 텍스트 구조의 특성을 이용한 순위 평가 알고리즘 중의 하나인 HITS 알고리즘은 웹 페이지들의 상호간에 연결된 링크 정보로부터 웹 문서들의 중요도를 평가하여 순위에 따른 결과를 제시한다. 그러나 초기의 HITS 알고리즘은 문서 내의 링크 빈도 수만을 고려하고, 입력 값으로 주어지는 웹 문서 집합의 특성에 의존적인 단점을 가지고 있다. 본 논문에서는 여러 웹 검색 엔진들로부터 얻어진 문서 집합에 수정된 HITS 알고리즘을 수행하는 메타 검색 에이전트를 설계하여 보다 나은 검색 성능을 구하고, 결과의 지역성을 보완한다.

• Journal of the Daesoon Academy of Sciences
• /
• v.22
• /
• pp.133-275
• /
• 2014

『옥추보경』(玉樞寶經)은 송대의 유명한 도교 경전으로 정식 명칭은 『구천응원뇌성보화천존설옥추보경』(九天應元雷聲普化天尊說玉樞寶經)이다. 송·원시대 이후 『옥추보경』은 중국 각 지역에 광범위하게 전해지면서 많은 영향을 끼쳤으며, 명나라의 세종(世宗)과 신종(神宗)은 『옥추보경』을 새로 간행하여 직접 서문을 쓰고 동시에 매우 숭앙하였다. 『옥추보경』의 집주본이 조선에 전해진 시기는 대략 명대 시기로 보고 있으며, 조선시대에 전해졌던 『옥추보경』 집주본은 융경(隆慶) 4년(1570)에 전라도 무등산(無等山) 안심사(安心寺)에서 최초로 발간되었다. 그러나 당시 안심사 판본은 첫 페이지와 경문 중의 또 다른 페이지가 없는 불완전한 판본이었다. 옹정(擁正) 11년(1733)에 송몽삼(宋夢三), 서두추(徐斗樞) 등의 제안에 따라 영변(寧邊) 묘향산(妙香山) 보현사(普賢寺)에서 『옥추보경』을 새로 간행하게 되었다. 하지만 이 또한 불완전한 판본이었으며, 병진년(1736)에 잃어버린 두 페이지를 우연히 찾게 되면서 완전한 판본을 이루게 되었다. 이후 광서(光緖) 무자년(1888)에 김흡(金潝)이 『옥추보경』을 새로 교정하였고, 계룡산(鷄龍山)에서 이를 다시 간행하였다. 명대의 『도장』에 수록된 『옥추보경』 집주본에는 신장도(神將圖)가 포함되어 있지 않았다. 하지만 조선시대 세 종류의 판본은 모두 신장도(神將圖)가 포함되어 있다. 이 외에도 조선시대 간행본과 비슷한 판본으로 영국의 대영도서관 소장본과 일본 천리대학(天理大學) 도서관의 소장본 및 중국 국가 도서관 고적관의 소장본이 있다. 그런데 안심사 판본은 41명, 보현사 판본은 47명, 계룡산 판본은 48명의 신장도가 포함되어 있으며, 대영도서관은 45명, 중국 국가 도서관은 45명 등으로 차이가 있다. 이러한 판본들에 수록된 신상의 수가 다른 이유는 아직 명확하지 않다. 이에 본문에서 필자는 먼저 계룡산 판본 『옥추보경』에 근거하여 48신장의 내력에 대한 초보적인 고찰을 진행하였다. 언어상의 문제로 『옥추보경』과 관련된 한국의 연구 성과를 반영하지는 못했지만, 『옥추보경』의 48장과 대순진리회의 『전경』에 등장하는 48장이 어떠한 연관이 있는지를 조명하는 데 유의미한 기초 작업이 될 것으로 전망한다. 이를 토대로 나아가 대순진리회의 48신상도와 『옥추보경』의 판본간의 형태적 특징에 주목하여 면밀한 상호 분석을 시도함으로써 대순진리회의 신앙체계와 『옥추보경』의 관련성을 규명하는 데 일조할 수 있기를 기대한다.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.2
• /
• pp.33-40
• /
• 2004

According as client/server is generalized by development of computer performance and information communication technology, Servers uses local cache for extensibility and early response time, and reduction of limited bandwidth. Consistency of cached data need between server and client this time and much technique are proposed according to this. This Paper improved update frequency cache consistency in old. Existent consistency techniques is disadvantage that response time is late because synchronous declaration or abort step increases because delaying write intention declaration. Techniques that is proposed in this paper did to perform referring update time about object that page request or when complete update operation happens to solve these problem. Therefore, have advantage that response is fast because could run write intention declaration or update by sel_mode electively asynchronously when update operation consists and abort step decreases and clearer selection.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.5
• /
• pp.875-878
• /
• 2006

In this paper, I design and implement a software streaming server platform which provides a software streaming service to geographically dispersed internet users. Through the use of QALoad, I verify the correct operation of implemented software streaming server platform.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.1-10
• /
• 2011

There are the large overhead of block erase and page write operations in NAND flash memory, though it has low power consumption, cheap prices and a large storage. Due to the physical characteristics of NAND flash memory, overwrite operations are not permitted at the same location, so rewriting operation require after erase operation. it cause performance decrease of NAND flash memory. Using SRAM buffer in traditional NAND flash memory, it can not only reduce effective write operation but also guarantee fast memory access time. In this paper, we proposed the small SRAM buffer management system for reducing overhead of NAND flash memory, that is, erase and write operations. The proposed buffer system in a NAND flash memory consists of two parts, i.e., a fully associative temporal buffer with the small fetching block size and a fully associative spatial buffer with the large fetching block size. The temporal buffer have small fetching blocks that referenced from spatial buffer. When it happen write operations or erase operations in NAND flash memory, the related fetching blocks in temporal buffer include a page or a block are written in NAND flash memory at the same time. The writing and erasing counts in NAND flash memory can be reduced. According to the simulation results, although we have high miss ratios, write and erase operations can be reduced approximatively 58% and 83% respectively. Also the average memory access times are improved about 84% compared with the fully associative buffer with two sizes.

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.289-297
• /
• 2004

State-of-the-art wireless communication networks allow dynamic relocation of mobile terminals. A location management mechanism is required to keep track of a mobile terminal for delivering incoming calls. In this paper, we propose a fuzzy logic-based selective paging method to reduce paging cost. In the proposed fuzzy logic-based location management method, the location update uses the area-based method that uses direction-based together with movement-based methods, and the location search uses the fuzzy logic-based selective paging method based on the mobility information of mobile terminals. A partial candidate paging area is selected by fuzzy control rules, then the fuzzy logic-based selective paging method pages only the cells within the partial candidate paging area. The performance of proposed fuzzy logic-based location management method is to be evaluated by both an analytical model and a simulation, and is compared with those of LA and BVP methods. From these evaluation results, we know that the proposed fuzzy logic-based location management method provide better performance than other location management methods.

• Journal of the Korean Society for information Management
• /
• v.31 no.3
• /
• pp.153-179
• /
• 2014

This study explores the characteristics of centrality measures for analyzing researchers' impact and structural positions in research collaboration networks. We investigate four binary network centrality measures (degree centrality, closeness centrality, betweenness centrality, and PageRank), and seven existing weighted network centrality measures (triangle betweenness centrality, mean association, weighted PageRank, collaboration h-index, collaboration hs-index, complex degree centrality, and c-index) for research collaboration networks. And we propose SSR, which is a new weighted centrality measure for collaboration networks. Using research collaboration data from three different research domains including architecture, library and information science, and marketing, the above twelve centrality measures are calculated and compared each other. Results indicate that the weighted network centrality measures are needed to consider collaboration strength as well as collaboration range in research collaboration networks. We also recommend that when considering both collaboration strength and range, it is appropriate to apply triangle betweenness centrality and SSR to investigate global centrality and local centrality in collaboration networks.

• Journal of the Korean Society for information Management
• /
• v.32 no.4
• /
• pp.205-221
• /
• 2015

The impact of a journal is commonly used as the impact of an individual paper within that journal. It is problematic to interpret a journal's impact as a single paper's impact of the journal, so there are several researches to measure a single paper's impact with its own citation counts. This study applied 8 impact indicators to Korean Citation Index database and examined discipline bias of each indicator. Analyzed indicators are simple citation counts, PageRank, f-value, CCI, c-index, single publication h-index, single publication hs-index, and cl-index. PageRank has the least discipline bias at highly ranked papers and journal bias in a discipline. On the contrary, simple citation counts showed strongly biased results toward a certain discipline or a journal. KCI database provides only simple citation counts. It needs to show PageRank (global indicator) to discover influential papers in diverse areas. Furthermore it needs to consider to provide the best of local indicators. Local indicators can be calculated only with papers in users' search results because they uses citation counts of citing papers and the number of references. They are more efficient than global indicators which explore the whole database. KCI should also consider to provide Cl-index (local indicator).