• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.3
• /
• pp.147-160
• /
• 2010

The system virtualization shows interest in the consolidation of servers for the efficient utilization of system resources. There are many various researches to utilize a server machine more efficiently through the system virtualization technique, and improve performance of the virtualization software. These researches have studied with the activity to control the resource allocation of virtual machines dynamically focused on CPU, or to manage resources in the cross-machine using the migration. However, the researches of the memory management have been wholly lacking. In this respect, the use of memory is limited to allocate the memory statically to virtual machine in server consolidation. Unfortunately, the static allocation of the memory causes a great quantity of the idle memory and decreases the memory utilization. The underutilization of the memory makes other side effects such as the load of other system resources or the performance degradation of services in virtual machines. In this paper, we suggest the dynamic allocation of the memory in Xen to control the memory allocation of virtual machines for the utilization without the performance degradation. Using AR model for the prediction of the memory usage and ACO (Ant Colony Optimization) algorithm for optimizing the memory utilization, the system operates more virtual machines without the performance degradation of servers. Accordingly, we have obtained 1.4 times better utilization than the static allocation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.256-260
• /
• 2008

This paper describes an improvement of mount-time delay in NAND Flash file systems. To improve file system mount performance, this work configures a hierarchical storage system with byte-addressable NVRAM and NAND Flash memory, and let the meta data of a file system allocated in the NVRAM. Since the meta data are stored in NVRAM supporting data integrity some of the items, which are stored in Spare area and Object Header area of NAND Flash memory to control meta data of NAND Flash file system, could be eliminated. And also, this work eliminates the scanning operation of the Object Header area of previous work FRASH1.0. The scanning operation is definitely required to find out the empty Object Header address for storing the Object Header data and provokes a certain amount of performance loss in file generation and deletion. In this work, an implemented file system, so-called FRASH1.5, is demonstrated, featuring new data structures and new algorithms. The mount time of FRASH1.5 becomes twice as fast as that of the FRASH1.0. The performance in file generation gets improved by about $3{\sim}8%$. In particular, for most large-size files, the FRASH1.5 has 8 times faster mount time than YAFFS, without any performance loss as seen in the file generation.

• Journal of KIISE:Software and Applications
• /
• v.32 no.3
• /
• pp.215-226
• /
• 2005

Loop invariant code motion (LICM) optimization includes relatively heavy code analyses, thus being not readily applicable to Java Just-In-Time (JIT) compilation where the JIT compilation time is part of the whole running time. 'Classical' LICM optimization first analyzes the code and constructs both the def-use chains and the use-def chains. which are then used for performing code motions. This paper proposes a light-weight LICM algorithm, which requires only the def-use chains of loop invariant code (without use-def chains) by exploiting the fact that the Java virtual machine is based on a stack machine, hence generating code with simpler patterns. We also propose two techniques that allow more code motions than classical LICM techniques. First, unlike previous JIT techniques that uses LICM only in single-path loops for simplicity, we apply LICM to multi-path loops (natural loops) safely for partially redundant code. Secondly, we move loop-invariant, partially-redundant null pointer check code via predication support in Itanium. The proposed techniques were implemented in a JIT compiler for Itanium processor on ORP (Open Runtime Platform) Java virtual machine of Intel. On SPECjvrn98 benchmarks, the proposed technique increases the JIT compilation overhead by the geometric mean of 1.3％, yet it improves the total running time by the geometric mean of 2.2％.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4A
• /
• pp.291-300
• /
• 2002

In this paper, a way of constituting optimized S box and G function was suggested in the block cipher whose structure is similar to SEED, which is KOREA standard of 128-bit block cipher. S box can be formed with nonlinear function and an affine transform. Nonlinear function must be strong with differential attack and linear attack, and it consists of an inverse number over GF(2$\^$8/) which has neither a fixed point, whose input and output are the same except 0 and 1, nor an opposite flexed number, whose output is one's complement of the input. Affine transform can be constituted so that the input/output correlation can be the lowest and there can be no fixed point or opposite fixed point. G function undergoes diffusive linear transform with 4 S-box outputs using the matrix of 4$\times$4 over GF(2$\^$8/). G function can be constituted so that MDS(Maximum Distance Separable) code can be formed, SAC(Strict Avalanche Criterion) can be met, there can be no weak input, where a fried point, an opposite fried point, and output can be two's complement of input, and the construction of hardware can be made easy. The S box and G function suggested in this paper can be used as a constituent of the block cipher with high security, in that they are strong with differential attack and linear attack with no weak input and they are excellent at diffusion.

