• Journal of rehabilitation welfare engineering & assistive technology
• /
• v.5 no.1
• /
• pp.111-115
• /
• 2011

In this paper, we present a novel time-synchronization method for distributed systems to measure the body motion. The distributed system scheme is considered because human data acquisition systems tend to have a centralized controller with sensors connected with a long range of electric wires running through the subject's body, which results in inconvenience. Utilizing simple key switches and digital input ports for reading the key, the proposed method requires a very simple hardware structure, which means less power consumption compared with the well-known ubiquitous sensor network. After measuring the motion data as well as the synchronization pulses, the proposed method compensates, in offline, the difference of the sampling instance between the two systems by scaling the time difference. The paper presents experimental results to show the validity of the proposed method.

• Journal of Korea Game Society
• /
• v.5 no.4
• /
• pp.33-38
• /
• 2005

In the online game that thousands of participants connect to a game world by using Internet simultaneously, participants of the game world may have different hardwares and network environments, and messages of participants should be synchronization. A solution for the synchronization problem is to wait for a certain amount of time until the server processes the message. It is not easy to determine a suitable waiting period because of the trade-off between the fairness and the responsiveness. In this paper we propose a method to decide a waiting period by considering features of the MMOFPS game and the probability of interaction among participants. We implement the proposed method and perform experiments for the performance evaluation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.347-354
• /
• 2011

This paper presents a time-domain based asynchronous IR-UWB ranging system. This system accomplishes the ranging by detecting peaks from the outputs of a correlator implemented by a FIR filter. To discriminate the peaks due to a signal component, we use windowing for the correlated data within which the data are sorted in amplitude-ascending order and the noise level is calculated. Comparing with the recently presented frequency-domain based ranging system, we show the system structure and explain how it operates for ranging. Moreover, through the simulations, the proposed system is compared with the frequency-domain based system in terms of performance.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.9
• /
• pp.461-468
• /
• 2001

Though shared virtual memory (SVM) system promise low cost solutions for high performance computing they suffer from long memory latencies. These latencies are usually caused by repetitive invalidations on shared data. Since shared data are accessed through synchronization and the patterns by which threads synchronizes are repetitive, a prefetching scheme bases on such repetitiveness would reduce memory latencies. Based on this observation, we propose a prefetching technique which predicts future access behavior by analyzing access history per synchronization variable. Our technique was evaluated on an 8-node SVM system using the SPLASH-2 benchmark. The results show the our technique could achieve 34%~45% reduction in memory access latencies.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.2
• /
• pp.141-146
• /
• 2016

This paper presents a method to improve time interval error for asynchronous communication systems. The proposed method is designed and simulated with multi-phase VCO, interpolator, phase selector, up-down counter, comparator and adder. The simulation results for CAN communication system show that the maximum time interval error can be tightly managed for satisfying the required specification. The proposed frequency modulation method can be properly used for asynchronous communication systems requiring high reliability.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.163-165
• /
• 2002

실시간으로 상호 작용하는 어플리케이션에서 성능을 유지하면서 모든 참가자들에게 동일한 뷰를 보여주는 것이 중요하다. 동일한 뷰를 제공하기 위해 사용하는 기법 중 하나로, 참가자들은 받은 이벤트를 실행 시각까지 버퍼에 저장하고 모든 참가자들이 동시에 이벤트를 실행한다. 그러나 네트웍상에서 전송 지연 시간 때문에 실행 예정 시각이 지나서 수신된 이벤트 들은 손실된 이벤트로 처리되어 참가자들 간의 일치하지 않는 뷰를 초래하며 손실된 이벤트를 복구하기 위한 오버헤드가 추가적으로 필요하게 된다. 본 논문에서 제안한 동기화기법은 네트웍 트래픽 상태에 따라 재생 지연 시간을 동적으로 정함으로써 네트웍 트래픽이 감소하여 전송 지연 시간이 짧을 경우, 작은 재생 지연 시간을 적용하여 상호 작용 성능을 높여주고 네트웍상에 트래픽이 증가하는 경우에는 재생 지연 시간을 늘림으로 상호 작용 성능을 해치지 않는 범위에서 이벤트 손실율을 줄이고자 한다. 실험을 통해 이 기법이 효과적으로 작동하는지 알아본다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.7
• /
• pp.624-628
• /
• 2008

