• Title/Summary/Keyword: deadlock

Search Result 178, Processing Time 0.021 seconds

A Novel Globally Adaptive Load-Balanced Routing Algorithm for Torus Interconnection Networks

  • Wang, Hong;Xu, Du;Li, Lemin
    • ETRI Journal
    • /
    • v.29 no.3
    • /
    • pp.405-407
    • /
    • 2007
  • A globally adaptive load-balanced routing algorithm for torus interconnection networks is proposed. Unlike previously published algorithms, this algorithm employs a new scheme based on collision detection to handle deadlock, and has higher routing adaptability than previous algorithms. Simulation results show that our algorithm outperforms previous algorithms by 16% on benign traffic patterns, and by 10% to 21% on adversarial traffic patterns.

  • PDF

An Efficient Search Algorithm for Flexible Manufacturing Systems (FMS) Scheduling Problem with Finite Capacity (유한용량 Flexible Manufacturing Systems(FMS) 스케줄링 문제에 대한 효율적인 탐색 알고리즘 연구)

  • Kim, Hwang-Ho;Choi, Jin-Young
    • IE interfaces
    • /
    • v.22 no.1
    • /
    • pp.10-16
    • /
    • 2009
  • In this paper, we propose an efficient search algorithm for finding an optimal schedule to minimize makespan, while avoiding deadlock situation in Flexible Manufacturing Systems (FMS) with finite capacity, in which each job needs to be processed in several job stages for completion. The proposed algorithm uses a modeling and control method based on Petri-net. Especially, we improve the efficiency of the search algorithm by using a priority rule and an efficient bounding function during the search procedure. The performance of the proposed algorithm is evaluated through a numerical experiment, showing that it holds considerable promise for providing an optimal solution efficiently comparing to past work.

Linear Planner for the Elementary Blocks World (기본적 블럭세계를 위한 선형계획자)

  • Sim, Dong-Hui
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.1
    • /
    • pp.161-166
    • /
    • 1997
  • The blocks world is the primary problem domain in the artificial intelligence. Many planners have been developed in domain-independent. Gupta de fined the deadlock in the blocks world, and he proved that decision making in t he blocks world is NP-Complete problem. In this paper the properties of the dea dlock are analyzed, and a heuristic algorithms which can handle the deadlock of the Gupta's nondeterministic algorithm is proposed.

  • PDF

A Study on the Footholds Selection for Quadruped Walking Vehicle (4족 보행 로봇의 착지점 선정에 관한 연구)

  • 정경민;박윤창
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2000.11a
    • /
    • pp.7-10
    • /
    • 2000
  • Inadequate footholds selection may result in deadlock state where the walking vehicle can not anymore to the desired direction. This paper concerns about the footholds selection for quadruped v, vehicle to walk with the leg lifting sequence of crawl gait which is desired for straight motion. supporting states for lifting a leg are defined and the proper supporting condition for quadruped c: also proposed. When selecting a footholds of swing leg within the proposed footholds searching are; supporting states after the swing legs are placed, satisfy the proper supporting condition. So it can I for quadruped to execute continuous walking with the lifting sequence of crawl gait.

  • PDF

Development of a Petri-net-based Simulation Software for Performance Evaluation of the System with Blocking and Deadlock (봉쇄와 교착이 존재하는 시스템의 성능분석을 위한 페트리-네트 기반 모의실험 소프트웨어 개발)

  • 박찬우;황상철;이효성
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.1
    • /
    • pp.67-81
    • /
    • 2000
  • In this paper, a new software package for modeling and simulating discrete-event dynamic systems is developed. The new software is a general-purpose, graphical tool based on timed Petri-nets and is developed using Visual Basic and Visual C++ for the window environment. It allows the user to graphically build a Petri-net model and enter input data for executing the Petri-net simulation model. It is equipped with a deadlock detection and recovery function as well as an automatic error check function. In addition, the software supports various enabling functions and distribution functions and provides various statistics for the performance measures of interests pertaining to the system. We expect the new software will be used in a wide number of applications including computer, communication and manufacturing systems.

  • PDF

