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

A comparative study of the performance of concurrency control algorithms in a centralised database

Abstract unavailable. Please refer to PDF

Incremental file reorganization schemes

Issued as Final project report, Project no. G-36-66

Performance models of concurrency control protocols for transaction processing systems

Transaction processing plays a key role in a lot of IT infrastructures. It is widely used in a variety of contexts, spanning from database management systems to concurrent programming tools. Transaction processing systems leverage on concurrency control protocols, which allow them to concurrently process transactions preserving essential properties, as isolation and atomicity. Performance is a critical aspect of transaction processing systems, and it is unavoidably affected by the concurrency control. For this reason, methods and techniques to assess and predict the performance of concurrency control protocols are of interest for many IT players, including application designers, developers and system administrators. The analysis and the proper understanding of the impact on the system performance of these protocols require quantitative approaches. Analytical modeling is a practical approach for building cost-effective computer system performance models, enabling us to quantitatively describe the complex dynamics characterizing these systems. In this dissertation we present analytical performance models of concurrency control protocols. We deal with both traditional transaction processing systems, such as database management systems, and emerging ones, as transactional memories. The analysis focuses on widely used protocols, providing detailed performance models and validation studies. In addition, we propose new modeling approaches, which also broaden the scope of our study towards a more realistic, application-oriented, performance analysis

The Ubiquitous B-tree: Volume II

Major developments relating to the B-tree from early 1979 through the fall of 1986 are presented. This updates the well-known article, The Ubiquitous B-Tree by Douglas Comer (Computing Surveys, June 1979). After a basic overview of B and B+ trees, recent research is cited as well as descriptions of nine B-tree variants developed since Comer\u27s article. The advantages and disadvantages of each variant over the basic B-tree are emphasized. Also included are a discussion of concurrency control issues in B-trees and a speculation on the future of B-trees

Canonical approximation in the performance analysis of distributed systems

The problem of analyzing distributed systems arises in many areas of computer science, such as communication networks, distributed databases, packet radio networks, VLSI communications and switching mechanisms. Analysis of distributed systems is difficult since one must deal with many tightly-interacting components. The number of possible state configurations typically grows exponentially with the system size, making the exact analysis intractable even for relatively small systems. For the stochastic models of these systems, whose steady-state probability is of the product form, many global performance measures of interest can be computed once one knows the normalization constant of the steady-state probability distribution. This constant, called the system partition function, is typically difficult to derive in closed form. The key difficulty in performance analysis of such models can be viewed as trying to derive a good approximation to the partition function or calculate it numerically. In this Ph.D. work we introduce a new approximation technique to analyze a variety of such models of distributed systems. This technique, which we call the method of Canonical Approximation, is similar to that developed in statistical physics to compute the partition function. The new method gives a closed-form approximation of the partition function and of the global performance measures. It is computationally simple with complexity independent of the system size, gives an excellent degree of precision for large systems, and is applicable to a wide variety of problems. The method is applied to the analysis of multihop packet radio networks, locking schemes in database systems, closed queueing networks, and interconnection networks

Targeted interventions for patellofemoral pain syndrome (TIPPS): classification of clinical subgroups

Introduction Patellofemoral pain (PFP) can cause significant pain leading to limitations in societal participation and physical activity. An international expert group has highlighted the need for a classification system to allow targeted intervention for patients with PFP; we have developed a work programme systematically investigating this. We have proposed six potential subgroups: hip abductor weakness, quadriceps weakness, patellar hypermobility, patellar hypomobility, pronated foot posture and lower limb biarticular muscle tightness. We could not uncover any evidence of the relative frequency with which patients with PFP fell into these subgroups or whether these subgroups were mutually exclusive. The aim of this study is to provide information on the clinical utility of our classification system. Methods and analysis 150 participants will be recruited over 18 months in four National Health Services (NHS) physiotherapy departments in England. Inclusion criteria: adults 18–40 years with PFP for longer than 3 months, PFP in at least two predesignated functional activities and PFP elicited by clinical examination. Exclusion criteria: prior or forthcoming lower limb surgery; comorbid illness or health condition; and lower limb training or pregnancy. We will record medical history, demographic details, pain, quality of life, psychomotor movement awareness and knee temperature. We will assess hip abductor and quadriceps weakness, patellar hypermobility and hypomobility, foot posture and lower limb biarticular muscle tightness. The primary analytic approach will be descriptive. We shall present numbers and percentages of participants who meet the criteria for membership of (1) each of the subgroups, (2) none of the subgroups and (3) multiple subgroups. Exact (binomial) 95% CIs for these percentages will also be presented. Ethics and dissemination This study has been approved by National Research Ethics Service (NRES) Committee North West—Greater Manchester North (11/NW/0814) and University of Central Lancashire (UCLan) Built, Sport, Health (BuSH) Ethics Committee (BuSH 025). An abstract has been accepted for the third International Patellofemoral Pain Research Retreat, Vancouver, September 2013