• Title/Summary/Keyword: Deadlock free

Search Result 29, Processing Time 0.025 seconds

Differential Multicast in Switch-Based Irregular Topology Network (스위치 기반의 비정규적 네트워크에서의 차별적인 다중 전송)

  • Roh, Byoun-Kwon;Kim, Sung-Chun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.7
    • /
    • pp.394-400
    • /
    • 2002
  • Networks of Workstations(NOWs), that has features of flexibility and scalability, recently has emerged as an inexpensive alternative to massively parallel multicomputers. However it is not easier to perform deadlock-free multicast than regular topologies like mash or hypercube. Single phase differential multicast(SPDM) is a modified multicast algorithm with less burden of the root node. By applying quality of serviece(QoS), a specific node can have differentiated service and artificial change of message flow pattern is also available. As the results of performance evaluation experiments, SPDM has lower latency and lower packet concentration rate of the root node than the case of SPAM, and has ability to control network load distribution among switch nodes by controlling the assignment rate among nodes.

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

  • Choe, Ri;Park, Tae-Jin;Ryu, Kwang-Ryel
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.1
    • /
    • pp.387-392
    • /
    • 2006
  • In the environment where 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 the factor 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 time-driven simulation validated the effectiveness of the proposed methods.

  • PDF

A Token-based Mutual Exclusion Algorithm in Mobile Computing Environments (모바일 컴퓨팅 환경에서의 토큰기반 상호배제 알고리즘)

  • Yang, Seung-Il;Lee, Tae-Gyu;Park, Sung-Hoon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.3
    • /
    • pp.263-274
    • /
    • 2010
  • Mutual exclusion that applied on existing systems was designed for static distributed systems. but now computing environments are going to mobile computing environments. Therefore a mutual exclusion algorithm in static distributed environments should be designed for new computing environments. So this paper proposes a mobile mutual exclusion algorithm to support the mutual exclusion of shared resources in mobile computer environments. Mobile computing resources as wireless hosts cause new issues because of their mobility and weakness and made mutual exclusion problem more complex than stationary distributed environments. So we proposed a new mobile token mutual exclusion algorithm with deadlock-free and starvation-free in mobile computing environments based on spanning tree topology and extend for mobile computing environments. The proposed algorithm minimizes message complexity in case of free hopping in cellular networks.

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.

韓-歐FTA中与ILO相關條款紛爭及對中國的啓示

  • Go, Cheon-Cheon;Mun, Cheol-Ju
    • 중국학논총
    • /
    • no.72
    • /
    • pp.101-122
    • /
    • 2021
  • Over the past 20 years, labor standards have been widely used in free trade agreements. The U.S., the European Union and China have all aggressively signed free trade agreements with their trading partners, developing different styles on labor standards. According to the study, the implementation of the KOREa-EU FREE trade agreement has been hampered by ongoing disputes over the terms of the FREE trade agreement and the ILO since the korea-EU free trade agreement was signed. Because in order to break this deadlock, relevant scholars have done a lot of research, but mainly focused on the economic and trade field. Therefore, this paper for the first time systematically studies the substantive focus of disputes over FTA and ILO clauses, and carefully analyzes the domestic law amended by South Korea, and provides suggestions and inspirations for China by drawing lessons from the revision model of South Korea's domestic law. This is from a newperspective: the essence of the korea-EU FTA and ILO disputes is the conflict between international law and domestic law, and the conflict between free trade agreements and human rights protection. It holds that the essence of disputes should be sorted out from the perspective of legal principles and human rights protection, and the free trade and human rights protection should be actively coordinated. In order to make China more actively integrate into the international economy, China should adopt a positive attitude to revise and perfect its own laws, so as to realize the purpose of common development of international trade and human rights protection.

Petri Net Modeling and Analysis for Periodic Job Shops with Blocking

  • Lee, Tae-Eog;Song, Ju-Seog
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.314-314
    • /
    • 1996
  • We investigate the scheduling problem for periodic job shops with blocking. We develop Petri net models for periodic job shops with finite buffers. A buffer control method would allow the jobs to enter the input buffer of the next machine in the order for which they are completed. We discuss difficulties in using such a random order buffer control method and random access buffers. We thus propose an alternative buffer control policy that restricts the jobs to enter the input buffer of the next machine in a predetermined order. The buffer control method simplifies job flows and control systems. Further, it requires only a cost-effective simple sequential buffer. We show that the periodic scheduling model with finite buffers using the buffer control policy can be transformed into an equivalent periodic scheduling model with no buffer, which is modeled as a timed marked graph. We characterize the structural properties for deadlock detection. Finally, we develop a mixed integer programming model for the no buffer problem that finds a deadlock-free optimal sequence that minimizes the cycle time.

  • PDF

