• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.441-450
• /
• 2002

As the size of embedded system software increase bigger and bigger, and it's complexity is grower and grower, the usage of dynamic memory management scheme such collector also has been increased. Using the garbage collector, however, inherently lead us performance degradation. In order to resolve this kind of performance problem in the Java based embedded system. we introduce an explicit dynamic memory free method to the automated dynamic memory management environment. which can be performed by a programmer. In the worst case, the prosed scheme shows the same performance as the case of that only garbage collector is working, since the unclaimed garbage objects will eventually be collected later by the garbage collector. In the best case. our method is free from any runtime overhead because the applications can be implemented without any intervention of the garbage collector. Although the proposed method can be facilitated with all the existing garbage collection algorithms, it shows an outperform in the case of mark-and-sweep algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.125-132
• /
• 2023

To NP-complete 3-SAT problem, this paper proposes a O(nm) polynomial time algorithm, where n is the number of literals and m is the total frequency of all literals in equation f. Conventionally well-known DPLLs should perform O(2^𝑙) in the worst case by performing backtracking if they fail to find a solution in a brute-force search of a branch-and-bound for the number of literals 𝑙. DPLL forms the core of the SAT Solver by substituting true(T) or false(F) for a literal so that a clause containing the least frequency literal is true(T) and removing a clause containing that literal. Contrary to DPLL, the proposed algorithm selects a literal _max𝑙 with the maximum frequency and sets $_{\max}({\mid}l{\mid},{\mid}{\bar{l}}{\mid})=1$. It then deletes 𝑙∈c_i clause in addition to ${\bar{l}}$ from ${\bar{l}}{\in}c_i$ clause. Its test results on various k-SAT problems not only show that it performs less than existing DPLL algorithm, but prove its simplicity in satisfiability verification.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.147-153
• /
• 2007

Task scheduling is an essential part of any computer system for allocating tasks to a processor of the system among various competitors. As we know, in real-time system, the failure of scheduling a hard real-time task my lead to disastrous consequence. Besides efficiency, resource and speed, real-time system has to take time constraint in serious consideration. This paper proposes a priority-driven scheduling algorithm for real-time multiprocessor system. which is called L-RE coordinates algorithm. L-RE coordinates is a new way of describing the task scheduling problem. In the algorithm, we take both deadline and laxity into consideration for allocating the priority. The simulation result shows that the new algorithm is viable and performance better than EDF and LLF algorithm on schedulability and context switch respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.1
• /
• pp.143-152
• /
• 2012

In this paper hardware implementation of GF($2^{191}$) elliptic curve cryptographic coprocessor which supports 7 operations such as scalar multiplication(kP), Menezes-Vanstone(MV) elliptic curve cipher/decipher algorithms, point addition(P+Q), point doubling(2P), finite-field multiplication/division is described. To meet structure resistant against simple power analysis, the ECC processor adopts the Montgomery scalar multiplication scheme which main loop operation consists of the key-independent operations. It has operational characteristics that arithmetic units, such GF_ALU, GF_MUL, and GF_DIV, which have 1, (m/8), and (m-1) fixed operation cycles in GF($2^m$), respectively, can be executed in parallel. The processor has about 68,000 gates and its simulated worst case delay time is about 7.8 ns under 0.35um CMOS technology. Because it has about 320 kbps cipher and 640 kbps rate and supports 7 finite-field operations, it can be efficiently applied to the various cryptographic and communication applications.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.3
• /
• pp.71-80
• /
• 2021

The selection of an appropriate neural network algorithm is an important step for accurate data prediction in machine learning. Many algorithms based on basic artificial neural networks have been devised to efficiently predict future data. These networks include deep neural networks (DNNs), recurrent neural networks (RNNs), long short-term memory (LSTM) networks, and gated recurrent unit (GRU) neural networks. Developers face difficulties when choosing among these networks because sufficient information on their performance is unavailable. To alleviate this difficulty, we evaluated the performance of each algorithm by comparing their errors and processing times. Each neural network model was trained using a tax dataset, and the trained model was used for data prediction to compare accuracies among the various algorithms. Furthermore, the effects of activation functions and various optimizers on the performance of the models were analyzed The experimental results show that the GRU and LSTM algorithms yields the lowest prediction error with an average RMSE of 0.12 and an average R2 score of 0.78 and 0.75 respectively, and the basic DNN model achieves the lowest processing time but highest average RMSE of 0.163. Furthermore, the Adam optimizer yields the best performance (with DNN, GRU, and LSTM) in terms of error and the worst performance in terms of processing time. The findings of this study are thus expected to be useful for scientists and developers.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.477-486
• /
• 1995

