• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.2
• /
• pp.73-78
• /
• 2023

The dining philosophers problem(DPP) is that five philosophers sit around a round table and eat spaghetti(or noodles) together, where they must have a pair of chopsticks(two) on both sides of them to eat, and if all philosophers have one chopstick on the right, no one can eat because the deadlock occurs. Deadlocks are a problem that frequently occur in parallel systems, and most current operating systems(OS) cannot prevent it. This paper proposes a silver bullet that causes no deadlock in an OS where all processors of 2≤n≤∞ have multiple parallel processing capabilities. The proposed method is a group round-robin method in which ⌊n/2⌋ odd processors form a group and perform simultaneously, and shift right to the next processor when execution ends. The proposed method is to perform two times for even processors, three times for odd processors per one round-robin. If the proposed method is performed n times, even-numbered processors perform n/2 times and odd-numbered processors perform (n-1)/2-times.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1313-1321
• /
• 1999

The two-phase locking protocol(2PL) is the most widely-used concurrency control mechanism for guaranteeing logical consistency of data in a database environment where a number of transactions perform concurrently. The problem inherent in the 2PL protocol is a deadlock, where a set of transactions holding some locks indefinitely wait an additional lock that is already held by other transactions in the set. The deadlock detector is a DBMS sub-component that examines periodically whether a system is in a deadlock state based on lock waiting information of transactions. The deadlock detector and transactions execute concurrently in a DBMS and read and/or write the lock waiting information simultaneously. Since the lock waiting information is a shared one, we need an efficient method guaranteeing its physical consistency by using mutual exclusion. The efficiency of the mutual exclusion method is crucial especially in a main memory DBMS with high performance since it seriously affects the performance of an entire system. In this paper, we propose a new method that effectively guarantees physical consistency of lock waiting information. Two primary goals of our method are to minimize the processing overhead and to maximize system concurrency.

• Journal of KIISE:Databases
• /
• v.27 no.4
• /
• pp.671-681
• /
• 2000

클라이언트-서버(Client-Server) 데이터베이스 환경에서 병목현상의 해결책으로 클라이언트캐시(Client cache)를 사용할 수 있다. 여러 클라이언트들이 같은 데이터베이스의 일부를 캐시한 복사본을 사용할 때, 다른 클라이언트들과 서버간에 일관성 유지를 보장해주어야 한다. 캐시의 일관성을 유지하기 위한 여러 가지 알고리즘들이 제안되어왔다. 그 중에서 O2PL(Optimistic Two Phase Locking) 기법은 동시성을 증가시킬 수 있는 주요 장점이 있다. 그러나 O2PL 알고리즘은 트랜잭션이 완료(commit) 연산을 요구하는 시점에서 접근한 캐시데이터의 일관성을 위한 작업이 시작되므로 최종적인 완료까지는 지연이 발생하게된다. 이때 다른 클라이언트에서 잠금 충돌(lock conflict)에 의해 전역 교착상태(global deadlock)가 발생한다면 블락(block)되어 지연되는 시간은 더욱 증가하게된다. 본 논문에서는 향상된 O2PL 기법으로 PN(Preemption by Notification)-O2PL 기법을 제안한다. 이 접근에서는 O2PL의 특성으로 얻을 수 있는 연산정보를 관련된 다른 트랜잭션에게 통지(notification)로 사용하고 제시한 조건에 해당할 경우 상대 자원을 바로 사용할 수 있게 한다. 이 조건은 대부분의 전역 교착 상태에 해당하는 두 트랜잭션간의 교착상태를 조기에 신속히 감지할 수 있게 하여 트랜잭션 완료의 지연을 감소시키게 한다. PN-O2PL 알고리즘이 기존의 O2PL기법보다 빠른 응답시간을 얻을 수 있음을 모의 실험을 통하여 보인다.

• Journal of The Korean Association of Information Education
• /
• v.2 no.2
• /
• pp.269-277
• /
• 1998

