• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1323-1333
• /
• 1997

In this paper, we propose an efficient architecture for a high-speed cell concentrator/distributor(HCCD) in an ATM(Asynchronous Transfer Mode) switch and by analyzeing the simulation results evaluate the performance of the proposed architecuture. The proposed HCCD distributes cells from a switch link to local processors, or concentrates cells from local processor s to a switch link. This design is to guarntee a high throughput for the IPC (inter-processor communication) link in a distributed ATM switching system. The HCCD is designed in a moudlar architecture to provide the extensibility and the flexibility. The main characteristics of the HCCD are 1) Adaption of a local CPU in HCCD for improving flexibility of the system, 2) A cell-baced statistical multiplexing function for efficient multiplexing, 3) A cell distribution function based on VPI(Virtual Path Identifier), 4) A bypassing capability for IPC between processor attached to the same HCCD, 5) A multicasting capability for point-to-multipoint communication, 6) A VPI table updating function for the efficient management of links, 7) A self-testing function for detecting system fault.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.10 no.4
• /
• pp.1-7
• /
• 2011

The mode analysis of end-milling was introduced using recursive parametric modeling. Also, a numerical mode analysis of FRF in end-milling at different conditions was performed systematically. In this regard, a REIVM(recursive extended instrumental variable method) modeling algorithm was adopted and natural modes of real and imaginary part were discussed. This recursive approach can be used for the on-line system identification and monitoring of an end-milling for this purpose. For acquiring a cutting force, an experimental practice was performed. And these end-milling forces were used for the calculation of FRF(Frequency response function) and its mode analysis. Also, the FRF was analysed for the prediction of end-milling system. As a results, this algorithm was successful in each condition for the detection of natural modes of end-milling. After numerical analysis of the FRF, the tooth passing frequency was discriminated in their FRF, power spectrum and mode calculation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.637-642
• /
• 2014

In this paper, we propose a efficient shift index searching algorithm for design of the block LDPC codes. It is combined with the message-passing based cycle search algorithm and ACE algorithm. We can determine the shift indices by ordering of priority factors which are effect on the LDPC code performance. Using this algorithm, we can construct the LDPC codes with low complexity compare to trellis-based search algorithm and save the memory for storing the parity check matrix.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2010.06a
• /
• pp.70-70
• /
• 2010

Until recently. the study about bypass diode has been limited to theoretical study. but, in this paper, We study on the relationship between structure of PV module and Bypassing point by simulation software(Pspice). We expected the design on the PV module has an effect on bypassing point. So, we designated the two kind of experiment with PV modules. One of the experiment is on the relationship between the number of rows and Bypassing point on the PV modules, the other experiment is on the relationship between the number of groups(two columns) on the PV modules.(around 50Wp, 100Wp, 150Wp, 200WP) As the result, the more increase the number of rows, bypassing point is faster. And the more increase the number of groups in more than 3 groups, bypassing point is faster more than case of increasing the rows.

• The Journal of Information Technology
• /
• v.5 no.1
• /
• pp.29-37
• /
• 2002

Distributed programming can be greatly simplified by language support for distributed communication. Many web browsers now offer some form of distributed objects and the number and types of them are growing daily in interesting and innovative ways CORBA IDL and Java RMI, the representative of distributed object model, support different approaches for distributed computing environments. CORBA approach does not support the application generated by java RMI, even though it supports multiple programming languages. Object translation system between RMI to CORBA is designed and implemented for interoperability of distributed objects on the two different distributed programming environments. Suggested system is considered binding, inheritance, polymorphism, object passing, and callback which are key properties on the distributed objects. Translation System we suggested is implemented on the Window/NT(version 4.0) with Java Development Kit(version 1.1.6).

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.28 no.5
• /
• pp.604-611
• /
• 2004

Simulation of three-dimensional turbulent flow with LES and DNS lakes much time and expense with currently available computing resources and requires big computing resources especially for high Reynolds number. The emerging alternative to provide the required computing power and working environment is the Grid computing technology. We developed the CFD code which carries out the parallel computing under the Grid environment. We constructed the Grid environment by connecting different PC-cluster systems located at two different institutes of Pusan National University in Busan and KISTI in Daejeon. The specification of PC-cluster located at two different institutes is not uniform. We run our parallelized computer code under the Grid environment and compared its performance with that obtained using the homogeneous computing environment. When we run our code under the Grid environment, the communication time between different computer nodes takes much larger time than the real computation time. Thus the Grid computing requires the highly fast network speed.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.121-129
• /
• 2007

Scalarization is a process that a parallel construct like an array statement of Fortran 90 or FORALL of HPF is converted into sequential loops that maintain the correct semantics. Most compilers of HPF, recognized as a standard data parallel language, convert a HPF program into a Fortran 77 program inserted message passing primitives. During scalariztion, a parallel construct FORALL should be translated into Fortran 77 DO loops maintaining the semantics of FORALL. In this paper, we propose a scalarization algorithm which converts a FORALL construct into a DO loop with improved performance. For this, we define and use a relation distance vector to keep necessary dependence informations. Then we evaluate execution times of the codes generated by our method and by PARADIGM compiler method for various array sizes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.156-157
• /
• 2011

In this work, we study the checkpoint/restart problem for message-passing parallel applications running on cloud computing environment. This is a new direction which arises from the trend of enabling the applications to run on the cloud computing environment. The main objective is to propose an efficient checkpoint algorithm for message-passing parallel applications considering communications with external systems. We further implement the novel algorithm by modifying gSOAP and OpenMPI (the open source libraries) which support service calls and checkpoint message-passing parallel programs, especially. The simulation showed that additional costs to the executing and checkpointing application of the algorithm are negligible. Ultimately, the algorithm supports efficiently the checkpoint/restart service for message-passing parallel applications, that send requests to external services.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.4
• /
• pp.361-368
• /
• 2010

In this paper, the parallel algorithm using MPI(Message-Passing Interface) library is introduced in order to improve numerical efficiency for the staggered method for nearly incompressible and impermeable porous media which was introduced by Park and Tak(2010). The porous media theory and the staggered method are also briefly introduced in this paper. Moreover, we account for MPI library for blocking, non-blocking, and collective communication, and propose combined the staggered method with the blocking and nonblocking MPI library. And then, we present how to allocate CPUs on the staggered method and the MPI library, which is related with the numerical efficiency in order to solve unknown variables on nearly incompressible and impermeable porous media. Finally, the results comparing serial solution with parallel solution are verified by 2 dimensional saturated porous model according to the number of FEM meshes.

• Convergence Security Journal
• /
• v.16 no.6_2
• /
• pp.83-88
• /
• 2016

Over recent years there has been considerable growth in interest in the use of biometric systems for personal authentication. Biometrics is a field of technology which has been and is being used in the identification of individuals based on some physical attribute. By using biometrics, authentication is directly linked to the person, rather than their token or password. Biometric authentication is a type of system that relies on the unique biological characteristics of individuals to verify identity for secure access to electronic systems. In 2013, Althobati et al. proposed an efficient remote user authentication protocol using biometric information. However, we uncovered Althobati et al.'s protocol does not guarantee its main security goal of mutual authentication. We showed this by mounting threat of data integrity and bypassing the gateway node attack on Althobati et al.'s protocol. In this paper, we propose an improved scheme to overcome these security weaknesses by storing secret data in device. In addition, our proposed scheme should provide not only security, but also efficiency since sensors in WSN(Wireless Sensor Networks) operate with resource constraints such as limited power, computation, and storage space.