• Proceedings of the Optical Society of Korea Conference
• /
• 1995.06a
• /
• pp.177-184
• /
• 1995

피고초 및 펨퍼초 펄스를 얻기 위한 동기형(Synchrous mode-locking) 및 혼합형 모드결합(Hybrid mode-locking) 방식이 색소레이저에서의 출력특성에 대하여 연구하였다. 피고초 및 펨퍼스 펄스의 발생원리에 대하여 논하고, 군속도 분산과 자기위상변조와 같은 펨퍼토 펄스의 형성원리 사이의 연관성에 대하여 논한다. 또한 펨도초 펄스의 시분해 응용으로 축퇴 4광파 혼합법으로 미소반도체 CdSSe(Re645)에서 위상이완시간(Dephasing time)의 측정에 관하여 논한다.

• Journal of Information Technology Applications and Management
• /
• v.12 no.4
• /
• pp.59-70
• /
• 2005

Flash memories are one of best media to support portable computer's storages in mobile computing environment. The features of non-volatility, low power consumption, and fast access time for read operations are sufficient grounds to support flash memory as major database storage components of portable computers. However, we need to improve traditional transaction management scheme due to the relatively slow characteristics of flash operation as compared to RAM memory. in order to achieve this goal, we devise a new scheme called Flash Two Phase Locking (F2PL) scheme for efficient transaction processing. F2Pl improves transaction performance by allowing multi version reads and efficiently handling slow flash write/erase operation in lock management process. We also propose a simulation model to show the performance of F2PL. Based on the results of the performance evaluation, we conclude that F2PL scheme outperforms the traditional scheme.

• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.189-194
• /
• 2007

To reduce the cost and time of transport in Eurasian railroad networks such as TKR, TCR and TSR owing to the problem of different track gauges(narrow/standard/broad gauge), it is important to develop the gauge - adjustable wheelset system to adapt easily to these gauges. Moreover, freight trains having the gauge - adjustable wheelset will be run various curved tracks in railroad networks. Therefore, to assure the safety of the gauge-adjustment wheelset system, it is necessary to evaluate integrity of locking parts in the system using stress analysis. In this study, it was performed to contact stress analysis of locking parts by using FEA(finite element analysis) simulator during the gauge changeover operation and freight trains' service in the curved track, respectively.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.3
• /
• pp.32-41
• /
• 1995

In the analysis of metal forming processes by the finite element method, there are many numerical instabilities such as element locking, hourglass mode and shear locking. These instabilities may have a bad effect upon accuracy and convergence. The present work is concerned with improvement of stability and efficiency in two-dimensional rigid-plastic finite element method using various type of elemenmts and numerical intergration schemes. As metal forming examples, upsetting and backward extrusion are taken for comparison among the methods: various element types and numerical integration schemes. Comparison is made in terms of stability and efficiency in element behavior and computational efficiency and a new scheme of adaptive directional reduced integration is introduced. As a result, the finite element computation has been stabilized from the viewpoint of computational time, convergency, and numerical instability.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.340-343
• /
• 1999

In this paper, we propose a wide range PLL(Phase Locked Loop) for 64X CD-ROMs & l0X DVD-ROMs. The frequency locking range of the Proposed PLL is 75MHz~370MHz. To reduce jitters caused by large VCO gain and supply voltage noise, a new V-I converter and a differential delay cell are used in 3-stage ring VCO, respectively. The new V-I converter has a 0.6V ~ 2.5V wide input range. In addition, we propose a new charge pump which has perfect current matching characteristics for the sourcing/sinking current. This new charge pump improves the locking time and the locking range of the PLL. This Chip is implemented in 0.25${\mu}{\textrm}{m}$ CMOS process. It consumes 55㎽ in worst case with a single 2.5V power supply.

• Annual Conference of KIPS
• /
• 2011.04a
• /
• pp.238-241
• /
• 2011

