• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.9-13
• /
• 2012

In order to overcome the complexity and power problems of superscalar processors, the multi-core architecture has been prevalent recently. Although the execution-driven simulation is wide spread, the trace-driven simulation has speed advantages over the execution-driven simulation. We present a methodology to simulate multi-core architecture using trace-driven simulator. Using SPEC 2000 benchmarks as input, the trace-driven simulation has been performed for the cores ranging from 2 to 16 extensively. As a result, the 16-core processor resulted in 4.1 IPC and 13.3 times speed up over single-core processor on the average.

• Archives of design research
• /
• v.12 no.2
• /
• pp.147-154
• /
• 1999

This is a suggestional thesis for fu. ;her study on computer game design. We can understand the computer game design as a new form of communication design.The particular qualities of computer game as communication is: 1. computer game is not a mere recording of past events but a creative reproduction by the player.; 2. its production procedure is a multiple structure of program engineering and multimedia design. Computer game design should be more than just production of visual image or technical results. It could be the design of "fields for training of identity".ity".uot;.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.777-780
• /
• 2014

본 논문에서는 휴대용 기기 사용자들의 이동 궤적을 기록한 대용량의 GPS 위치 데이터 집합으로부터 각 사용자의 이동 패턴 모델을 학습해내고, 이 모델을 적용하여 각 사용자의 다음 방문 장소를 효율적으로 예측할 수 있는 맵리듀스 기반의 분산 데이터 마이닝 시스템을 소개한다. 본 시스템은 크게 사용자별 이동 패턴 모델을 학습하는 후단부와 실시간으로 다음 방문 장소를 예측하는 전단부로 구성된다. 이 중에서 후단부는 주요 장소 추출, 이동 궤적 변환, 이동 패턴 모델 학습 등 총 3개의 맵리듀스 작업 모듈들로 구성된다. 이에 반해, 본 시스템의 전단부는 이동 경로 후보군 생성, 다음 장소 예측 등 총 2개의 맵리듀스 작업 모듈들로 구성된다. 그리고 본 시스템을 구성하는 각각의 작어마다 분산처리를 극대화할 수 있도록 맵과 리듀스 함수를 설계하였다. 끝으로, 대용량의 GeoLife 벤치마크 데이터 집합을 이용하여 본 논문에서 소개한 시스템의 예측 성능을 분석하기 위한 실험을 수행하였고, 이를 통해 본 시스템의 높은 성능을 확인할 수 있었다.

• Journal of The Korea Institute of Healthcare Architecture
• /
• v.17 no.2
• /
• pp.53-59
• /
• 2011

본 연구는 미국 텍사스 주의 소도시에 있는 스캇 앤 화이트 클리닉의 외부공간을 대상으로 하여 외래환자와 방문객들이 직면하는 길찾기의 문제점을 분석한다. 연구의 공간적 범위는 클리닉의 외부공간으로 한정하여 진입도로에서 진입하여 주차한 후 출입구에 도달하는 경로에서 관찰되는 행태적 특성을 분석한다. 분석의 초점은 진입도로에서 이루어지는 경로선택의 결정과 그것이 클리닉에 진입하기 위한 출입구 결정에 미치는 영향관계에 둔다. 분석은 외부공간에서의 길찾기에 관한 기존 연구문헌을 참고하여 작성한 연구모형에 의해 이루어진다. 구체적으로 보면, 이용자들이 보이는 날씨, 성별, 그리고 나이에 따른 길찾기 행태의 차이를 클리닉의 남동측 출입구와 남서측 출입구에서 발생하는 이용자들의 하차 빈도를 측정하였다. 또한 하차의 위치를 행태 지도에 기록하여 연구모델에 나타나는 상관성을 분석하였다. 길찾기 행태분석 결과를 통해 파악된 외부주차장에 주차한 후 클리닉에 접근하는 이용자들의 경로선택의 문제점과 클리닉의 입구 공간에서 하차한 이용자들의 입구선택에서 나타나는 문제점을 토대로 하여 외부공간에서 발생하는 길찾기 행위의 효율성을 증진시키기 위한 디자인 추천 사항을 다음과 같이 제시한다: (1) 시각적 단서를 제공하기 위해 남서쪽 출입구의 형태와 색채 차별화; (2) 도로에서 클리닉 진입공간에 위치한 안내판의 글자 크기 확대; (3) 학습된 길찾기 행태를 보조하기 위해 동쪽에 랜드마크 시설물 설치 및 목적 지점의 최종경관 개선; (4) 과도한 클리닉의 정보에 의해 감소되는 가독성을 고려하여 안내판의 정보 간략화; (5) 색채의 대조를 고려(출입구 벽에 설치된 클리닉의 이름이 갈색에 푸른색으로 설치되어 있어 색채의 대비가 낮아 가독성 떨어짐); (6) 클리닉 중앙 출입구의 하차 공간 상부에 설치된 캐노피 기둥의 과도한 크기에 의해 발생하는 가시공간의 감소에 의해 발생하는 하차 공간 사용의 혼잡 문제를 제거하기 위해 기둥규모 축소; (7) 하차점 6까지 캐노피를 확장하여 우천시에 발생하는 공간 사용의 문제점 제거; 그리고 (8) 올바른 하차공간 사용을 위해 진입 접근도로에 차선 설치.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.4
• /
• pp.945-951
• /
• 2008

