Transaction scheduling and commit processing for real-time distributed database systems실시간 분산 데이타베이스 체계를 위한 트랜잭션 스케줄링 및 완료 규약

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 476
  • Download : 0
A major objective of real-time systems is to meet the timing requirements. A distributed transaction processing ensures a correct completion, which means that either a program is executed successfully, producing the intended results, or it has no results at all. If real-time applications run on distributed transaction processing environment, both correct completion and timeliness should be satisfied. Most previous commit protocols, however, fail to satisfy the timeliness for real-time processing. That is, methods for the timely completion do not always guarantee the correct completion or vice versa. In this thesis, we propose new strategies that enforces both the timely and correct completion in the distributed real-time database systems. The strategies are composed of three parts: the language construct to specify the real-time requirements, the scheduling policy to support the timely completion, and the commit procedures to satisfy the atomicity. The language constructs have three features: the specification rules of time constraints, the asynchronous communication primitives, and the registration method of the exception handling routines. Based on these language constructs, we propose a scheduling method to ensure the timeliness of real-time transactions and a commit protocol to guarantee the correct completion among the distributed transactions. The scheduling method consists of two components: the one is real-time transaction scheduling that is related to task scheduling in real-time environment and the other is concurrency control that can be considered as operation level scheduling. To increase the success ratio of the urgent transactions, we propose the multi-level priority scheduling (MLPS) method. The basic idea, here, is the use of the criticalness of transactions with time information. We compare several scheduling policies with the MLPS. To enforce the data consistency, we propose a concurrency control method, called the Commit Timestamp Ordering P...
Advisors
Moon, Song-Chunresearcher문송천researcher
Description
한국과학기술원 : 정보 및 통신공학과,
Publisher
한국과학기술원
Issue Date
1994
Identifier
69753/325007 / 000835581
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 정보 및 통신공학과, 1994.8, [ ix, 167, vi p. ]

URI
http://hdl.handle.net/10203/39813
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=69753&flag=dissertation
Appears in Collection
ICE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0