• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.330-332
• /
• 2010

이동통신시스템에서 Warm standby sharing에 비하여 Hot standby sharing은 데이터 손실이 없고 오류 데이터가 확산되지 않는 등의 다수의 장점을 갖지만 동기화 문제로 인하여 이를 시스템에 실제로 구현하는 것은 어렵다. 따라서 본 연구에서는 Hot standby sharing에 비하여 기존의 Warm standby sharing이 갖는 동기화의 장점에 데이터 손실 및 거짓 데이터의 확산 문제를 개선할 수 있는 이중화 프로세서에 대한 마코프 모델을 설계하고자 한다.

• International Journal of Reliability and Applications
• /
• v.17 no.2
• /
• pp.121-135
• /
• 2016

In this paper, we study a system of five components. One of them is a bridge network component. Each of these components is identical and has a failure rate as a function of time. The system components have non-constant failure rates. The given system is improved by using the reduction, hot duplication, and cold duplication methods. We derive the equivalence factors of the bridge structure system to be as another system improved according to these different methods. The ${\beta}-fractiles$ are obtained to compare the original system with these improved systems. Finally, we present numerical results to show the difference between these methods.

• International Journal of Reliability and Applications
• /
• v.10 no.1
• /
• pp.43-57
• /
• 2009

In this article, we study the reliability equivalence factor of a series system. The failure rates of the system components are functions of time t. we study two cases of non-constat failure rates (i) weibull distribution (ii) linear increasing failure rate distribution. There are two methods are used to improve the given system. Two types of reliability equivalence factors are discussed. Numerical examples are presented to interpret how one can utilize the obtained results.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.4
• /
• pp.235-245
• /
• 2004

In this paper, fault tolerant mechanisms are presented for a servo manipulator system designed to operate in a hot cell. A hot cell is a sealed and shielded room to handle radioactive materials, and it is dangerous for people to work in the hot cell. So, remote operations are necessary to handle the radioactive materials in the hot cell. KAERI has developed a servo manipulator system to perform such remote operations. However, since electric components such as servo motors may fail by radiation, fault tolerant mechanisms have to be considered. For fault tolerance of the servo manipulator system, duplication mechanism increasing the reliability of the transport's driving motors and reconfiguration algorithm accommodating the slave's motor failure have been presented. The reconfiguration algorithm recovering the end effector's motion in spite of one motor's failure is based on control allocation redistributing redundant axes. The constrained optimization method and pseudo inverse method have been adopted for control allocation. Simulation examples and real test results have been presented to verify the Proposed methods.

• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.336-338
• /
• 2010

이동통신시스템에서 RNC의 MCP는 호 처리를 담당하는 부분으로, 신뢰도와 실시간성이 요구된다. MCP는 높은 견고성을 갖도록 구현되지만 다소간의 오류 율(Fault late)은 존재할 수밖에 없으므로 프로세서를 이중화하여 활성화된 프로세서가 장애를 일으키더라도 대기중인 프로세서가 연속적인 서비스를 제공할 수 있어야 한다. Warm standby sharing에 비하여 Hot standby sharing은 데이터 손실이 없고 오류 데이터가 확산되지 않는 등의 다수의 장점을 갖지만 동기화 문제로 인하여 이를 시스템에 실제로 구현하는 것은 어렵다. 따라서 본 연구에서는 동기화의 장점에 데이터 손실 및 거짓 데이터의 확산 문제를 개선 함으로서, 실제 구현의 용이성 및 성능 향상이라는 결과를 얻으려 하였다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.3
• /
• pp.319-328
• /
• 2000

The Message-Passing Interface(MPI) is a standard interface for parallel programming environment, based on that application programs run on the processors of a parallel computer. Processor nodes execute processes consisting the program by passing messages to one another. During executing, however, if a fault occurs on a processor node or a process, this will result an inconsistent state, and consequently, the whole program will have to be stopped. To solve this problem, in this paper, we propose a fault-tolerant message passing interface(FT-MPI) by adding a fault manager module to MPI. The proposed FT-MPI does not need any hardware support, and each application program based on MPI can run on the FT-MPI without any modification. The proposed fault tolerance scheme uses the so-called hot-spare process duplication method, and verified by simulations that application programs run despite of any fault with less than 5% overhead on execution time.

• Asian Pacific Journal of Cancer Prevention
• /
• v.14 no.10
• /
• pp.5615-5620
• /
• 2013

Nucleophosmin (NPM1) is a protein of highly conserved nature which works as a molecular chaperone and is mostly found in nucleoli. NPM also involved in the maturation of preribosomes and duplication of centrosomes. Furthermore, it is also active in control and regulation of the ARF-p53 tumor suppressor pathway. A high rate of incidence and prognostic involvement is reported by various authors in AML patients. In AML it behaves as a favorable prognostic marker. NPM mutations are more frequently associated with normal-karyotype AML and are usually absent in patients having abnormal or poor cytogenetic. NPM mutations are not frequent in other hematopoietic tumors. Two main types of mutations have been described to date. Both of these cause abnormal cytoplasmic localization of NPM1. Their high incidence rate in normal karyoptype and their favorable nature m ake those mutations hot spot or front face mutations which should be checked before treatment starts.

• The KIPS Transactions:PartA
• /
• v.14A no.7
• /
• pp.443-450
• /
• 2007

Performance scalability and storage scalability become important in a large scale cluster of wireless internet proxy cache servers. Performance scalability means that the whole performance of the cluster increases linearly according as servers are added. Storage scalability means that the total size of cache storage in the cluster is constant, regardless of the number of cache servers used, if the whole cache data are partitioned and each partition is stored in each server, respectively. The Round-Robin based load balancing method generally used in a large scale server cluster shows the performance scalability but no storage scalability because all the requested URL data need to be stored in each server. The hashing based load balancing method shows storage scalability because all the requested URL data are partitioned and each partition is stored in each server, respectively. but, it shows no performance scalability in case of uneven pattern of client requests or Hot-Spot. In this paper, we propose a novel dynamic hashing method with performance and storage scalability. In a time interval, the proposed scheme keeps to find some of requested URLs allocated to overloaded servers and dynamically reallocate them to other less-loaded servers. We performed experiments using 16 PCs and experimental results show that the proposed method has the performance and storage scalability as different from the existing hashing method.