In most of the distributed deadlock detection algorithms using messages called probes, only a portion of the generated messages are effectively used, and hence the wasted probes cause heavy communication traffic. In this paper, a distributed deadlock detection algorithm is proposed which can efficiently detect deadlocks making use of those residue probes. Our algorithm is complete in the sense that they detect not only those deadlocks in which the initiator is involved as most other algorithms do, but all the other deadlocks that are present anywhere in a connected wait-for-graph. To detect all the deadlocks, the algorithms known to be most efficient require O(ne) messages, where e and n are the number of edges and nodes in the graph, respectively. The single execution of the presented algorithm can accomplish the same task with O(e) messages.

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

• Journal of Conservation Science
• /
• v.27 no.4
• /
• pp.403-414
• /
• 2011

This study is re-creational experiment of Goryeo gold-painted decoration based on the research of the gold remaining and gold painting technique on the two pieces of Goryeo gold-painted celadon and the three pieces of Chinese gold-painted porcelain on North Song period which ones have been owned by National Museum of Korea since 2007. For the observation of glue state and color developing ability, four kinds of agglutinative agent and gold powder were mixed over the porcelain sherds, then gradually fired from $100^{\circ}C$ to $1200^{\circ}C$. Visual effect and ideal temperature were measured. Among of them, oil and glue showed the best results in glue state and color developing ability. Through those results, the entire Goryeo engraved celadon were reproduced in modern facilities. Oil and glue were gold-painted over the glaze then it was fired at the ideal temperature 700 to $800^{\circ}C$. For observation the binding condition, the gold-painting cross section was looked by the scanning electron microscope (SEM). As the result, oil and glue did not make much difference in Agglutinative agent, but gold was good, the color developing ability, however, in the case of oil, the edge of gold is curled because of its interfacial tension, and it is not dried well at room temperature so the working property is not as good as the glue. Glue more effective in terms of work efficiency, but color developing ability to fall slightly in this experiment were able to see through.

• Journal of Navigation and Port Research
• /
• v.42 no.1
• /
• pp.47-56
• /
• 2018

In this study, the focus is on the issue of whether a container terminal is facing the limitation of its productivity for serving mega-vessels with numerous containers. In order to enhance the terminal operations, a new conceptual design of the container handling system have been proposed. This research focuses on the rail-based container transport system and its operations. This system consists of rail-based shuttle cranes and rail-based transporters called flatcars. The deadlock problem for managing automated transporters in container terminals has been an important issue for a long measurement of time. Therefore, this study defines the deadlock situation and proposes its avoidance rules at the rail-based container transport system, which is required to handle numerous container throughput operations. The deadlock in the rail-based container transport system is classified into two parts: deadlock between cranes and flatcars; deadlock between flatcars. We developed the simulation model for use with characterizing and analyzing the rail-based container transport system. By running the simulation, we derived possible deadlock situations, and propose the several deadlock avoidance algorithms to provide results for these identified situations. In the simulation experiments, the performances of the deadlock avoidance algorithms are compared according to the frequency of deadlocks as noted in the simulations.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.11 no.1
• /
• pp.37-46
• /
• 1993

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

무선 인터넷을 이용한 전자상거래가 증가함에 따라 모바일 환경에서 전자상거래를 보다 안전하고 효율적으로 사용할 수 있도록 SET/A (Secure Electronic Transaction Agent) 프로토콜이 제안되었다. 본 논문에서는 키 노출에 따른 보안 취약점을 분석이 아닌 프로토콜의 행위적 관점에서 SET/A를 정형 명세하고 무선망 접속 불량이나 에이전트 동작 실패와 같은 오류 상황에 의해 교착 상태에 빠지지 않는지 정형 검증하였다. 그 결과 SET/A가 교착 상태에 빠질 수 있음을 확인하였고 확장된 SET/A 프로토콜을 제안하고 검증하였다.

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