• Title/Summary/Keyword: 교착상태 방지

Search Result 9, Processing Time 0.028 seconds

Error Time Message Broadcast Method to Prevent Deadlock in Dynamic Reconfiguration Environment (동적 재구성 환경에서 교착상태를 예방하기 위한 오차 시간 메시지 브로드캐스트 기법 연구)

  • Shin, Hyun-Jun;Kim, Sung-Jin;Oh, Chang-Heon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.11
    • /
    • pp.2131-2136
    • /
    • 2016
  • Before Industry 4.0, a purpose of manufacturing processes is simply overcoming the weakness of product line. However, Industry 4.0 should determine its method of work of facilities' own accord. Manufacturing processes such as FMS, AMS, MAS have been developed in these procedures, but there are possibilities of deadlock that can be happened for the reason of machine, agent or resource sharing. There were many studies to solve this problem. However, studies about prevention of deadlock happened in the situation that manufacturing processes are reconfigured dinamically because of human's intervention are incomplete. This paper proposes the model of the situation reconfigured dinamically and the method to prevent the deadlock in this situation. The proposed method adjusts production and manufacturing time by broadcasting time error messages to machines around when the manufacturing time of machine intervened by human is changed. Through this, it is anticipated to prevent the deadlock if conditions of the product line are changed.

A Study about Finding Optimal Path Using HAS Dynamic Programming (RAS Dynamic Programming을 이용한 최적 경로 탐색에 관한 연구)

  • Kim, Jeong-Tae;Cho, Hyun-Chul;Lee, Kwon-Soon
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2007.12a
    • /
    • pp.226-227
    • /
    • 2007
  • Significant increase of container flows in marine terminals requires more efficient automatic port systems. This paper presents a novel routing and collision avoidance algorithm of linear motor based shuttle cars using random access sequence dynamic programming (RAS DP). The proposed RAS DP is accomplished online for determining optimal paths for each shuttle car.

  • PDF

Secured Verification of Intrusion Prevention System Security Model Based on CPNs (CPN 기반의 침입방지시스템 보안모델의 안정성 검증)

  • Lee, Moon-Goo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.3
    • /
    • pp.76-81
    • /
    • 2011
  • Intrusion prevention systems (IPS) are important solution about solved problems for inside system security or outsider attacks. When introduce this system, first consideration item is secured rather than multiple function. Colored Petri Nets (CPNs) used that in order to secured verification for user authentication function of intrusion prevention system security model. CPNs is a graphical modeling language suitable for modeling distributed, concurrent, deterministic or non-deterministic systems with synchronous. Like these CPNs was expressed every possible state and occurrence graph. Secured of IPS security model was verified because expression every state using CPN tool and as a result of analyzing the occurrence graph was without a loop or interruption.

A Policy to Find All Siphons using Transitive Matrix (추이적 행렬을 이용한 사이폰 감지 정책)

  • Kim, Oe-Yeong;Lee, Jong-Kun
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.4
    • /
    • pp.67-75
    • /
    • 2010
  • Deadlock usually appears in contain subsystem which is run in parallel and resources share modules. Siphons and traps have been well introduced to characterize deadlocks of Petri nets. Siphon concept be well used for proposing the detect and prevent deadlock by the pleasure researchers. But it's need many times and efforts to detect all siphon sub-nets in the Petri model. Since transitive matrix could explain all relations between the place and transitions in Petri nets, we propose an algorithm to detect all siphon sub-nets after analyzed the transitive matrix's properties. Examples are givens to illustrate the method.

Two-phase Multicast in Wormhole-switched Bidirectional Banyan Networks (웜홀 스위칭하는 양방향 베니언 망에서의 두 단계 멀티캐스트)

  • Kwon, Wi-Nam;Kwon, Bo-Seob;Park, Jae-Hyung;Yun, Hyeon-Su
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.3
    • /
    • pp.255-263
    • /
    • 2000
  • A multistage interconnection network is a suitable class of interconnection architecture for constructing large-scale multicomputers. Broadcast and multicast communication are fundamental in supporting collective communication operations such as reduction and barrier synchronization. In this paper, we propose a new multicast technique in wormhole-switched bidirectional multistage banyan networks for constructing large-scale multicomputers. To efficiently support broadcast and multicast with simple additional hardware without deadlock, we propose a two-phase multicast algorithm which takes only two transmissions to perform a broadcast and a multicast to an arbitrary number of desired destinations. We encode a header as a cube and adopt the most upper input link first scheme with periodic priority rotation as arbitration mechanism on contented output links. We coalesce the desired destination addresses into multiple number of cubes. And then, we evaluate the performance of the proposed algorithm by simulation. The proposed two-phase multicast algorithm makes a significant improvement in terms of latency. It is noticeable that the two-phase algorithm keeps broadcast latency as efficient as the multicast latency of fanout 2^m where m is the minimum integer satisfying $2^m{\geq} {\sqrt{N}}$ ( N is a network size).

  • PDF

Material Handling Automation Simulation Using Virtual AGV (가상 AGV를 이용한 물류자동화 시뮬레이션)

  • Kim, Tai-Who;Hong, Hyun-Ju;Kweon, Seok-Geon;Ro, Young-Shick
    • Proceedings of the KIEE Conference
    • /
    • 2003.07d
    • /
    • pp.2495-2497
    • /
    • 2003
  • 본 논문에서는 다수의 AGV를 이용한 물류자동화 시뮬레이션에 대해 연구하였다. 각각의 AGV가 독립적으로 명령을 수행하도록 가상의 AGV를 제안하고 이미 연구된 AGV의 주행경로 표현방법, 경로망 구성방법을 이용하였다. 작업요구시 주어진 작업을 가장 빨리 수행 할 수 있는 AGV를 선정하고 최적 경로 계획을 수행하였다. 그리고 작업을 수행 중인 AGV는 경로 합류점에서의 교착상태(dead lock)와 충돌이 발생할 수 있는데 이를 방지하기 위한 통제구역을 정의하고 교통제어를 수행하였다.

  • PDF