• Proceedings of the KOR-KST Conference
• /
• 1998.10b
• /
• pp.508-508
• /
• 1998

위험물 차량사고는 일반차량의 교통사고시 발생하는 인명피해, 재산피해, 교통지체 외에 부가적으로 환경적 영향에 의한 엄청난 인명 및 재산손실을 유발시킬 수 있다. 따라서 이러한 위험물차량사고를 예방하고 피해를 최소로 줄이기 위해서는 위험물수송경로의 신중하고 체계적인 결정이 필수적이라 할 수 있다. 외국의 경우, 위험물의 방출이 미치는 환경적 영향에 대한 인식이 확대되면서 위험물 수송시 응급처리에 관한 연구, 위험물 수송에 따른 위험도 평가에 관한 연구, 위험물 수송시 고려해야할 여러 조건에 관한 연구, 위험물 수송경로 설정에 관한 연구 등이 진행되고 있다. 반면에 우리 나라는 위험물차량관리와 사고처리에 대해 실시간적인 관리를 목표로 하는 국가차원의 계획을 수립하고는 있지만, 현재 이와 관련된 연구는 거의 없는 실정이다. 앞으로 산업발달에 따른 위험물수송량의 증가와 환경의식의 변화에 따라 위험물수송 및 사고처리 등에 관한 연구가 필요할 것이다. 따라서, 본 연구는 위험물차량의 운송경로를 결정할 때 고려해야 할 여러 가지의 기준 및 목표에 따라 위험물수송경로를 설정하는 모형을 제시함으로써 위험물수송에 수반되는 위험을 최소화하면서 위험물차량의 통행시간, 거리, 비용 등을 최적화하여 위험물수송의 안전 및 운영효율성을 향상시키고자 한다. 먼저, 위험물 수송경로의 기준지표로 사용될 위험도를 산정하기 위해 링크 주변노출인구, 밀도 등을 변수로 하는 모형식을 제안하고, 두 번째로 산정된 위험도를 기반으로 최적경로를 결정하는 알고리즘을 제안하였다. 마지막으로 가상 네트웍에 본 연구에서 제안된 모형을 적용하고 현재 일반적으로 사용되는 최단경로와 비교·분석하였다.것은 운송거리와 운송비용이 각각 주요한 변수라는 것이다. 모형의 타당성을 검증하기 위해서는 logilikelihood 값을 구하여 $\rho$^2분석을 시행하였다. 여기서는 각 품목별로 $\rho$^2값이 약 0.15~0.3의 비교적 높은 수치를 보여주고 있으므로 모형의 설명력이 어느 정도 있다는 것이 아울러 증명이 되었다. 상관관계에 대한 분석에서는 영업용 차량간의 상관관계가 높게 나타났으며, 이는 곧 영업용 화물차량을 적재중량별로 구분하는 것이 별 의미가 없음을 의미한다. 다시 말하면 자가용 차량을 보유하고 있지 않은 회사는 다른 운송전문업체에 화물운송을 의뢰하게 되므로 출하중량에 따라 화물차량을 구분하는 것에 대해서 그다지 큰 고려를 하지 않는 것으로 해석할 수가 있다.적합함을 재확인함. 6. 혼잡초기를 제외한 혼잡기간 중 대기행렬길이는 밀도데이터 없이도 혼잡 상류부의 도착교통량과 병목지점 본선통과교통량만을 이용하여 추정이 가능함. 7. 이상에 연구한 결과를 토대로, 고속도로 대기행렬길이를 산정할 수 있는 기초적인 도형을 제시함.벌레를 대상으로 처리한 Phenthoate EC가 96.38%의 방제가로 약효가 가장 우수하였고 3월중순 및 4월중순 월동후 암컷을 대상으로 처리한 Machine oil, Phenthoate EC 및 Trichlorfon WP는 비교적 약효가 낮았다.>$^{\circ}$E/$\leq$30$^{\circ}$NW 단열군이 연구지역 내에서 지하수 유동성이 가장 높은 단열군으로 추정된다. 이러한 사실은 3개 시추공을 대상으로 실시한 시추공 내 물리검층과 정압

• Nuclear Medicine and Molecular Imaging
• /
• v.43 no.5
• /
• pp.443-450
• /
• 2009

