An Evaluation of Network Access Protocols for Distributed Real-time Database Systems

Cataloged from PDF version of article.The results of a considerable number of works addressing various features of real-time database systems (RTDBSs) have recently appeared in the literature. An issue that has not received much attention yet is the performance of the communication network configuration in a distributed RTDBS. In this article, we examine the impact of underlying network architecture on the performance of a distributed RTDBS. In particular, we evaluate the real-time performance of distributed transactions in terms of the fraction of satisfied deadlines under various network access strategies. We also critically examine the common assumption of constant network delay for each communication message exchanged in a distributed RTDBS. (C) 1997 by Elsevier Science Inc

Analysis of concurrency control protocols for real-time database systems

Cataloged from PDF version of article.This paper provides an approximate analytic solution method for evaluating the performance of concurrency control protocols developed for real-time database systems (RTDBSs). Transactions processed in a RTDBS are associated with timing constraints typically in the form of deadlines. The primary consideration in developing a RTDBS concurrency control protocol is the fact that satisfaction of the timing constraints of transactions is as important as maintaining the consistency of the underlying database. The proposed solution method provides the evaluation of the performance of concurrency control protocols in terms of the satisfaction rate of timing constraints. As a case study, a RTDBS concurrency control protocol, called High Priority, is analyzed using the proposed method. The accuracy of the performance results obtained is ascertained via simulation. The solution method is also used to investigate the real-time performance benefits of the High Priority over the ordinary Two-Phase Locking. © 1998 Elsevier Science Inc. All rights reserved

\u3cem\u3eRTC\u3c/em\u3e: Language Support for Real-Time Concurrency

This paper presents language constructs for the expression of timing and concurrency requirements in distributed real-time programs. Our programming paradigm combines an object-based paradigm for the specification of shared resources, and a distributed transaction-based paradigm for the specification of application processes. Resources provide abstract views of shared system entities, such as devices and data structures. Each resource has a state and defines a set of actions that can be invoked by processes to examine or change its state. A resource also specifies scheduling constraints on the execution of its actions to ensure the maintenance of its state\u27s consistency. Processes access resources by invoking actions and express precedence, consistency. Processes access resources by invoking actions and express precedence, consistency and timing constraints on action invocations. The implementation of our language constructs with real-time scheduling and locking for concurrency control is also described

Performance Comparison of Scheduling Techniques to Manage Transactions for Real-Time Mobile Databases in Ad Hoc Networks

A Mobile Ad-hoc Network (MANET) ¡s an autcnomous system of mobile hosts (MHs) with similar transmission power and computation capabilities that communicate over relatively bandwidth constrained wireless links. Applications such as emergency/rescue operations, conferences/meetings/lectures, dísaster refief efforts, bluetooth (Personal Area Network} and military networks can be conceived as applications of MAIMET due to the fact that they cannot rely on centralized and organized connectivity. In these environment transactions are time-crltical and require to be executed not only correclly but also within their deadlines, that is, the user that submit a transaction would like it to be completed before a certain time in the future. This study focuses on the comparison of four scheduling techniques based on the policy of assigning priorities to transactions on the system. The techniques are: First Come First Serve (FCFS) [1,2], Earliest Deadline (ED) [1,2,5], Least Slack (LS) [1,2,8] and Least Slack Mobile (LSM) proposed in [3] where some modifications to the Least Slack Technique with respect to energy constraints, disoonnection and transaction type (firnVsoft) are considered. Applying these modifications to Earliest Deadline, the performance of the system will be evaluated to measure the percentage of transaction missing deadlines and the total energy consumption in the mobile hosts. The performance evaluation of the techniques will be carried out by means of simulation. The simulation model is implemented using Visual Slam/Awesim [7]

Identifying Issues for the Bright ICT Initiative: A Worldwide Delphi Study of IS Journal Editors and Scholars

Information and communication technology (ICT) continues to change business as we know it. As ICT further integrates into our daily lives, it creates more opportunities to both help and hinder fundamental social problems throughout the world. In response to these growing and urgent societal needs, the Association for Information Systems approved the Bright ICT Initiative to extend IS research beyond a focus on business to take on the broader challenges of an ICT-enabled bright society. We conducted a Delphi study to provide guidance on where bright ICT-minded researchers might focus to produce their greatest impact. In this paper, we report on our findings. The Delphi panel comprised 182 globally distributed IS journal editors who participated in a three-round consensus-building process via the Internet. Our results provide a framework of eleven research priority areas and specific research topics for those engaged in future-oriented, socially conscious IS research

Real-time transaction scheduling in database systems

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. © 1994

Processing real-time transactions in a replicated database system

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

Multiclass Query Scheduling in Real-Time Database Systems

In recent years, a demand for real-time systems that can manipulate large amounts of shared data has led to the emer-gence of real-time database systems (RTDBS) as a research area. This paper focuses on the problem of scheduling queries in RTDBSs. We introduce and evaluate a new algorithm called Priority Adaptation Query Resource Scheduling (PAQRS) for handling both single class and multiclass query workloads. The performance objective of the algorithm is to minimize the number of missed deadlines, while at the same time ensuring that any deadline misses are scattered across the different classes according to an administratively-defined miss distribution. This objective is achieved by dynamically adapting the system’s admission, mem-ory allocation, and priority assignment policies according to its current resource configuration and workload characteristics. A series of experiments confirms that PAQRS is very effective for real-time query scheduling