Request Two-Phase Locking Method for Series Sequence Re-adjustment of Concurrency Control in Multi-Level Secure DBMS (다단계 보안 데이터베이스 시스템에서 병행수행 제어의 직렬화 순서를 재조정하기 위한 요청 2단계 로킹기법)

  • Lee, Seungsoo;Cho, Jinsung;Jeong, Byungsoo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.05a
    • /
    • pp.105-108
    • /
    • 2004
  • 다단계 보안데이터베이스 시스템에서 기본적인 병행수행 제어 기법들은 비밀채널과 교착상태등과 같은 문제들이 발생하였다. 이에 직렬화 순서를 동적으로 재조정함으로서 해결하려는 방안이 있었지만, 알고리즘의 복잡성으로 인해 오버 헤드와 많은 수행시간이 필요하게 되었고, 이에 따라 많은 양의 시스템 자원과 높은 사양의 시스템을 요구하게 되었다. 또한 이러한 방법은 다중 버전을 사용함으로서 추가적인 관리비용이 높게 되었고, 각각의 트랜잭션이 지연 및 재수행이란 불필요한 과정을 반복하게 되었다. 따라서 본 논문에서는 제안한 알고리즘은 데이터베이스의 용도에 맞게 직렬화 순서를 보장하여 스케줄을 관리하는 요청 2단계 로킹기법(Request Two-phase Locking)으로서 이는 2단계 로킹기법의 기본원리에 요청로크를 사용함으로 보다 효율적으로 병행제어를 할 수 있다. 여기서 요청로크는 각각의 트랜잭션 스케줄에 로크획득 및 해제를 병행수행제어의 필요에 따라 유동적으로 할 수 있으며, 읽기로크, 쓰기로크, 요청로크라는 3가지 로킹모드를 통해 대처방안을 마련함으로서, 충돌을 방지하며, 충돌연산의 특성에 따라 직렬화 순서를 동적으로 조정함으로 블록킹을 막는 병행제어를 응용하여 병렬성을 유지한다.

  • PDF

Task-Sequencing Design for the FMC Transfer Robot Using Traveling Salesman Problem (외판원 문제(TSP)를 이용한 FMC 반송 로봇의 작업순서 설계)

  • Kim, Woo-Kyun;Lee, Hong-Chul
    • Proceedings of the KAIS Fall Conference
    • /
    • 2009.12a
    • /
    • pp.574-577
    • /
    • 2009
  • 본 논문은 외판원 문제(TSP: Traveling Salesman Problem)를 이용하여 로봇중심의 FMC(Flexible Manufacturing Cell)에서 반송 로봇의 작업순서를 설계하는 방법을 제시하였다. 이를 위해, 먼저 다수의 설비와 반송 로봇으로 구성된 대표적인 로봇 중심의 FMC를 가상으로 설계한 후, 실험계획법을 이용하여 다양한 조건에서의 주요 반응변수들의 인과관계를 규명하였다. 실험결과, 처리량, 반송로봇의가동률, 그리고 Buffer의 평균 대기 작업물의 수가 주요 반응변수들로 선정되었으며, 이를 기반으로 순서기반 조합최적화 문제인 TSP로 로봇 작업순서를 설계하였다. 제안한 방법과 기존의 방법을 비교하기 위해서 시뮬레이션을 수행 한 결과 제안된 TSP 방법이 기존의 방법 보다 반송 로봇의 교착 (Deadlock) 상태를 방지하여 처리량 등 주요 반응변수들 모두를 향상 시키는 결과를 가져왔다. 더불어,이 방법은 본 연구에서 제시한 FMC 뿐 아니라 반도체나 LCD(Liquid Crystal Display) 생산 공정과 같이 반송 로봇에 의해 구성되어 있는 장치 산업분야에 적용가능하다는 측면에서 큰 효과가 기대된다.

  • PDF

Development of Fast-Time Simulator for Aircraft Surface Operation (항공기 지상 이동 Fast-Time 시뮬레이터 개발)

  • Kim, Tae Young;Park, Bae-Seon;Lee, Hywonwoong;Lee, Hak-Tae
    • Journal of Advanced Navigation Technology
    • /
    • v.23 no.1
    • /
    • pp.1-7
    • /
    • 2019
  • Thisstudy presentsthe development of a fast-time airport surface simulator. The simulator usesthe output from a first-come first-served (FCFS) scheduler and has adopted one-dimensional dynamic model to simulate the movement of the aircraft on the surface. Higher collision risks situations in the airport surface traffic are analyzed to classify those situations into six cases. A conflict detection and resolution algorithm is implemented to maintain separation distance and to prevent deadlock. The simulator was tested with a scenario at the Incheon International Airport that contains 72 aircraft. Without the conflict detection and resolution, various conflict situations are identified. When the conflict detection and resolution algorithm is managing the traffic, it is confirmed that the conflicts are removed at the price of additional delays. In the conflict resolution algorithm, three prioritization strategies are implemented, and delayed aircraft count and average additional delays are compared. Prioritization based on remaining time or distance showed smaller total additional delay compared to choosing minimum delay priority for each situation.