An Efficient Apeliodic Static Walking Algorithm for Quadrupecl Walking Machine (4족 보행 로봇의 효율적인 비주기 정적 보행 알고리즘)

  • 정경민;박윤창
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.42-42
    • /
    • 2000
  • This paper concerns an efficient aperiodic static crab walking algorithm for quadruped walking machine in rough terrain. In this algorithm, the requirements for forward stability margin and backward stability margin could be given differently in order to consider the slope of terrain and disturbances resulting from moving velocity. To restrict the searing regions for motion variables, such as moving distances until a leg is lifted or is placed, the standard leg transferring sequence is decided to be that of wave gaits. standard support pattern is also proposed that enables the quadruped to continue forward motion using the standard leg transferring sequence without falling into deadlock.

  • PDF

Job Deployment and Dynamic Routing for Container-AGVs (컨테이너용 AGV의 작업할당과 동적 경로계획)

  • So Myung-Ok;Lee Hyun-Sik;Jin Gang-Gyoo
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.29 no.4
    • /
    • pp.369-376
    • /
    • 2005
  • In recent years, AGVs(Automated Guided Vehicles) have received growing attention as a subsystem of the integrated container operating system which enables unmanned control. improvement of job reliability, accuracy and productivity. Therefore, a number of works have been done to enhance the performance AGVs. In this paper. job deployment and a dynamic routing control system composed of supervisor, traffic controller. motion controller and routing table are discussed. A simple job deployment scheme and an efficient dynamic routing algorithm incorporating with the deadlock prediction and avoidance algorithm are investigated.

Improving Performance of HPC Clusters by Including Non-Dedicated Nodes on a LAN (LAN상의 비전용 노드를 포함한 HPC 클러스터의 확장에 의한 성능 향상)

  • Park, Pil-Seong
    • Journal of Information Technology Services
    • /
    • v.7 no.4
    • /
    • pp.209-219
    • /
    • 2008
  • Recently the number of Internet firms providing useful information like weather forecast data is growing. However most of such information is not prepared in accordance with customers' demand, resulting in relatively low customer satisfaction. To upgrade the service quality, it is recommended to devise a system for customers to get involved in the process of service production, which normally requires a huge investment on supporting computer systems like clusters. In this paper, as a way to cut down the budget for computer systems but to improve the performance, we extend the HPC cluster system to include other Internet servers working independently on the same LAN, to make use of their idle times. We also deal with some issues resulting from the extension, like the security problem and a possible deadlock caused by overload on some non-dedicated nodes. At the end, we apply the technique in the solution of some 2D grid problem.

A Deadlock Avoidance Method for Concurrent Part Flows in Flexible Manufacturing Cell

  • Chang-Ouk Kim;Kyung-Sik Kang
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.19 no.39
    • /
    • pp.193-204
    • /
    • 1996
  • 본 연구는 FMC(Flexible Manufacturing Cell)에 있어 상호 간섭이 없는 부품의 흐름을 제어하기 위한 교착제거방법(Deadlock Avoidance Method)에 대한 제안으로서, 이 방법이 주요한 장점은 첫째, FMC의 환경을 쉽게 적용시킬 수 있고 둘째, 공정상의 부품에 대한 dispatching 모듈이 협력하도록 설계되어 있다는 것이다. 교착제거방법은 두 개의 모듈로 구성되어 있는데 이는 순환발견알고리즘(A Cycle Detection Algorithm)과 원료주문 정책으로서, 특이할 만한 사항은 순환발견알고리즘을 채용하더라도 원료주문정책이 잘못될 수 있기 때문에 교착제거방법에 있어서 원료주문정책은 매우 중요하다는 것이다. 이를 위하여 교착전의 N-step 교착을 제거하고, 발견할 수 있는 교착제거방법과 N-step의 사전주무정책을 제시하였다.

  • PDF

Deadlock-free Routing of an AGV in Accelerated Motion (가감속을 고려한 교착없는 AGV 주행경로설정)

  • Choe, Ri;Park, Tae-Jin;Ryu, Kwang-Ryel
    • Journal of Navigation and Port Research
    • /
    • v.30 no.10 s.116
    • /
    • pp.855-860
    • /
    • 2006
  • In the environment where multiple AGVs(Automated Guided Vehicles) operate concurrently in limited space, collisions, deadlocks, and livelocks which have negative effect on the productivity of AGVs occure more frequently. The accelerated motion of an AGV is also one of the factors that make the AGV routing more difficult because the accelerated motion makes it difficult to estimate the vehicle's exact travel time. In this study, we propose methods of avoiding collisions, deadlocks, and livelocks using OAR(Occupancy Area Reservation) table, and selecting best route by estimating the travel time of an AGV in accelerated motion. A set of time-driven simulation works validated the effectiveness of the proposed methods.