• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.393-395
• /
• 2000

CSCW 시스템은 효율적인 공동작업의 인지를 위해 텔리포인팅, 스냅샷, 문서/프로젝트 추적등과 같은 기능들을 제공한다. 이 중 텔리포인팅은 지역 시스템의 공유윈도우에서 텔리포인터를 통해 발생한 이벤트를 원격지 시스템의 공유윈도우에 동기적으로 표현하는 기법이다. 텔리포인팅은 여러 연구들에서 응용된 바 있으나, 텔리포인팅의 프로토콜에 관한 연구는 미흡하다. 본 논문은 RTP(Real-Time Transport Protocol) 기반의 텔리포인팅을 위한 RTP 페이로드 형식을 정의한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.6
• /
• pp.594-598
• /
• 2008

In this paper we propose a fast booting technique based on Improved snapshot boot in embedded Linux, widely adopted in personal devices such as PDA and mobile phones. The existing Snapshot boot technique tries to create a snapshot image at the time of suspend, and later load the entire snapshot image into the system memory at the predefined location with the help of a bootloader at the time of resume. Since a bootloader has to copy the entire snapshot image into the predefined memory to resume the previous suspended computing state, a little bit long time is required to resume. Improved snapshot boot does not create a snapshot image consisting of whole memory pages at the time of suspend, thus resulting in smaller snapshot image than the existing snapshot boot. The remaining pages are in the swap area. The resulting smaller sized snapshot image enables much faster booting latency. Through the experiment, we can see the booting latency is reduced almost 30% with suspend image of 2982 pages. This result depends on the amount of swap-out pages.

• Journal of computational fluids engineering
• /
• v.22 no.1
• /
• pp.59-66
• /
• 2017

The guideline of selecting the number of snapshot dataset, $N_s$ in proper orthogonal decomposition(POD) was presented via the analysis of Eigen values based on the singular value decomposition(SVD). In POD, snapshot datasets from the solutions of Euler or Navier-Stokes equations are utilized to SVD and a reduced order model(ROM) is constructed as the combination of Eigen vectors. The ROM is subsequently applied to reconstruct the flowfield data with new set of flow conditions, thereby enhancing the computational efficiency. The overall computational efficiency and accuracy of POD is dependent on the number of snapshot dataset; however, there is no reliable guideline of determining $N_s$. In order to resolve this problem, the order of maximum to minimum Eigen value ratio, O(R) from SVD was analyzed and presented for the decision of $N_s$; in case of steady flow, $N_s$ should be determined to make O(R) be $10^9$. For unsteady flow, $N_s$ should be increased to make O(R) be $10^{11\sim12}$. This strategy of selecting the snapshot dataset was applied to two dimensional NACA0012 airfoil and vortex flow problems including steady and unsteady cases and the numerical accuracies according to $N_s$ and O(R) were discussed.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.587-597
• /
• 2005

Flash memory based embedded computing systems are becoming increasingly prevalent.These systems typically have to provide an instant start-up time. However, we observe that mounting a file system toy flash memory takes 1 to 25 seconds mainly depending on the flash capacity. Since the flash chip capacity is doubled in every year, this mounting time will soon become the most dominant reason of the delay of system start-up time Therefore, in this paper, we present instant mounting techniques for flash file systems by storing the In-memory file system metadata to flash memory when unmounting the file system and reloading the stored metadata quickly when mounting the file system. These metadata snapshot techniques are specifically developed for NOR- and NAND-type flash memories, while at the same time, overcoming their physical constraints. The proposed techniques check the validity of the stored snapshot and use the proposed fast trash recovery techniques when the snapshot is Invalid. Based on the experimental results, the proposed techniques can reduce the flash mounting time by about two orders of magnitude over the existing de facto standard flash file system, JFFS2.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.4-6
• /
• 2002

최근 폭발적으로 증가하는 대량의 정보를 효율적으로 관리하기 위해서 서버에 개별적으로 연결되던 저장장치를 고속의 전용 네트워크에 직접 연결하고 이를 여러 서버가 공유하는 SAN(Storage Area Network)이 등장했다. SAN을 보다 효과적으로 활용할 수 있도록 SAN 운영체제들은 여러 저장장치를 하나의 커다란 저장장치로 보이게 하는 저장장치 가상화를 지원한다. 저장장치 가상화의 핵심적인 역할을 하는 것이 바로 논리볼륨 관리자이다. 논리볼륨 관리자는 논리주소 블록을 실제 디스크의 물리블록으로 매핑시키는 매핑 관리자를 통해 가상화를 실현한다. 이 논문에서는 효율적인 논리볼륨 관리자를 위해 매핑 관리자와 자유공간 관리자의 기능 향상에 대한 방법을 찾고 이를 반영한 매핑 관리자와 자유공간 관리자를 설계하고 구현한다. 더불어 이 논문의 매핑 관리기법은 특정 시점의 볼륨이미지를 유지할 수 있는 스냅샷과 시스템을 정지시키지 않고 SAN에 디스크를 추가할 수 있는 온라인 재구성 기능을 지원한다.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.21 no.12
• /
• pp.1679-1689
• /
• 1997