This paper describes and constructs object-oriented analysis models using Galois-lattices that we are always studying in discrete mathematics, shows fundamental approaches to maintain the models, analyzes the construction of object-oriented analysis models through good examples. Also, we define several properties of Galois-lattices that have binary relations between class objects, propose the incremental updating algorithms that can update the Galois-lattice whenever new classes are added. This proposal shows that in case of adding new class nodes the results from simulations can implement in constant time and have linearly the incremental structures in worst cases, and in that the growth rate of lattices is proportioned to class nodes in time complexity. This results can achieve the high understandability of object-oriented analysis models and the high traceability of maintenance models. Furthermore it is possible to make more efficient performances of class reusability in advantages of object-oriented systems and support truly the class hierarchical maintenances.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.461-476
• /
• 2003

Due to the implementation ease and alleviation of memory bottleneck effect, NUMA architecture has dominated in the multiprocessor systems for the past several years. However, because the NUMA system distributes memory in each node, frequent remote memory access is a key factor of performance degradation. Therefore, efficient design of RAC(Remote Access Cache) in NUMA system is critical for performance improvement. In this paper, we suggest Multi-Grain RAC which can adaptively control the RAC line size, with respect to each application behavior Then we simulate NUMA system with multi-grain RAC using MINT, event-driven memory hierarchy simulator. and analyze the performance results. At first, with profile-based determination method, we verify the optimal RAC line size for each application and, then, we compare and analyze the performance differences among NUMA systems with normal RAC, with optimal line size RAC, and with multi-grain RAC. The simulation shows that the worst case can be always avoided and results are very close to optimal case with any combination of application and RAC format.

• Journal of the Korean Society for Railway
• /
• v.10 no.5
• /
• pp.511-519
• /
• 2007

This study provides comprehensive design improvements covering technical issues concerning life safety matter In case of fire train stoppage in the middle of a tunnel. Recently Government announced that most of subway platforms will have screen doors in 3 years. Therefore, many fire safety engineers considered that they may contribute on life safety on train stoppage in tunnel. Especially The screen door can protect platform from smoke along tunnel ceiling when fire train stopped in tunnel. The study showed that platform ventilation ducts and the a tunnel ventilation chimney in the middle of tunnel in exiting subway tunnel could not guarantee life safety ability in terms of RSET vs. ASET comparison. Furthermore during evacuation process many peoples may be threatened from the smoke spread from the origin of fire. Although only additional vertical route can be installed in tunnels In order to decrease RSET, it will costs high or no spaces remains in outside on the road. The study suggested that increase of ASET can be best solution without additional escape route, therefore alternative design methods suggested on the base of simulation results. Finally the study shows alternative methods can give good result in terms of evacuation performance evaluation. The evacuation performance evaluation helps the decision-maker to determine the preferred alternatives or upgrades to existing tunnel infrastructure and other measure to meet safety objectives. Finally, the study details the effectiveness of measures the can be taken to reduce the risk of incidents in subway tunnels.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2022.05a
• /
• pp.219-219
• /
• 2022

