Implementation of transactions scheduling for real-time database management
Dept. of Electr. Eng., Federal Univ. of Campina Grande, Campinas, BrazilDOI: 10.1109/ICSMC.2004.1401009 Conference: Systems, Man and Cybernetics, 2004 IEEE International Conference on, Volume: 6
Source: IEEE Xplore
The results of transactions processing in realtime database must to satisfy the temporal constraints associated to both transactions and data, besides maintaining the logical consistency imposed to them. In order to solve this problem, we present the implementation of real-time transactions scheduling considering semantic concurrency control technique. As results, the best execution sequence of the transactions operations must be produced, where the transactions maximum amount attends its deadlines using valid data. This paper describes the schedule implementation using threads class in Java.
- [Show abstract] [Hide abstract]
ABSTRACT: Transaction parallelism in database systems is an attractive way of improving transaction performance. There exists two levels of transaction parallelism, inter-transaction level and intra-transaction level. With the advent of multicore processors, new hopes of improving transaction parallelism appear on the scene. The greatest execution efficiency of concurrent transactions comes from the lowest dependencies of them. However, the dependencies of concurrent transactions stand in the way of exploiting parallelism. In this paper, we present Resource Snapshot Model (RSM) for resource modeling in both levels. We propose a non-restarting scheduling algorithm in the inter-transaction level and a processor assignment algorithm in the intra-transaction level in terms of multi-core processors. Through these algorithms, execution performance of transaction streams will be improved in a parallel system with multiple heterogeneous processors that have different number of cores.Journal of Computer Science and Technology 01/2013; 28(1). DOI:10.1007/s11390-013-1315-7 · 0.67 Impact Factor