• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (A)
• /
• pp.364-366
• /
• 2006

자원이 한정적인 시스템을 위해 실시간 운영체제는 자원을 효율적으로 관리해야 한다. 대부분 실시간 운영체제는 효율적인 메모리 관리를 위해 동적으로 메모리를 할당한다. 하지만 동적 메모리의 할당과 해제의 반복은 비연속적인 메모리 공간을 생성하고 이런 비연속적인 메모리의 생성은 단편화와 같은 성능을 저하시키는 요인이 된다. 논문은 실시간 운영체제에서 시간결정성을 높여줄 수 있도록 분산된 프리 메모리 블록을 할당하는 기법을 설계 및 구현하였다.

• 대한의용생체공학회:의공학회지
• /
• 제9권1호
• /
• pp.79-86
• /
• 1988

This paper describes the design of a hardware systenl for ECG feature extraction based on pipeline processor consistinsf of three microcomputers. ECG data is acquisited by 12 bit A/D converter with hardware QRS triggered detector. Four diagnostic parameters parameters-heart rate, morPhology, axis, and 57 segment-are used for the classification and the diagnosis of arrhythmia. The functions of the main CPU were distributed and processed with three microcomputers. Therefore the effective data process and the real time process using microcomputer can be obtained. The interconnection structure consisting of two common memory units is designed to decrease the delay time caused by data transfer between processors and designed by which the delay time can be taken Loye of one clock period.

• 한국가시화정보학회지
• /
• 제5권2호
• /
• pp.9-13
• /
• 2007

Typhoon simulation based on dynamical forecasting results is demonstrated by utilizing geodesic model GME (operational global numerical weather prediction model of German Weather Service). It is based on uniform icosahedral-hexagonal grid. The GME gridpoint approach avoids the disadvantages of spectral technique as well as the pole problem in latitude-longitude grids and provides a data structure extremely well suited to high efficiency on distributed memory parallel computers. In this study we made an attempt to simulate typhoon 'NARI' that passed over the Korean Peninsula in 2007. GME has attributes of numerical weather prediction model and its high resolution can provide details on fine scale. High resolution of GME can play key role in the study of severe weather phenomenon such as typhoons. Simulation of future typhoon that is assumed to occur under the global warming situation shows that the life time of that typhoon will last for a longer time and the intensity will be extremely stronger.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2000년도 봄 학술발표논문집 Vol.27 No.1 (A)
• /
• pp.133-135
• /
• 2000

분산 공유 메모리 상에서 클라이언트들은 네트워크를 통해 원격 공유 메모리 상으로 접근하게 된다. 접근 시에 클라이언트들은 접근 정보를 자신의 지역 캐쉬에 저장해 두었다가 필요시에 인출해서 사용한다. 그러나 시간이 경과함에 따라 다른 클라이언트들에 의해서 데이터 갱신이 이루어질 수 있다. 이에 본 논문에서는 원격 데이터 정보를 객체로 설정하여 이 객체를 관리하여 분산 공유 메모리 상에서 데이터 일관성을 유지하고자 한다. 객체 중복을 통해서 분산 객체 시스템을 구성하였을 때 기존의 중복 기법에서 사용하는 일관성 비용 이외에 별도의 추가 비용이 없이도 제한적으로 병렬 수행의 효과를 볼 수 있다. 또한 중복 기법에 있어서 가장 큰 오버헤드로 알려진 일관성 유지비용을 최소화시키기 위하여 이 비용을 결정하는 가장 핵심저인 요소인 객체의 복사본의 수를 동시적으로 변화시키면서 관리함으로써 전체 수행 시간의 측면에서 많은 향상을 가져왔다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제24권2호
• /
• pp.161-197
• /
• 2020

