Researchers are currently investigating applying benefit, or utility functions for allocating resources in limited, soft real time systems [1,2,3]. While the future of real -time computing research and practice will likely explo it the utility of benefit based models, this will not occur until a suitable system level benefit framework has been defined. This paper provides an overview of ongoing...

Although real-time transaction concurrency control has been extensively studied, the design and evaluation of real-time in&l: concurrency control algorithms has not yet been considered. In this paper, we develop real-time variants of several classical B-tree concurrency control algorithms and compare their performance using a detailed simulation model of a firm-deadline real-time database syste...

Real-time database system must meet time constraints in addition to the integrity constraints. Concurrency control is one of the main issues in the studies of real-time database systems. Traditional concurrency control methods use serializability as the correctness criterion when transactions are executed concurrently. However, strict serializability as the correctness criterion is not always s...

1 (m, k)-firm means at least m deadlines should be met among any k consecutive task invocations or message transmissions. Providing (m, k)-firm guarantee is becoming attractive as it proposes an alternative between hard real-time guarantee (case of m = k) and soft (or probabilistic) real-time guarantee with p = m/k (when m, k → ∞) and allows more effective utilization of server resources (proce...

Although many efficient concurrency control protocols have been proposed for real-time database systems, they are mainly designed for the systems with a single type of real-time transactions. Their performance objective is usually to minimize the number of deadline missing of soft real-time transactions or to guarantee the deadline satisfaction of hard real-time transactions. Due to the very di...

An actual development of a real-time database management system (RT-DBMS) must confront many new and practical problems which have been often ignored in previous work based on simulation. In addition to transaction scheduling, an RT-DBMS must deal with resource and data contention and enforce timing constraints. This paper discusses how current real-time technology has been applied to architect...

In a real-time database system, it is difficult to meet all timing constraints due to the consistency requirements of the underlying database. Real-time database transaction scheduling requires the development of efficient concurrency control protocols that try to maximize the number of transactions satisfying their real-time constraints. However, when the transactions in the system are heterog...

Although real-time transaction concurrency control has been extensively studied, the design and evaluation of real-time index concur-rency control algorithms has not yet been considered. In this paper, we develop real-time variants of several classical B-tree concurrency control algorithms and compare their performance using a detailed simulation model of a rm-deadline real-time database system...