• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.45 no.1
• /
• pp.100-112
• /
• 1996

This paper presents a design experience of a control language for coordination of a multi-robot system. To effectively program job commands, a Petrinet-type Graphical Robot Language(PGRL) is proposed, where some functions, such as concurrency and synchronization, for coordination among tasks can be easily programmed.In our system, the proposed task commands of PGRL are implemented by employing formal model languages, which are composed of three modules, sensory, data handling, and action module. It is expected that by using our proposed PGRL and formal languages, one can easily describe a job or task, and hence can effectively operate a complex real-time and concurrent system. The control system is being implemented by using VME-based 32-bit microprocessor boards for supervisory, each module controller(arm, hand, leg, sensor data processing module) and a real time multi-tasking operating system(VxWorks). (author). 17 refs., 16 figs., 2 tabs.

• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.230-245
• /
• 2002

Database systems for real-time applications must satisfy timing constraints associated with transactions. Typically, a timing constraint is expressed in the form of a deadline and is represented as a priority to be used by schedulers. Recently, security has become another important issue in many real-time applications. In many systems, sensitive information is shared by multiple users with different levees of security clearance. As more advanced database systems are being used in applications that need to support timeliness while managing sensitive information, there is an urgent need to develop concurrency control protocols in transaction management that satisfy both timing and security requirements. In this paper, we propose two concurrence control protocols that ensure both security and real-time requirements. The proposed protocols are primarily based on multiversion locking. However, in order to satisfy timing constraint and security requirements, a new method, called the FREEZE, is proposed. In addition, we show that our protocols work correctly and they provide a higher degree of concurrency than existing multiversion protocols. We Present several examples to illustrate the behavior of our protocols, along with performance comparisons with other protocols. The simulation results show that the proposed protocols can achieve significant performance improvement.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.205-207
• /
• 1998

ECA 규칙에 근거한 능동성 개념은 실시간 데이터베이스에서 중요한 연구 분야이다. 기존에 연구된 실시간 동시성 제어 기법들은 능동성 개념을 지원하지 않기 때문에 실시간 능동 데이터베이스를 위한 동시성 제어 기법을 제안한다. 기존에 제안된 실시간 다중버전 동시성 제어 기법을 능동 데이터베이스에 적용하여 시간 제약과 능동 규칙을 동시에 만족하도록 고안하였다. 특히, 본 연구에서 제안한 동시성 제어 기법은 ECA 규칙에 의해서 실행된 트랜잭션들 사이의 선행관계와 능동관계를 연관시켜 데이터베이스의 일관성을 유지한다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2783-2796
• /
• 2000

In electronic commerce systems, for the purchase of package goods to be processed in realtime, the stock of their components has to be

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.6
• /
• pp.963-971
• /
• 1990

This paper proposes a memory intensive VLSI architecture for the realization of real-time 3x3 neighborhood processor based on the distributed arithmetic. The proposed architecture is characterized by a bit serial and multi-kernel parallel processing which exploits the pixel kernel parallelism and concurrency. The chip implements 8 neighborhood processing elements in parallel with efficirnt input and output modules which operate concurrently. Besides the a4chitectural design of a neighborhood processor, the design methodology using module generator concept has been considered and MOGOT(MOdule Generator Oriented VLSI design Tool) has been constructed based on the workstation. Based on these design environments MOGOT, it has been shown that the main part of the suggested architecture can be designed efficiently using 2\ulcorner double metal CMOS technology. It includes design of input delay and data conversion module, look-up table for inner product operation, carry save accumulator, output data converter and delay module, and control module.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.11-18
• /
• 2000