In this paper, a precise description is given to the basic theory as well as the detailed algorithms for the numerical treatment of the method of POD (proper orthogonal decomposition). This method is then applied to analysing the numerical solutions of one-dimensional shallow-water equations to show how the method is affected by various parameters such as the sampling time, sampling numbers, and the spatial resolution for the autocorrelation function. A few curious features associated with this flow model found through the analysis are further explained and discussed.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.1
• /
• pp.164-169
• /
• 2010

Proper Orthogonal Decomposition (POD) is applied to the analysis of 2-dimensional cylinder wake flow. Time histories of flow variables were obtained by the incompressible CFD analysis. By using the method of snapshots the correlation matrix was constructed, and then eigenvalues, POD modes and time coefficients were calculated. Finally the flow field was reconstructed by using a few of the lower POD modes, and compared to the original ones.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.308-310
• /
• 2023

IT 서비스는 지속성, 신속한 변경을 위해 클라우드 플랫폼에서 운영되는 가상머신을 바탕으로 제공되도록 변경되고 있다. 서비스의 지속성을 위해서는 의도치 않은 상황(예를 들어, 정전, 화재 등의 재해상황)에 대해 신속하게 대처하거나, 방지하는 방안이 필요하다. 기존 클라우드 플랫폼은 이러한 상황에 대비하여 가상머신 백업을 위한 스냅샷, 이미지 기반 저장 등의 다양한 방법을 제공하였다. 그러나, 기존의 방법들은 IT 서비스 제공자의 클라우드 플랫폼적인 지식이 요구되며, 성능적 측면의 이슈가 해결될 필요가 있었다. 따라서, 본 논문에서는 지속적인 서비스 수행을 보다 유연하게 수행할 수 있는 방안으로 가상머신 풀을 구성하고 풀 내의 가상머신을 바탕으로 유사성 검증을 통해 복구하는 기법을 제시한다. 또한, 해당 기법을 보이는 사례 시스템을 구축하여 실 구현 가능함을 나타낸다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.54-56
• /
• 2000

데이터 마이닝 작업에서 사용되는 데이터의 크기는 그 특성상 대규모를 이루고 있다. 이러한 대규모의 데이터로부터 규칙을 추출하는 작업은 많은 배용이 소모된다. 또한 급변하는 데이터는 이미 발견된 마이닝 패턴에 대하여 현저한 패턴은 약한 패턴으로, 반면 약한 패턴은 현저한 패턴으로 변화시키는 요인이 되고 있다. 이러한 동적 환경에서는 기존의 데이터베이스 특정시간의 스냅 샷 형태의 데이터를 이용하였던 마이닝 방법으로는 적당하지 못하다. 따라서 이 논문에서는 동적인 환경에서 적용할 수 있는 점진적 마이닝 방법을 제시하고, 점진적 마이닝 작업이 효과적으로 수행 가능한 능동시스템 모델을 제시한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.11
• /
• pp.2594-2603
• /
• 1997

A novel method of adaptive beam forming is presented in this paper. The proposed technique provides for a suboptimal beam pattern that increases the Signal to Noise/Interference Ratio (SNR/SIR), thus, eventually increases the capacity of the communication channel, under an assumption that the desired signal is dominant compared to each component of interferences at the receiver, which is precoditionally achieved in Code Division Multiple Access (CDMA) mobile communications by the chip correlator. The main advantages of the new technique are:(1)The procedure requires neither reference signals nor training period, (2)The signal interchoerency does not affect the performance or complexity of the entire procedure, (3)The number of antennas does not have to be greater than that of the signals of distinct arrival angles, (4)The entire procedure is iterative such that a new suboptimal beam pattern be generated upon the arrival of each new data of which the arrival angle keeps changing due tot he mobility of the signal source, (5)The total amount of computation is tremendously reduced compared to that of most conventional beam forming techniques such that the suboptimal beam pattern be produced at vevery snapshot on a real-time basis. The total computational load for generating a new set of weitht including the update of an N-by-N(N is the number of antenna elements) autocovariance matrix is $0(3N^2 + 12N)$. It can further be reduced down to O(11N) by approximating the matrix with the instantaneous signal vector.