• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.115-122
• /
• 2004

Software system modeling has a goal for finding and solving system's problems by describing and analyzing system model in formal notations. Petri nets, as graphical formalism, have been used in describing and analyzing the software systems such as parallel systems, real-time system, and protocols. In the analysis of Petri nets, general system properties such as deadlock and liveness are analyzed by the reachability analysis. On the other side, specific properties such as functional requirements and constraints are checked by model-checking. However, since these analysis methods are based on enumeration of ail possible states, there nay be state explosion problem, which means that system states exponentially increase as the size of system is larger. In this paper, we propose a new method for mechanically checking system properties with avoiding state explosion problem. At first, system properties are described in property nets then the system model and the property net are composed and analyzed. In the compositional analysis, system parts irrelevant to the specific property are reduced to minimize the analysis domain of the system. And it is possible to mechanically check whether a specific property is satisfied or not.

• 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.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.72-79
• /
• 2011

The importance of parallel programming seriously emerges ever since the modern microprocessor architecture has been shifted to the multi-core system. Transactional Memory has been proposed to address synchronization which is usually implemented by using locks. However, the lock based synchronization method reduces the parallelism and has the possibility of causing deadlock. In this paper, we propose an efficient method to utilize transactional memory for the situation which has high contention. The proposed idea is based on the theoretical analysis and it is verified with simulation results. The simulation environment has been implemented using HTM(Hardware Transactional Memory) systems. We also propose a model of the dining philosopher problem to discuss the efficient resource management using the transactional memory technique.

• 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.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.502-512
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.500-500
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of the Korean Wood Science and Technology
• /
• v.33 no.2 s.130
• /
• pp.65-71
• /
• 2005

This study was performed to understand the interaction between Ophiostomataceae and basidiomycetes fungi during cultures, and whether the basidiomycetes fungi inhibit the growth and decolorize dark pigments of blue staining fungi. The conjoint cultivation was studied on 2% malt extract agar. The ability of basidial cultures to decolorize dark pigments of ophiostomatoid fungi was the main characteristics estimated during this study. More than half of basidial cultures were characterized by deadlock interaction with blue staining fungi. In the dual cultures, where basidial partners were presented by Agaricus bisporus(64), Laetiporus sulphureus(L01/89), Trametes versicolor(09) and unknown fungus(02), antagonism was found at the phase of primary contact of colonies. Replacement interaction resulted usually in decreasing dark colour of substrate was observed for 11 basidial cultures that were belonging mainly to white-rot fungi. Among them Abortiporus biennis(123), Antrodiella hoehnelii(S28/91), Bjerkandera fumosa (137), and Gleophyllum odoratum(124) were characterized by the absence of deadlock-phase: they began to grow over dark colonies of their partners just after primary contact. Basidiomycetes did not affect strongly the pigments of Ceratocystis spp. and Leptographium sibirica isolates, but completely decolorized colonies of Ophiostoma ips and to a smaller degree Ophiostoma minus. Antrodiella hoehnelii(S28/91), Bjerkandera fumosa(137), Gleophyllum odoratum(124) and Trametes versicolor(B18/91) cultures were found to be the most active in decreasing dark color of blue staining fungi colonies. The cultures were recommended for further development as agents of biopulping of wood chips and bio-control of blue stain in woods.

• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.922-924
• /
• 2005

실시간 시스템의 개발 및 운영에 사용되는 실시간 운영체제는 여러 개의 태스크가 동시에 작업할 수 있는 멀티태스킹 환경과 각 태스크에 우선순위를 부여하여 가장 높은 우선순위의 태스크가 CPU 를 선점하는 스케줄링 방법, 그리고 태스크간 동기화 및 통신을 위한 메커니즘을 제공하고 있다. 또한 여러 태스크들에 의해 사용되는 공유자원을 관리하기 위해 세마포어(Semaphore)를 사용하여 태스크간 동기화를 제공한다. 그러나 하나의 태스크가 세마포어를 이용하여 공유자원에 대해 여러 번 접근 할 경우, 데드락(Deadlock)을 일으킬 소지가 많다. 본 논문에서는 실시간 운영체제인 $iRTOS^{TM}$ 에서 데드락을 방지하기 위한 재귀적 세마포어(Recursive Semaphore)를 설계 및 구현하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.597-599
• /
• 1998

기존의 공중전기통신망들이 B-ISDN으로 통합, 발전되어 가는 과정에서 경제성 및 효율성 등의 이유로 인해 필연적으로 기존망과 새로 구현하는 망 사이의 연동과정이 필요하게 되며 가능한 기존망의 기능을 수용하면서 구현될 수 있는 방안이 마련되어야한다. 본 논문에서는 B-ISDN과 Internet의 망간 프로토콜인 B-ISUP와 TCP/IP의 연동 프로토콜을 설계하고 연동 프로토콜을 검증하기 위해 페트리네트(petrinet)의 확장인 프레디키디(predicate)/액션(action) 네트를 이용하여 모델링하였다. 또한 동작성 확인을 위해 도달트리(reachability tree)를 이용하여 설계한 프로토콜이 교착상태(deadlock)없이 정상적으로 수행됨을 보였다.