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

• The Journal of Korean Association of Computer Education
• /
• v.11 no.4
• /
• pp.71-83
• /
• 2008

The recent advances of the information technology have motivated lots of research efforts to develop new computer-aided teaching and learning methodologies on various computer science topics, such as data structures, operating system, computer networks, and computer architecture. However, there have been only few studies to educate the database subject although it is one of the most important topics in the computer science. Specifically, among the various issues in the database subject, a learner often suffers to understand the mechanism of the concurrency control and recovery of database transaction in the database because it highly interacts with other functions in the database. Obviously, an intelligent visualization tool can help a learner to understand the process of the concurrency control and the recovery of database transaction. The purpose of this study is to develop an efficient visualization tool which can help users understand the two phase locking protocol (2PLP)-based concurrency control. Specifically, this visualization tool is designed to encourage a users' participation and raise their interest by visualizing the process of transactions and allowing users to specify and manipulate their own transactions.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.1106-1120
• /
• 1997

In this paper,we prosent a new run-time support system for SR usitn POSIX threads (Pthreads),called SR/RTS +.SR supports a rich set of concurent programming techniques with multiple cincurrency control primit-ives Since the original RTS for SR uses its own thread management facility,it should be modifide to work on different computer systems.Furthermore,the run-time efficiency of the RTS should be considered in association with those different sytems.Thus,to portability and to guarantee the predictable run-time ef-ficiency,SR/RTS + is designed on the pthreads(POSIX Threads )which supports multiple threads of con-trol within a single POSIX process.Also, the SR compiler is modified to generate the codes appropriate for pthreads interface.SR/RTS + has been develped on Spare Workstation using pthreads library announced by Florida State University and tested with the SR verification suite distribute by the University of Arizona.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1418-1432
• /
• 1996

In addition t improved availability, replication of data can enhance performance of distributed real-time transaction processing system by allowing transactions initiated at multiple node to be processed concurrently. To satisfy both the consistency and real-time constraints, it is necessary to integrate concurrency control and atomic commitment protocols with time-driven scheduling methods. blocking caused by existing concurrency control protocols is incompatible with time-driven scheduling because they cannot schedule transactions to meet given deadlines. To maintain consistency of replicated data and to provide a high degree of schedulability and predictability , the proposed time-driven scheduling methods integrate optimistic concurrency control protocols that minimize the duration of blocking and produce the serialization by reflecting the priority transactions. The atomicity of transactions is maintained to ensure successful commitment in distributed environment. Specific time-driven scheduling techniqueare discussed, together with an analysis of the performance of this scheduling.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.575-578
• /
• 2000

소프트웨어 개발 초기 단계에서의 부정확에 기인한 에러들을 줄이기 위한 노력이나 기술이 절실하다. [1][2] 정형 명세 기법은 명세 단계에서 기인하는 에러들을 줄이기 위해 Z 나 VDM 과 같은 정형 표기법(formal notation)에 의해 쓰여지며, 정형성(formality)과 추상화(abstraction)의 제공 등 두 가지 사항에 대한 요구사항을 충족시켜 준다. [3][4] 그러나, Z 표기법의 병행성 표현 능력의 부족으로 병행성을 요구하는 시스템의 명세에서 사용할 수 없거나, Process Algebra의 CSP (Communicating Sequence Processes)등과 같은 다른 정형 언어와 함께 명세해야 하는 단점이 있다. 본 논문은 이를 보완하기 위해 범용 목적의 명세 언어인 기존의 Z 를 확장하여 병행성을 명세 가능하도록 하고자 한다. 이를 위해서 병행 프로세스(concurrent process) 개념을 도입하며, 이를 나타내는 표기를 정의하고 사용한다. 또한, 병행성의 제어를 위해서 프로시듀어 기술부(procedure description)의 도입 및 관련 스키마(schema)들을 정의한다. 아울러, 확장된 Z 로 작성된 명세서를 목적 언어로 자동 변환(translate)하기 위한 변환기(translator)를 Lex 와 Yacc을 이용하여 구현하고, 변환된 목적 언어 파일을 실행하여 확장된 Z 가 모호성을 포함하지 않는지 시뮬레이션을 통해 검증한다.