A Hybrid Concurrency Control without Deadlock based on Reordering (재배열 기반의 교착상태 없는 혼성 병행실행제어)

  • Cho, Sung-Ho
    • Journal of Internet Computing and Services
    • /
    • v.7 no.6
    • /
    • pp.79-86
    • /
    • 2006
  • Many of concurrency control for client-sewer database systems have been proposed and studied in the literature. However, commonly known schemes do not manage to the case of dramatic changes in data contention because the data contention of database systems is changed for each cases. In this paper, we propose o hybrid concurrency control. The proposed scheme uses a optimistic scheme for the first-run transactions and a pessimistic scheme for the second-run transactions. By pre-claiming locks in the second phase, deadlocks which ore possible in pessimistic based concurrency control are prevented in our approach. In addition, the scheme ensures at most one re-execution even if the validation in the optimistic phase fails. By a detailed simulation, this paper examines the behaviors of the Distributed Optimistic Concurrency Control and the proposed scheme. The simulation study shows our scheme outperforms Distributed Optimistic Concurrency Control in our experimental result.

  • PDF

A Deadlock Free Router Design for Network-on-Chip Architecture (NOC 구조용 교착상태 없는 라우터 설계)

  • Agarwal, Ankur;Mustafa, Mehmet;Shiuku, Ravi;Pandya, A.S.;Lho, Young-Ugh
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.4
    • /
    • pp.696-706
    • /
    • 2007
  • Multiprocessor system on chip (MPSoC) platform has set a new innovative trend for the System on Chip (SoC) design. With the rapidly approaching billion transistors era, some of the main problem in deep sub-micron technologies characterized by gate lengths in the range of 60-90 nm will arise from non scalable wire delays, errors in signal integrity and un-synchronized communication. These problems may be addressed by the use of Network on Chip (NOC) architecture for future SoC. Most future SoCs will use network architecture and a packet based communication protocol for on chip communication. This paper presents an adaptive wormhole routing with proactive turn prohibition to guarantee deadlock free on chip communication for NOC architecture. It shows a simple muting architecture with five full-duplex, flit-wide communication channels. We provide simulation results for message latency and compare results with those of dimension ordered techniques operating at the same link rates.

Supervisory controller design technique for multiple-AGV systems (다수 무인운반차 시스템을 위한 관리제어기 설계 기법)

  • Lee, J. H.;Choi, M. H.;Lee, B.H.;Kim, J. D.;Park, H.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • pp.82-87
    • /
    • 1993
  • A supervisory controller design technique for multiple-AGV systems is presented in this paper. The guidepath is represented in the form of a network, and its modifications are easily tested. The network has two-layered structure, where the path sets between each two nodes are made in advance using the K-shortest path algorithm. Occupation times for all links are stored in link-occupation table, and are updated after the dispatching time. Dispatching and scheduling for each AGV are optimized in terms of minimum-time objectives. In all times, the paths are guaranteed to be conflict-free and deadlock-free. The simplicity and flexibility on this control scheme make the supervisory suitable for real applications.

  • PDF

Mycelial response and ligninolytic enzyme production during interspecific interaction of wood-rotting fungi

  • Lee, Kab-Yeon;Park, Seur-Kee;Park, In-Hyeop;Kim, Joon-Sun;Park, Moon-Su;Jung, Hyun-Chae
    • Journal of Mushroom
    • /
    • v.15 no.4
    • /
    • pp.168-177
    • /
    • 2017
  • To evaluate effects of ligninolytic enzyme type on the mycelial response and ligninolytic enzyme production during interspecific interactions among wood-rotting fungi, 4 fungal strains, Trichophyton rubrum LKY-7, Trichophyton rubrum LSK-27, Pycnoporus cinnabarinus, and Trichoderma viride, were selected. Regarding ligninolytic enzyme production, LKY-7 secreted laccase and manganese peroxidase (MnP), P. cinnabarinus secreted only laccase, and LSK-27 secreted only MnP in glucose-peptone medium, while T. viride did not produce any ligninolytic enzymes. In the co-culture of LKY-7 with P. cinnabarinus, the formation of aerial mycelium was observed and the enhancement of laccase activity owing to interspecific interaction appeared to be very low. In the co-culture of LKY-7 and P. cinnabarinus with LSK-27, a hypha-free clear zone was observed, which resulted in deadlock, and increased laccase or MnP activity was detected at the interaction zone. The interaction responses of LKY-7, P. cinnabarinus, and LSK-27 with T. viride were characterized by the formation of mycelial barrages along the interface. As mycelial barrages were observed at the T. viride territory and no brownish pigment was observed in the mycelial barrages, it is suggested that laccase and MnP are released as part of an offensive response, not as a defensive response. The co-culture of P. cinnabarinus with T. viride lead to the highest enhancement in laccase activity, yielding more than 14-fold increase in laccase activity with respect to the mono-culture of P. cinnabarinus. MnP activities secreted by LKY-7 or LSK-27 was generally low in interspecific interactions.