Purpose: Conventional image reconstruction uses simplified physical models of projection. However, real physics, for example 3D reconstruction, takes too long time to process all the data in clinic and is unable in a common reconstruction machine because of the large memory for complex physical models. We suggest the realistic distributed memory model of fast-reconstruction using parallel processing on personal computers to enable large-scale technologies. Materials and Methods: The preliminary tests for the possibility on virtual manchines and various performance test on commercial super computer, Tachyon were performed. Expectation maximization algorithm with common 2D projection and realistic 3D line of response were tested. Since the process time was getting slower (max 6 times) after a certain iteration, optimization for compiler was performed to maximize the efficiency of parallelization. Results: Parallel processing of a program on multiple computers was available on Linux with MPICH and NFS. We verified that differences between parallel processed image and single processed image at the same iterations were under the significant digits of floating point number, about 6 bit. Double processors showed good efficiency (1.96 times) of parallel computing. Delay phenomenon was solved by vectorization method using SSE. Conclusion: Through the study, realistic parallel computing system in clinic was established to be able to reconstruct by plenty of memory using the realistic physical models which was impossible to simplify.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.43-50
• /
• 2008

Various studies are being conducted to achieve efficient routing and reduce energy consumption in wireless sensor networks where energy replacement is difficult. Among routing mechanisms, the clustering technique has been known to be most efficient. The clustering technique consists of the elements of cluster construction and data transmission. The elements that construct a cluster are repeated in regular intervals in order to equalize energy consumption among sensor nodes in the cluster. The algorithms for selecting a cluster head node and arranging cluster member nodes optimized for the cluster head node are complex and requires high energy consumption. Furthermore, energy consumption for the data transmission elements is proportional to $d^2$ and $d^4$ around the crossover region. This paper proposes a means of reducing energy consumption by increasing the efficiency of the cluster construction elements that are regularly repeated in the cluster technique. The proposed approach maintains the number of sensor nodes in a cluster at a constant level by equally partitioning the region where nodes with density considerations will be allocated in cluster construction, and reduces energy consumption by selecting head nodes near the center of the cluster. It was confirmed through simulation experiments that the proposed approach consumes less energy than the LEACH algorithm.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2002.11a
• /
• pp.139-143
• /
• 2002

1990 년대 후반부터 다양한 디지털 통신망을 이용하여 멀티미디어 컨텐츠 서비스가 가능하게 되었다. 하지만, 멀티미디어 컨텐츠의 전달 및 이용을 위한 기반 구조들의 독자적 발전 및 다양한 통합적 관리 체계 시스템으로 인해, 멀티미디어 컨텐츠 표현 방식의 호환성 문제, 혼재하는 네트워크 전달 방식과 단말 방식의 호환성 문제 등의 잠재적인 문제점이 발생한다. 이런 문제의 대안으로 현재 존재하는 기술 및 기반 구조들 사이의 연동을 통한 큰 프레임워크인 MPEG-21이 진행 중이다. MPEG-21 의 목표는 표준화 목표를 구체화하는 것부터 진행하여, 최종적으로 “다양한 네트워크 환경과 단말기에 있어서, 투명하고 통합적으로 멀티미디어 자원의 이용을 가능하게 하는 것”이다. 본 논문에서는 현재 표준화 작업이 진행 중인 MPEG-21 을 기반으로 하는 Testbed를 제안한다. Testbed는 server, client, DIA(Digital Item Adaptation) 의 세 모듈로 구성된다. Server 의 역할은 멀티미디어 컨텐츠를 Digital Item(DI)으로 생성하고, client 가 DI를 요구할 경우 DIA 모듈을 통해서 변환된 DI를 client 에게 제공한다. DIA 모듈은 server 에서 동작되며 client로부터 요청된 DI를 분석하고 client로부터 전송된 환경 정보를 이용하여 client 환경에 적합하게 변환된 (adapted) DI를 생성하는 것이 주 기능이다. Client 는 server 에 저장되어 있는 DI를 선택하고 user preference, terminal capability 등의 필요한 정보를 server로 전송한다. Testbed 에서는 스포츠 경기의 동영상, 정지 영상, 경기 내용 역사를 기록한 파일 등의 DI를 이용한다. 표현 언어는 XML이며, HTTP 기반의 Web 환경에서 구동되도록 설계된다.스템 사이에 의미 있는 데이터 전송, 지식 획득을 위해 정보 기술 분야에서 활용해야 할 영역으로 XML Web Services, Multi-agent Systems, 전문가 컴뮤니티를 위한 그룹웨어 연구 개발에 관해 사례 중심으로 발표한다.다 신선한 공기를 넣어 주었을 때는 배의 발달이 많이 늦어져 배양 3주째에 다른 처리보다 배의 수가 훨씬 적었다. 체세포배가 발달하는 동안에는 산소를 많이 요구하지 않으나 성숙하는 동안에는 산소를 많이 요구하는 것으로 생각된다.적인 것으로 나타났다. 다만, 곡선형은 물론 직선형에서도 열교환 튜브의 배치밀도, 튜브 길이 및 두께 등의 변화에 따른 최적화 연구가 수반되어야 할 것으로 판단된다.에서 제공된 API는 객체기반 제작/편집 도구에 응용되어 다양한 멀티미디어 컨텐츠 제작에 사용되었다.x factorization (NMF), generative topographic mapping (GTM)의 구조와 학습 및 추론알고리즘을소개하고 이를 DNA칩 데이터 분석 평가 대회인 CAMDA-2000과 CAMDA-2001에서 사용된cancer diagnosis 문제와 gene-drug dependency analysis 문제에 적용한 결과를 살펴본다.0$\mu$M이 적당하며, 초기배발달을 유기할 때의 효과적인 cysteamine의 농도는 25~50$\mu$M인 것으로 판단된다.N)A(N)/N을 제시하였다(A(N)=N에 대한 A값). 위의 실험식을 사용하여 헝가리산 Zempleni 시료(15%$S_{XRD}$)의 기본입자분포로부터 %$S_{XRD}$를 계산한 결과, 16%$S_{XRD}$의 결과값을 얻을 수 있었다. 따라서, 본 연구에서 도출한 관계식들이 유효함을 확인할 수 있었다.계식들이 유효함을 확인할 수 있었다.할 때 약간의 증가