Total variation minimization is standard in mathematical imaging and there have been numerous researches over the last decades. In order to process large-scale images in real-time, it is essential to design parallel algorithms that utilize distributed memory computers efficiently. The aim of this paper is to illustrate recent advances of domain decomposition methods for total variation minimization as parallel algorithms. Domain decomposition methods are suitable for parallel computation since they solve a large-scale problem by dividing it into smaller problems and treating them in parallel, and they already have been widely used in structural mechanics. Differently from problems arising in structural mechanics, energy functionals of total variation minimization problems are in general nonlinear, nonsmooth, and nonseparable. Hence, designing efficient domain decomposition methods for total variation minimization is a quite challenging issue. We describe various existing approaches on domain decomposition methods for total variation minimization in a unified view. We address how the direction of research on the subject has changed over the past few years, and suggest several interesting topics for further research.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.731-733
• /
• 1988

This paper describes a design of hardware system for real time automatic diagnosis of ECG arrhythmia based on pipeline processor consisting of the three microcomputer. ECG data is acquisited by 12 bit A/D converter with hardware QRS triggered detector. Four diagnostic parameters - heart rate, morphology, axis, and ST segment - are used for the classification and the diagnosis of arrhythmia. The functions of the main CPU were distributed and processed with three microcomputers. There-fore the effective data process and the real time process using microcomputer can be obtained. The interconnection structure consisting of two common memory units is designed to decrease the delay time caused by data transfer between processors and by which the delay time can be taken 1 % of one clock period.

• 한국기계연구소 소보
• /
• 통권19호
• /
• pp.93-115
• /
• 1989

Cerebellar Model Arithmetic Controller(CMAC) has been introduced as an adaptive control function generator. CMAC computes control functions referring to a distributed memory table storing functional values rather than by solving equations analytically or numerically. CMAC has a unique mapping structure as a coarse coding and supervisory delta-rule learning property. In this paper, learning aspects and a convergence of the CMAC were investigated. The efficient training algorithms were developed to overcome the limitations caused by the conventional maximum error correction training and to eliminate the accumulated learning error caused by a sequential node training. A nonlinear function generator and a motion generator for a two d. o. f. manipulator were simulated. The efficiency of the various learning algorithms was demonstrated through the cpu time used and the convergence of the rms and maximum errors accumulated during a learning process; A generalization property and a learning effect due to the various gains were simulated. A uniform quantizing method was applied to cope with various ranges of input variables efficiently.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 C
• /
• pp.1210-1212
• /
• 1998

The complexity of newly developed protection algorithm and higher performance requested by the user makes the software embedded in the protective relay much harder to develop and maintain. The versatility of 32bit microprocessor and the availability of cheaper memory semiconductors introduced the fertile developing background for the protective relay developers. The use of component object model(COM) in the software developing process enables the developer to write much complex code in the easy and safe way and to maintain the code easily, too. And the aid of the COM library, the distributed computing environment will be expected to appear by the use of the COM programming model in the protective relay firmware program.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.804-806
• /
• 1995

This paper discusses Self-organized Distributed Networks(SODN) as identifier of nonlinear dynamical systems. The structure of system identification employs series-parallel model. The identification procedure is based on a discrete-time formulation. The learning with the proposed SODN is fast and precise. Such properties arc caused from the local learning mechanism. Each local networks learns only data in a subregion. Large number of memory requirements and low generalization capability for the untrained region, which are drawbacks of conventional local network learning, are overcomed in the SODN. Through extensive simulation, SODN is shown to be effective for identification of nonlinear dynamical systems.

• ETRI Journal
• /
• 제38권5호
• /
• pp.896-902
• /
• 2016

Luby transform (LT) codes were the first practical rateless erasure codes proposed in the literature. The performances of these codes, which are iteratively decoded using belief propagation algorithms, depend on the degree distribution used to generate the coded symbols. The existence of degree-one coded symbols is essential for the starting and continuation of the decoding process. The absence of a degree-one coded symbol at any instant of an iterative decoding operation results in decoding failure. To alleviate this problem, we proposed a method used in the absence of a degree-one code symbol to overcome a stuck decoding operation and its continuation. The simulation results show that the proposed approach provides a better performance than a conventional LT code and memory-based robust soliton distributed LT code, as well as that of a Gaussian elimination assisted LT code, particularly for short data lengths.