지구 온난화와 함께 발생하는 해수면 상승은 한반도의 해안지역을 비롯하여 울릉도 등 도서지역 전반에 걸쳐 진행 중이다. 또한 해수면의 온도 상승으로 인한 열대저기압의 생성 시 에너지 공급이 증가하며 연안으로 내습하는 파랑 내습 에너지가 커지게 된다. 경상북도 울릉군에 위치한 남양항은 최근 2019년 태풍 다나스 및 2020년 태풍 마이삭 등에 의해 고파랑 혹은 침수 피해가 발생하여 항 내에서는 물양장과 선박이 파괴되고 방파제가 전도되는 등의 피해가 속출하였다. 동해안의 태풍 내습, 지구 온난화와 저기압 발달에 의한 수위 상승 등과 같은 다양한 해양기후를 고려한 연안 구조물의 파랑 영향을 검토하는 것이 중요할 것으로 판단되었다. 기상청 태풍센터에서 제공하는 1979년부터 2020년까지 한반도 해역에 내습한 태풍 중 울릉도에 영향을 미친 태풍은 18개로 울릉도 인근에 영향을 준 내습 태풍을 10년 단위로 분석해 보면, 1980년대 3개, 1990년대 2개, 2000년대 8개, 2010년대 3개, 2020년 2개로 2000년대에 울릉도 영향권에 들어간 태풍이 가장 많았으며, 심해파 추산 기간 이후 2020년 1년 동안 울릉도 인근으로 마이삭, 하이선과 같은 2개의 태풍이 연속적으로 영향을 주었다. 울릉도에 영향을 미친 18개 태풍을 대상으로 일본 기상청(JMA)에서 제공하는 1시간 바람장을 이용하여 파랑 후측 수치 모의를 수행하였으며, 해양수산부와 기상청 관측 부이를 이용하여 파랑에 대한 정확도를 확보하였다. 고파랑 내습 시 연안에 조우하는 수위 조건은 파랑 에너지의 증가를 결정하게 되며, 항만 구조물의 설계에 적용되고 있는 약최고고조위 이상(4대분조의 최대 조위)의 최극조위 조건에서 해안 구조물에 월파 및 침수 피해를 주는 요인으로 작용할 수 있다. 이를 바탕으로 울릉도 남양항에서 폭풍 시 내습한 최극고조위(0.65m)와 IPCC 5차 보고서에 제시한 최악의 시나리오(RCP 8.5) 조건에서 울릉도에서 확인된 0.79 cm 상승고를 반영하여 범람위험평가를 광역에서의 계산 결과를 입력자료로 하여 준 3차원 비 정수압 파랑 변형 수치 모형인 MIKE 3 Wave를 사용하여 실험하였다. 해수면 상승에 의한 수위 상승고는 연안 파랑 증가에 영향을 주었으며 연안 구조물의 침수 피해에 영향을 줄 것으로 판단되었다. 월파 차단, 파랑 차폐의 목적으로 건설되는 구조물의 규모 및 천단고 등을 설정하는데 설계 수위의 선정은 중요하다. 수치 실험 결과를 바탕으로 방파제 및 호안의 범람 위험 평가를 수행하고 구조물 설계 시 이러한 해수면 상승고가 반영된 설계가 중요하다는 것을 위험 평가를 통해 확인할 수 있다.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.742-757
• /
• 2001

Since database management systems(DBMSS) have limited lock resources, transactions requesting locks beyond the limit mutt be aborted. In the worst carte, if such transactions are aborted repeatedly, the DBMS can become paralyzed, i.e., transaction execute but cannot commit. Lock escalation is considered a solution to this problem. However, existing lock escalation methods do not provide a complete solution. In this paper, we prognose a new lock escalation method, adaptive lock escalation, that selves most of the problems. First, we propose a general model for lock escalation and present the concept of the unescalatable look, which is the major cause making the transactions to abort. Second, we propose the notions of semi lock escalation, lock blocking, and selective relief as the mechanisms to control the number of unescalatable locks. We then propose the adaptive lock escalation method using these notions. Adaptive lock escalation reduces needless aborts and guarantees that the DBMS is not paralyzed under excessive lock requests. It also allows graceful degradation of performance under those circumstances. Third, through extensive simulation, we show that adaptive lock escalation outperforms existing lock escalation methods. The results show that, compared to the existing methods, adaptive lock escalation reduces the number of aborts and the average response time, and increases the throughput to a great extent. Especially, it is shown that the number of concurrent transactions can be increased more than 16 ~256 fold. The contribution of this paper is significant in that it has formally analysed the role of lock escalation in lock resource management and identified the detailed underlying mechanisms. Existing lock escalation methods rely on users or system administrator to handle the problems of excessive lock requests. In contrast, adaptive lock escalation releases the users of this responsibility by providing graceful degradation and preventing system paralysis through automatic control of unescalatable locks Thus adaptive lock escalation can contribute to developing self-tuning: DBMSS that draw a lot of attention these days.