• Journal of Korea Water Resources Association
• /
• v.50 no.12
• /
• pp.837-847
• /
• 2017

Land Surface Model (LSM) was developed for the Soyang river basin located in Korean Peninsula to clarify the spatio-temporal variability of hydrological weather parameters. Variable Infiltration Capacity (VIC) model was used as a LSM. The spatial resolution of the model was 10 km and the time resolution was 1 day. Based on the daily flow data from 2007 to 2010, the 7 parameters of the model were calibrated using the Isolated Particle Swarm Optimization algorithm and the model was verified using the daily flow data from 2011 to 2014. The model showed a Nash-Sutcliffe Coefficient of 0.90 and a correlation coefficient of 0.95 for both calibration and validation periods. The hydrometeorological variables estimated for the Soyang river basin reflected well the seasonal characteristics of summer rainfall concentration, the change of short and shortwave radiation due to temperature change, the change of surface temperature, the evaporation and vegetation increase in the cover layer, and the corresponding change in total evapotranspiration. The model soil moisture data was compared with in-situ soil moisture data. The slope of the trend line relating the two data was 1.087 and correlation coefficient was 0.723 for the Spring, Summer and Fall season. The result of this study suggests that the LSM can be used as a powerful tool in developing precise and efficient water resources plans by providing accurate understanding on the spatio-temporal variation of hydrometeorological variables.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.4
• /
• pp.427-437
• /
• 1994

Optimal static load balancing in star network configurations is considered. Three kinds of load balancing direction strategies are considered. First, a job arriving at the peripheral nodes may be processed either where it arrived(origin node) or transferred directly to central node Second, a job arriving at the central node may be processed there, or transferred to lightly loaded peripheral nodes. A nonlinear optimization problem is formulated. Using the optimal solution, an optimal load balancing algorithm is derived for the second load balancing strategy. Third a job arriving at the central node or a peripheral node may be processed either at origin node or transferred to another lightly loaded node (central or peripheral). A load balancing algorithm is derived for the third load balancing strategy. The effects of these three load balancing strategies are compared by numerical experiments. During the conduct of these in numerical experiments, several interesting phenomena were observed. The third load balancing strategy improved performance more than the first two other strategies. The second load balancing strategy, as a whole, resulted in only slightly improved performance. Finally, of the central node has larger processing power than the peripheral nodes, the first and third load balancing strategies produce equal performance improvement.