• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.3
• /
• pp.69-75
• /
• 2011

In this paper, we propose an anycast event driven synchronization mechanism to reduce power overheads. Our proposed mechanism can reduce unnecessary polling operations on SHI(Snoop Hit Invalidate) or SHR(Snoop Hit Read) states. It prevents waisting bandwidth and reduces power overheads on polling operation. Also it decreases transition power of state change compared to broadcast model. Simulation results indicated that the proposed architecture had about 15.3% of power decrease compared to spin-lock model and about 4.7% of power decrease compared to broadcast model. Overall results indicated that proposed synchronization mechanism could increase power efficiency of multi-core system by reducing power overheads.

• Journal of the Institute of Convergence Signal Processing
• /
• v.19 no.4
• /
• pp.162-166
• /
• 2018

Companies that use automatic feeder systems use multiple feeders in close proximity to each other for mass production. Unlike when the feeder is used independently, it does not oscillate to a value that is set to offset or freeze due to symbiosis caused by asynchronous forces hitting each other. This may result in the shipment being damaged by hitting each other or thrown to one side, preventing the transport from being moved to the next process. Whenever an unstable resonance occurs, the operator must reset the value of each feed controller or operate it several times. To address these problems, this paper proposes synchronization algorithm suitable for feed controllers using multiple units and tests are used to confirm performance improvements.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2011.06a
• /
• pp.705-706
• /
• 2011

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.1
• /
• pp.80-88
• /
• 2001

The existed approaches to analyzing real-time schedulability take place exponential time and space complexity of this methods, since these uses a fixed priority scheduling and/or traverse all possible state spaces. This paper judges whether it is satisfied a given deadlines for real-time processes regarding a minimum execution time of process, periodic, deadline and a synchronizion time of processes by using the transaction rules of process algebra, and proposes a retrieval algorithm for unschedulable processes based on GUI environment. And we implement and evaluate the scheduling state analyzer that displays visually the result of schedulabiliy analysis for real-time processes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.10
• /
• pp.1117-1130
• /
• 1992

In this study, we propose a protocol for the communication between process groups required during message transfers. This is accomplished by an efficient process management of distributed systems connected by computer networks. For a single process group, a multicast protocol was proposed, which can control message flows while maintaining the order of messages sent or delivered. Through use of membership-related services, a member composing a process group may leave and join the current a membership anytime during execution. Moreover, message delivery can be delayed by using a logical vector time stamp. The functionality of the message delivery includes a virtual synchronization in response to a change in membership.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.1
• /
• pp.119-129
• /
• 1995

In this paper, we propose a schedulatility analysis method for real-time programs. Several approaches to anlayzing schedulability have been developed, but since these approaches use a fixed priority scheduling method and/or traverse all possible state spaces, there take place exponential time and space complexity of these methods, Therefore it is necessary to reduce the state space and detect schedulability at earlier time. Our schedulability analysis method uses a minimum unit time taken to terminate synchronization action, a minimum unit time taken to terminate actions after synchronization, and a deadline of processes to detect unschedulability at earlier time and dynamic scheduling scheme to reduce state space. We conclude that our method can detected unschedulability earlier 50 percent unit time than Fredette's method.

• Electronics and Telecommunications Trends
• /
• v.16 no.6 s.72
• /
• pp.153-162
• /
• 2001

우편업무는 물류의 생성, 수집 또는 접수, 구분, 운송, 배달 등의 과정으로 되어 있다. 이러한 업무를 효율적으로 수행하기 위해서는 각 단위 업무 프로세스간의 정보처리와 실물과의 동기화가 요구된다. 본 고에서는 우편물류 처리 단계에 있어서 RFID 기술의 활용사례를 살펴보고 국내 우편사업에 적용하기 위한 요구사항 분석과 추진방안에 관하여 고찰한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.556-559
• /
• 2004

본 논문은 제약이론의 프로세스 운영 개선기법에 기반하여 워크플로우에서 제약 자원을 찾고, 워크플로우의 운영 성과가 개선될 수 있도록 효율적인 업무 흐름 관리 방법을 개발하는 것을 목적으로 한다. 과거의 워크플로우 기록을 분석하여 제약업무담당자(CCP)를 결정하고, 제약 업무 담당자의 업무처리속도에 발생된 프로세스 인스턴스의 워크플로우 투입속도를 동기화하여 CCP의 업무부하가 일정수준으로 유지되도록 하며 비 제약 업무담당자의 여유능력이 향상되도록 한다. 이를 통해 CCP의 업무부하를 가능한 업무담당자들에 분산시킴으로써 프로세스 인스턴스의 처리가 원활히 이루어지도록 한다. 본 논문에서 개발한 알고리즘을 워크플로우 관리 시스템에 적용함으로써 전체 워크플로우가 효율적으로 운영되는 효과를 기대할 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.506-509
• /
• 2007

본 논문에서는 정보통신부와 정보통신연구진흥원에서 개발하여 구축한 e-DURE시스템(정보통신부 산하/유관기관용 표준업무관리시스템)의 설계와 구현시 반영된 정보교환 및 동기화 방안을 연구하여 구체적으로 기술하였다. 정부와 산하기관의 구조와 업무처리방식을 반영하여 시스템을 설계하였고, 축적되는 데이터의 실시간 공유를 위해 Web Services와 SOAP 프로토콜을 사용하여 정보를 교환하였다. 또한, 데이터의 정확성을 향상시키기 위해 유효성 검증 모듈을 설계/개발하였으며, 패키지 및 ASP시스템에서 포털시스템으로 전송하는 데이터의 오류를 찾아내어 필터링하고 동기화해 주는 방안을 구현하였다. 본 연구를 통하여, 기관간 공유하고자 하는 데이터가 실시간으로 유통되었으며 데이터의 정확성이 유지되어 업무 프로세스의 획기적인 개선이 이루어졌다.

• Proceedings of the Korea Database Society Conference
• /
• 2001.06a
• /
• pp.113-138
• /
• 2001

o 닷컴 사이트들의 e-CRM에 대한 관심은 매우 높음 - 88% 개념 이해, 53%는 이해도 높음 o e-CRM의 도입동기는 마케팅/고객지원이 주된 이유 - 87% 마케팅 효율화, 76% 고객지원강화 (중략)