In this paper we present a new extensible model based upon the concept of subtransactions in real-time transaction systems. The nested transaction model originally proposed by J. Moss is extended for real-time uniprocessor transaction systems by adding explicit timing constraints. Based upon the model, an integrated concurrency control and scheduling algorithm is developed, that not only guarantees timing constraints of a set of real-time transactions but also maintains consistency of the database. The algorithm is based on the priority ceiling protocol of Sha et al. We prove that the Real-Time Nested Priority Ceiling Protocol prevents unbounded blocking and deadlock, and maintains the serializability of a set of real-time transactions. We use the upper bound on the duration that a transaction can be blocked to show that it is possible to analyze the schedulability of a transaction set using rate-monotonic priority assignment. This work is viewed as a step toward multiprocessor and distributed real-time nested transaction systems. Also, it is possible to be extended to include the real-time multimedia transactions in the emerging web-based database application areas.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.433-437
• /
• 2005

The goal of our research is to develop a formal modeling methodology for supervisory and controlling systems that have artificially intelligent features. This approach is agent-based and central to the development of the model of mobility agent considering reactivity for real-time purpose and deliberation for optimal realization and safe-fail problems for critical systems like Intelligent Transportation Systems by high-level Petri net. By using nets within nets we investigate the concurrency of the system and the agent in one model without losing the needed abstraction, and synchronous channels are introduced to denote the coordination and communication. Finally an example is demonstrated.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.397-407
• /
• 2003

Transactions of updating spatial dta with mobile clients are log transactions because a user disconnected from a server surveys real features and updates them. In this environment, it is appropriate to exploit the optimistic approach based on the validation test in order to control the concurrency of transactions. On the contrary, the pessimistic concurrency control scheme makes transactions wait for a long time due to the lock. In this paper, we propose the surrogate transaction model and implement its manager for the S-S-M(Server-Surrogate PC-Mobile Client) structure which is appropriate for updating spatial data in mobile environments. In the S-S-M structure, the mobile client communicates with the server by the surrogate PC. We extend the validation condition in consideration of spatial relationships between spatial objects in this model. We also present the commit protocol where the user of a surrogate PC adjusts objects of the conflicted surrogate transaction to minimize costs for the abortion of the transaction.

• Journal of KIISE:Databases
• /
• v.27 no.4
• /
• pp.596-603
• /
• 2000

낙관적 기법은 실시간 데이터베이스 시스템을 위한 동시성 제어로서 적합하다. 특히, 종료시 한을 초과한 트랜잭션이 시스템으로부터 제거되는 펌 실시간 데이터베이스 시스템에서 낙관 적 기법은 잠금 기법보다 우수한 성능을 보인다. 그러나 낙관적 기법은 낭비적 수행과 과도 한 재시작의 문제를 안고 있다. 종료에 가까운 트랜잭션의 재시작은 시스템 자원의 낭비는 물론 종료시한 초과 가능성을 높인다. 발생되는 재시작의 수를 줄이기 위해서 충돌하는 트 랜잭션들간의 직렬화 순서를 동적으로 저장하는 방법이 이용되었다. 그러나 직렬화 순서의 동적 조정 기법을 이용함에도 불구하고 불필요한 재시작이 발생된다. 본 논문에서는 기존의 타임스탬프 기반 동시성 제어에서 이용되던 Thomas 기록 규칙을 이용하여 이러한 불필요 한 재시작을 제거한 개선된 실시간 낙관적 동시성 제어 기법을 제한한다. 제안된 방법은 요 구되는 데이터베이스 일관성을 보장하면서도 발생되는 재시작 수를 줄임으로써 성능을 향상 시킨다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.1563-1566
• /
• 2003

본 논문은 실시간 데이터베이스 환경에서의 동시성제어 프로토콜을 제안 그 성능을 향상시키고자 한다. 기존에 실시간 데이터베이스에서 주로 쓰이는 2PL-HP(2 Phase Locking with High Priority)의 방법은 높은 우선순위를 갖는 트랜잭션(HPT)의 선행 처리를 항상 보장하기 때문에 낮은 우선순위를 갖는 트랜잭션(LPT)의 철회 및 블로킹이 불가피하였다. 이러한 문제를 해결하고자 본 논문에서는 실시간 데이터베이스에 기존의 XAL의 기부연산을 확장하고 우선순위 개념을 도입해 LPT의 불필요한 철회 및 기다림을 방지할 수 있는 효율적인 동시성제어 프로토콜을 제안한다.