Browsing by Subject "Transaction scheduling"

Now showing 1 - 4 of 4

Open Access
An evaluation of a client-server real-time database system
(ACM, 1996) Ulusoy, Özgür
A real-time database system (RTDBS) can be defined as a database system where transactions are associated with real-time constraints. In this paper, we investigate various performance issues in a RTDBS constructed on a client-server system architecture. In a client-server database management system the whole database is stored on the server disks, and copies of database items can be cached in the client memories. We provide a detailed simulation model of a client-server RTDBS, and present the initial results of a performance work that evaluates the effects of various workload parameters and design alternatives. Index Terms - Real-time database systems, client-server architecture, transaction scheduling, timing constraints.
Open Access
A performance evaluation model for distributed real-time database
(Taylor & Francis Group, 1995) Ulusoy, Özgür; Belford, G. G.
A real-time database system (RTDBS) is designed to provide timely response to the transactions of data-intensive applications. Each transaction processed in an RTDBS is associated with a timing constraint in the form of a deadline. Efficient transaction-scheduling algorithms are required to minimize the number of missed transaction deadlines. In thls paper a performance evaluation model is provided to enable distributed RTDBS designers to analyze transaction scheduling algorithms. The model is developed progressing from a simple mathematical analysis to complicated simulations. The performance is expressed in terms of the fraction of satisfied transaction deadlines. The paper also provides an example simulation experiment implemented using the model presented.
Open Access
Processing real-time transactions in a replicated database system
(Springer/Kluwer Academic Publishers, 1994) Ulusoy, Özgür
A database system supporting a real-time application has to provide real-time information to the executing transactions. Each real-time transaction is associated with a timing constraint, typically in the form of a deadline. It is difficult to satisfy all timing constraints due to the consistency requirements of the underlying database. In scheduling the transactions it is aimed to process as many transactions as possible within their deadlines. Replicated database systems possess desirable features for real-time applications, such as a high level of data availability, and potentially improved response time for queries. On the other hand, multiple copy updates lead to a considerable overhead due to the communication required among the data sites holding the copies. In this paper, we investigate the impact of storing multiple copies of data on satisfying the timing constraints of real-time transactions. A detailed performance model of a distributed database system is employed in evaluating the effects of various workload parameters and design alternatives on the system performance. The performance is expressed in terms of the fraction of satisfied transaction deadlines. A comparison of several real-time concurrency control protocols, which are based on different approaches in involving timing constraints of transactions in scheduling, is also provided in performance experiments. © 1994 Kluwer Academic Publishers.
Open Access
Real-time transaction scheduling in database systems
(1993) Ulusoy, Özgür; Belford, G. G.
A database system supporting a real-time application, which can be called "a real-time database system (RTDBS)", has to provide real-time information to the executing transactions. Each RTDB transaction is associated with a timing constraint, usually in the form of a deadline. Efficient resource scheduling algorithms and concurrency control protocols are required to schedule the transactions so as to satisfy both timing constraints and data consistency requirements. In this paper,† † An earlier version of this paper was published in the Proceedings of ACM Computer Science Conference '92. we concentrate on the concurrency control problem in RTDBSs. Our work has two basic goals: real-time performance evaluation of existing concurrency control approaches in RTDBSs, and proposing new concurrency control protocols with improved performance. One of the new protocols is locking-based, and it prevents the priority inversion problem‡ by scheduling the data lock requests based on prioritizing data items. The second new protocol extends the basic timestamp-ordering method by involving real-time priorities of transactions in the timestamp assignment procedure. Performance of the protocols is evaluated through simulations by using a detailed model of a single-site RTDBS. The relative performance of the protocols is examined as a function of transaction load, data contention (which is determined by a number of system parameters) and resource contention. The protocols are also tested under various real-time transaction processing environments. The performance of the proposed protocols appears to be good, especially under conditions of high transaction load and high data contention.