In this paper, a new high performance data cache scheme that improves exploitation of both the spatial and temporal locality is proposed. The proposed data cache consists of a hardware prefetch unit and two sub-caches such as a direct-mapped (DM) cache with a large block size and a fully associative buffer with a small block size. Spatial locality is exploited by fetching and storing large blocks into a direct mapped cache, and is enhanced by prefetching a neighboring block when a DM cache hit occurs. Temporal locality is exploited by storing small blocks from the DM cache in the fully associative buffer according to their activity in the DM cache when they are replaced. Experimental results on Spec2000 programs show that the proposed scheme can reduce the average miss ratio by $12.53%\sim23.62%$ and the AMAT by $14.67%\sim18.60%$ compared to the previous schemes such as direct mapped cache, 4-way set associative cache and SMI(selective mode intelligent) cache[8].

• Journal of KIISE:Databases
• /
• v.36 no.5
• /
• pp.374-385
• /
• 2009

Flash memory becomes increasingly popular as data storage for various devices because of its versatile features such as non-volatility, light weight, low power consumption, and shock resistance. Flash memory, however, has some distinct characteristics that make today's disk-based database technology unsuitable, such as no in-place update and the asymmetric speed of read and write operations. As a result, most traditional disk-based database systems may not provide the best attainable performance on flash memory. To maximize the database performance on flash memory, some approaches have been proposed where only the changes made to the database, i.e., logs, are written to another empty place that has born erased in advance. In this paper, we propose an efficient log management scheme for flash-based database systems. Unlike the previous approaches, the proposed approach stores logs in specially allocated blocks, called log blocks. By evenly distributing logs across log blocks, the proposed approach can significantly reduce the number of write and erase operations. Our performance evaluation shows that the proposed approaches can improve the overall system performance by reducing the number of write and erase operation compared to the previous ones.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.123-128
• /
• 2012

In order to overcome the hardware complexity and performance limit problems, recently the multi-core architecture has been prevalent. For hardware simplicity, usually RISC processor is adopted as the unit core processor. However, if the performance of unit core processor is enhanced, the overall performance of the multi-core processor architecture can be further enhanced. In this paper, in-order superscalar processor is utilized as the core for the multi-core processor architecture. Using SPEC 2000 benchmarks as input, the trace-driven simulation has been performed for the number of superscalar cores between 2 and 16 and the window size of 4 to 16 extensively. As a result, the 16-core superscalar processor for the window size of 16 results in 8.4 times speed up over the single core superscalar processor. When compared with the same number of cores, the multi-core superscalar processor performance doubles that of the multi-core RISC processor.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.3
• /
• pp.323-329
• /
• 2014

In spoken language research, transcription process needs to be carried out to translate voice data into text. Transcription tool, support program of transcription, offers various information such as content and time of utterance and speaker information. For this reason, inexperienced computer users are having trouble familiarizing with the program. Moreover, since there are little transcription tools developed domestically in Korea, they are usually not suitable for Korean environment. In this paper, we propose a transcription tool which supports not only Korean transcription but easy-to-use interface environment for novice. The transcription supporting function is also provided to minimize mistake that might happen in the process of transcription. And a system structure will be provided for data reliability. Usability of the proposed tool is evaluated in accordance with transcription experience. The evaluation result shows that transcription process and transcription support function have become faster and more convenient respectively.

• The KIPS Transactions:PartA
• /
• v.16A no.2
• /
• pp.55-60
• /
• 2009

Race conditions in current Java programs must be detected because it may cause unexpected result by non-deterministic executions. For detecting such races during program execution, execution flows of all threads and all access events can be monitored. It is difficult for previous race detection techniques to monitor all threads and access events in actuality because these techniques analyze the files traced during program execution or modify original source programs and then monitor these programs. This paper presents a transparent scalable monitoring tool to detect races using JDI(Java Debug Interface) where JDI is 100% pure java interface to provide in JDPA(Java Platform Debugger Architecture) and is able to provide information corresponding to events occurred in run-time of programs. This tool thus can monitor execution flows of all threads and all access events without program modification. We prove transparency of the presented tool and grasp the efficiency of it using a set of published benchmark programs. As a result of this, the suggested tool can monitor all threads and accesses of these programs without their modification, and their monitoring time is increased to more than 20 times.

• The Journal of the Convergence on Culture Technology
• /
• v.9 no.6
• /
• pp.911-917
• /
• 2023

In today's world, we find ourselves facing energy crises due to factors such as war and climate crises. To prepare for these energy crises, many researchers continue to study systems related to energy monitoring and conservation, such as energy management systems, energy monitoring, and energy conservation. In line with these efforts, nations are making it mandatory for energy-consuming facilities to implement these systems. However, these facilities, limited by space and energy constraints, are exploring ways to improve. This research explores the operation of a data collection system using low-performance embedded devices. In this context, it proves that an optimized version of RocksDB, a Key-Value store, outperforms traditional databases when it comes to time-series data. Furthermore, a comprehensive database evaluation tool was employed to assess various databases, including optimized RocksDB and regular RocksDB. In addition, heterogeneous databases and evaluations are conducted using a UD Benchmark tool to evaluate them. As a result, we were able to see that on devices with low performance, the time required was up to 11 times shorter than that of other databases.