This paper is concerned with multiple motor control using a distributed network control method. Speed and position of multiple motors are synchronized using clock synchronized distributed controllers. CAN (controller area network) is used and a new clock synchronization algorithm is proposed and implemented. To verify the proposed control algorithm, two disks which are attached on two motor shafts are controlled to rotate at the same speed and phase angle with the same time base using network clocks.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.575-582
• /
• 2000

Because FIFO thread scheduling used in the existing multithreaded models does not consider locality in programs, it may result in the decrease of the performance of execution, caused by the frequent context switching overhead and delay of execution of relatively short frames. Quantum unit scheduling enhances the performance a little, but it still has the problems such as the decrease in the processor utilization and the longer delay due to its heavy dependency on the priority of the quantum units. In this paper, we propose shortest-frame-first(SFF) thread scheduling algorithm. Our algorithm selects and schedules the frame that is expected to take the shortest execution time using thread size and synchronization information analyzed at compile-time. We can estimate the relative execution time of each frame at compile-time. Using SFF thread scheduling algorithm on the multithreaded models, we can expect the faster execution, better utilization of the processor, increased throughput and short waiting time compared to FIFO scheduling.

• Proceedings of the KIEE Conference
• /
• 2008.04a
• /
• pp.69-70
• /
• 2008

통합 항법 시스템 구현시 각 센서 측정치의 동기를 맞추어 칼만 필터의 상태변호를 갱신을 해야 하지만, 상용 센서를 사용 할 경우 각 센서 측정치의 출력 동기를 맞추기 어려울 뿐만 아니라, 통합 항법 컴퓨터까지의 전송 과정에서 지연시간이 생기므로 특히 고기동 항체에서는 센서측정치 비동기로 인하여 항법 성능이 저하가 커진다. 본 논문에서는 GPS/INS/Magnetic compass 통합 항번 시스템의 동기 방법을 제안한다. 이 방법은 센서 하드웨어의 변경이 필요 없이 동기를 맞출 수 있어 상용 센서를 사용하여 항법 시스템을 개발할 때 유용하게 사용 할 수 있다. 이 방법의 성능을 검증하기 위해 고속 항체의 시나리오 구성하고 모의실험을 통해 유효성을 확인 할 수 있었다.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.12a
• /
• pp.595-599
• /
• 1999

본 논문에서는 카오스 현상을 나타내는 수식을 변형하여 암호시스템이나 PN(pseudo-noise)시퀸스에 적용하기 위하여 복잡한 카오스 신호를 발생시키는 하이퍼카오스 VP 사상(HVPM, Hyper chaos Volume Preserving Maps)과 이들간의 카오스 동기화를 제안한다. 단계별 모듈러(modulus) 함수를 이용하여 랜덤한 카오스 신호를 발생시키기 위하여 이산시간(discrete-time) HVPM 모델을 설정하고, 수치해석 실험으로 아날로그 카오틱시퀸스(CAS. chaotic analog sequence)의 특징을 분석한다. 그리고 HVPM의 신호를 기존의 단순한 PC(Pecora, Carroll)방법을 응용한 치환동기화 (synchronous substitution)를 이용하여 구동 및 응답시스템간의 카오스 동기화(chaos synchronization) 제어를 한다. 수치실험에서 카오스 신호가 갖는 특징들을 확인할 수 있었으며, 치환동기시스템에서 효과적인 카오스 동기화가 수행됨을 증명할 수 있었다.