Locking은 다중 스레드간의 경쟁 상태를 조절하기 위한 전통적인 메커니즘이다. 하지만 Locking을 사용할 경우, 공유 데이터에 대한 잠금(lock) 및 해제(unlock)에 따른 대기 시간(waiting time)이 발생하며, 이는 전체 시스템 성능을 저하시킨다. Wait-free 동기화는 이러한 전통적인 Locking의 비용을 줄이고자 하는 기법이다. Wait-free 동기화의 기본 아이디어는 공유 데이터 수정 시 복제본을 생성해 처리함으로써 잠금에 따른 대기시간을 제거하는 것이다. 따라서 Wait-free 동기화 기법에서는 복제본생성 이후의 메모리 해제가 가장 큰 비용을 차지한다. 이에 본 논문에서는 Wait-free 동기화 및 메모리 해제 기법과 관련하여 주요 이슈 및 기술 현황에 대한 분석을 실시하였다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.6
• /
• pp.22-31
• /
• 2003

Traditional concurrency control strategies for database system are inappropriate for mobile computing environments in which communication disconnection could occur frequently. The time available to access transactions may be extremely limited in mobile computing. In order to ensure that this time is utilized most effectively, the short-lived transactions must be a main stream of transactions. Service handoffs which occur due to communication disconnection, could degrade the performance of mobile transactions especially for short-lived transactions. Altruistic locking protocol is in its nature favorable to short-lived transactions since it applies the donation of locks to long-lived transactions as early as possible. Performance for short-lived transactions could be improved when we applied altruistic locking to mobile computing.

• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.42-52
• /
• 2000

In many real time applications that the system maintains sensitive information to be shared by multiple users with different security levels, security is another important requirement. A secure real time database system must satisfy not only logical data consistency but also timing constrains and security requirements associated with transactions. Even though an optimistic concurrency control method outperforms locking based method in firm real time database systems, where late transactions are immediately discarded, most existing secure real time concurrency control methods are based on locking. In this paper, we propose a new optimistic concurrency control protocol for secure real time database systems, and compare the performance characteristics of our protocol with locking based method while varying workloads. The result shoes that our proposed O.C.C protocol has good performance in case of many data conflict.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.2
• /
• pp.1-10
• /
• 2000

Traditional syntax-oriented serializability notions ate considered to be not enough to handle in particular various types of transaction in terms of duration of execution. To deal with this situation, altruistic locking has attempted to reduce delay effect associated with lock release moment by use of the idea of donation. An improved form of altruism has also been deployed in extended altruistic locking in a way that scope of data to be early released is enlarged to include even data initially not intended to be donated. In this paper, we first of all investigated limitations inherent in both altruistic schemes from the perspective of alleviating starvation occasions for transactions in particular of short-lived nature. The idea of two-way donation locking(2DL) has then been experimented to see the effect of more than single donation in client-server database systems. Simulation experiments shows that 2DL outperforms the conventional two-phase locking in terms of the degree of concurrency and average transaction waiting time under the circumstances that the size of long-transaction is in between 5 and 9.

• Journal of Korea Multimedia Society
• /
• v.21 no.2
• /
• pp.232-241
• /
• 2018

Operational Transformation (OT) algorithms for real-time collaborative editing systems are becoming increasingly important due to the increased demand for collaborative data processing. The operational transformation algorithm is a technique for real-time concurrency control and consistency maintenance with non-locking technique, and many studies have been conducted to overcome three issues of convergence, causality-prevention, and intention-prevention. However, previous work has the disadvantage of wasting memory by storing all operations that occurred during an edit operation in the history buffer to solve this problem. Therefore, we propose a memory-saving real-time collaborative editing system that maintains a constant memory space and concurrency control through a method of applying the valid-time to each user-generated operation in order to reduce memory waste. This system prevents long-term memory occupation of client-generated operations, thus it reduces the space and time complexity even with low-rate of collaboration work, so that the performance degradation avoids.