An Efficient Secure Real-Time Concurrency Control Protocol

Secure real-time databases must simultaneously satisfy two requirements in guaranteeing data security and minimizing the missing deadlines ratio of transactions. However, these two requirements can conflict with each other and achieve one requirement is to sacrifice the other. This paper presents a secure real-time concurrency control protocol based on optimistic method. The concurrency control protocol incorporates security constraints in a real-time optimistic concurrency control protocol and makes a suitable tradeoff between security and real-time requirements by introducing secure influence factor and real-time influence factor. The experimental results show the concurrency control protocol achieves data security without degrading real-time perform ance significantly.

Study on Agent Based Methods for Concurrency Control in CSCW

Concurrency control is a critical technology and one of the problems in CSCW systems. With the development of agent based technology, it has also been applied to research and development of CSCW systems. An Agent based method for concurrency control in CSCW is explored in this paper. This new way is achieved by making use of the thoughts of AOP (Agent Oriented Programming) to improve traditional locking method, on the basis of researching characteristics and functional requirements of concurrency control in CSCW, and analyzing various usually used concurrency control methods. All amendments to locking method are done on the basis of the analysis of limitations brought by locking. In this paper, a new algorithm supporting queue of locking request for Agent based concurrency control is also presented. All above aspects are discussed in some detail in this paper.

Weak Serializable Concurrency Control in Distributed Real-Time Database Systems

Most of the proposed concurrency control protocols for real time database systems are based on serializability theorem. Owing to the unique characteristics of real time database applications and the importance of satisfying the timing constraints of transactions, serializability is too strong as a correctness criterion and not suitable for real time databases in most cases. On the other hand, relaxed serializability including epsilon serializability and similarity serializability can allow more real time transactions to satisfy their timing constraints, but database consistency may be sacrificed to some extent. We thus propose the use of weak serializability(WSR) that is more relaxed than conflicting serializability while database consistency is maintained. In this paper, we first formally define the new notion of correctness called weak serializability. After the necessary and sufficient conditions for weak serializability are shown, corresponding concurrency control protocol WDHP(weak serializable distributed high priority protocol) is outlined for distributed real time databases, where a new lock mode called mask lock mode is proposed for simplifying the condition of global consistency. Finally, through a series of simulation studies, it is shown that using the new concurrency control protocol the performance of distributed real time databases can be greatly improved.

oodOPT: A Semantics-Based Concurrency Control Framework for Fully-Replicated Architecture

Concurrency control has always been one of the most important issues in the design of synchronous groupware systems with fully-replicated architecture. An ideal strate- gy should be able to support natural and flexible human-to-computer and human-to-human interactions while maintaining the consistency of the system. This paper summarizes previ- ous researches on this topic and points out the deficiencies of the existing results. A novel semantics-based concurrency control framework, oodOPT is proposed. The main idea of the framework is to resolve conflicts by utilizing semantics of the operations and the accessed data objects. With this approach, complexities in concurrency control are shifted completely from application developers to the framework. Conflicts among operations on objects with different semantics and the strategies resolving these conflicts are analyzed. After describing the algo- rithm in full detail, the discussion ends up with a comparison with other related work and some considerations for open problems.

An Adaptive Strategy Integrating Locking with Optimistic Concurrency Control

This paper presents an adaptive strategy called K-locking algorithm for concurrency control in database system.The algorithm integrates an optimistic approach with the K-lock mechanism to control the degree of transaction interference.It is shown that the K-locking strategy is adaptive to the changes in transaction parameters and outperforms both an optimistic approach and a pessimistic approach.

Multi-Clock Snapshot Isolation Concurrency Control for NVM Database

Multi-Clock Snapshot Isolation(MCSI)is a concurrency control mechanism that implements snapshot isolation on a single-layer Non-Volatile Memory(NVM)database.It stores a single copy of data by using multi-version storage to ensure durability and runtime access.With multi-clock transaction timestamp assignment,MCSI can efficiently generate snapshots with vector clocks and use per-thread transaction status arrays to identify uncommitted versions in NVM.For evaluation,we compared MCSI with the PostgreSQL-style concurrency control used in the single-layer NVM database N2DB.The maximum transaction throughput of MCSI is 101%–195%higher than that of N2DB for the YCSB workloads,and 25%–49%higher for the TPC-C workloads.Moreover,the transaction latency of MCSI remains relatively stable as the thread count increases.With 18 worker threads,the average transaction latency of MCSI is 65%–84%lower than that of N2DB for the YCSB workloads and 16%–43%lower for the TPC-C workloads.

Concurrency Control Mechanism of Complex Objects

A complex object is an abstraction and description of a complex entity of the real world. Many applications in such domains as CIMS, CAD and OA define and manipulate a complex object as a single unit. In this paper, a definition of the model of complex objects is given, and the concurrency control mechanism of complex objects in WHYMX object-oriented database system is described.

Concurrency Control of Single-Level Transaction in WHYMX Object-Oriented Database System

The data model of WHYMX complicates transaction management. Traditional locking method is not powerful enough to solve the new problem of concurrency control of WHYMX's transaction. This paper presents a number of concurrency control algorithms based on the extended locking method.

Design and Implementation of a Concurrency Control Mechanism in an Object-Oriented Database System

This paper presents a practical concurrency control mechanism - ObjectLockingin OODBMS. Object-Locking can schedule transactions, each of themcan be considered as a sequence of high level operations defined on classes. Bythe properties of parallelity and coatativity between high level operations,proper lock modes for each operation are desigued and the compatibility matrixis constructed. With these lock modes, phatoms are kept away from databasesand a high degree of concurrency is achieved.

Quanta-A platform for rapid control and monitoring of heterogeneous rbots

Rapid prototyping,real-time control and monitoring of various events in robots are crucial requirements for research in the fields of modular and swarm robotics.A large quantities of resources(time,man power,infrastructure,etc.)are often invested in programming,interfacing the sensors,debugging the response to algorithms during prototyping and operational phases of a robot development cycle.The cost of developing an optimal infrastructure to efficiently address such control and monitoring requirements increases significantly in the presence of mobile robots.Though numerous solutions have been developed for minimizing the resources spent on hardware prototyping and algorithm validation in both static and mobile scenarios,it can be observed that researchers have either chosen methodologies that conflict with the power and infrastructure constraints of the research field or generated constrained solutions whose applications are restricted to the field itself.This paper develops a solution for addressing the challenges in controlling heterogeneous mobile robots.A platform named Quanta-a cost effective,energy efficient and high-speed wireless infrastructure is prototyped as a part of the research in the field of modular robotics.Quanta is capable of controlling and monitoring various events in/using a robot with the help of a light-weight communication protocol independent of the robot hardware architecture(s).

Adaptive Consistent Management to Prevent System Collapse on Shared Object Manipulation in Mixed Reality

A concurrency control mechanism for collaborative work is akey element in a mixed reality environment. However, conventional lockingmechanisms restrict potential tasks or the support of non-owners, thusincreasing the working time because of waiting to avoid conflicts. Herein, wepropose an adaptive concurrency control approach that can reduce conflictsand work time. We classify shared object manipulation in mixed reality intodetailed goals and tasks. Then, we model the relationships among goal,task, and ownership. As the collaborative work progresses, the proposedsystem adapts the different concurrency control mechanisms of shared objectmanipulation according to the modeling of goal–task–ownership. With theproposed concurrency control scheme, users can hold shared objects andmove and rotate together in a mixed reality environment similar to realindustrial sites. Additionally, this system provides MS Hololens and Myosensors to recognize inputs from a user and provides results in a mixed realityenvironment. The proposed method is applied to install an air conditioneras a case study. Experimental results and user studies show that, comparedwith the conventional approach, the proposed method reduced the number ofconflicts, waiting time, and total working time.

A Conflict Detection Scheme for Concurrency Control of R-tree

Despite extensive research on R-trees, most of the proposed schemes have notbeen integrated into existing DBMS owing to the lack of protocols of concurrency control. R-linktree is an acceptable data structure to deal with this issue, but problems like phantom still exist.In this paper, we focus on a conflict detection scheme based on R-link tree for completeconcurrency control. An in-memory operation control list is designed to suspend conflictingoperations . The main features of this approach are (1) it can be implemented easily and does notneed any extra information ; (2) No deadlocks are involved in locking scheme ; (3) Non-conflictingoperations are not restricted ; and (4) Phantom problems in R-link tree are avoided throughbeforehand predication . The experiment results show that this scheme is correct and gains bettersystem performance.

CRF:A Scheduling of Multi-Granularity Locks in Object-Oriented Database Systems

This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are proposed in the paper. The ideas of single queue scheduling(SQS) and dual queue scheduling (DQS) are proposed and the algorithm and the performance evaluation for these two scheduling are presented in some paper. This paper describes a new idea of thescheduling for MGL, compatible requests first (CRF). Combining the new idea with SQS and DQS,we propose two new scheduling algorithms called CRFS and CRFD. After describing the simulationmodel, this paper illustrates the comparisons of the performance among these four algorithms. Asshown in the experiments, DQS has better performance than SQS, CRFD is better than DQS, CRFSperforms better than SQS, and CRFS is the best one of these four scheduling algorithms.

Natural human–computer interaction control of multi operators in collaborative virtual maintenance based on optical human motion capture system

Aiming at the human–computer interaction control(HCIC)requirements of multi operators in collaborative virtual maintenance(CVM),real-time motion capture and simulation drive of multi operators with optical human motion capture system(HMCS)is proposed.The detailed realization process of real-time motion capture and data drive for virtual operators in CVM environment is presented to actualize the natural and online interactive operations.In order to ensure the cooperative and orderly interactions of virtual operators with the input operations of actual operators,collaborative HCIC model is established according to specific planning,allocating and decision-making of different maintenance tasks as well as the human–computer interaction features and collaborative maintenance operation features among multi maintenance trainees in CVM process.Finally,results of the experimental implementation validate the effectiveness and practicability of proposed methods,models,strategies and mechanisms.

Supervisory control of concurrent discrete-event systems

Concurrency is a common feature in most industrial systems,where several components can execute different actions simultaneously.In this paper,we first introduce a new feasible nonblocking concurrent supervisory control map for a concurrent system,and subsequently,new concepts of concurrent controllability and concurrent observability.Then we present a sufficient and necessary condition for the existence of a feasible nonblocking concurrent supervisory controlmap to achieve a given concurrent language.After introducing a new concept of prefix-closed concurrent normality,we show that the supremal concurrently controllable and prefix-closed concurrently normal sublanguages exist and are computable.Our emphasis here is not to address the computational efficiency of solving concurrent supervisory control problems,which is still a technical challenge,but to show that the commonly used Ramadge–Wonham asynchronous control is simply a special case of our proposed concurrent control framework by providing an insightful treatment on compound events.

Optimal Concurrent Control of Database System

To realize and raise sharing property of database′s resource, it is necessary to introduce concurrent operation. But without control on the concurrent operation, it will result in a series of problems. This paper analyses the causes leading to these problems with the example, and sets up Petri Nets models based on both trasaction control and activity control according to the characteristics of the Petri Nets to solve the problems.

A semi-transparent selective undo algorithm for multi-user collaborative editors

Multi-user collaborative editors are useful computer-aided tools to support human-to-human collaboration.For multi-user collaborative editors,selective undo is an essential utility enabling users to undo any editing operations at any time.Collaborative editors usually adopt operational transformation(OT)to address concurrency and consistency issues.However,it is still a great challenge to design an efficient and correct OT algorithm capable of handling both normal do operations and user-initiated undo operations because these two kinds of operations can interfere with each other in various forms.In this paper,we propose a semi-transparent selective undo algorithm that handles both do and undo in a unified framework,which separates the processing part of do operations from the processing part of undo operations.Formal proofs are provided to prove the proposed algorithm under the well-established criteria.Theoretical analysis and experimental evaluation are conducted to show that the proposed algorithm outperforms the prior OT-based selective undo algorithms.

A Reprocessing Model for Complete Execution of RFID Access Operations on Tag Memory

This paper investigates the problem of inconsistent states of radio frequency identification （RFID） tag data caused by incomplete execution of read/write operations during access to RFID tag memory. Passive RFID tags require RF communication to access memory data. This study is motivated by the volatility of RF communication, where instability is caused by intermittent connections and uncertain communication. If a given tag disappears from the communication area of the reader during the reading or writing of tag data, the operation is incomplete, resulting in an inconsistent state of tag data. To avoid this inconsistency, it is necessary to ensure that any operations on tag memory are completed. In this paper, we propose an asynchronous reprocessing model for finalizing any incomplete execution of read/write operations to remove inconsistent states. The basic idea is to resume incomplete operations autonomously by detecting a tag＇s re-observation from any reader. To achieve this, we present a concurrency control mechanism based on continuous query processing that enables the suspended tag operations to be re-executed. The performance study shows that our model improves the number of successful operations considerably in addition to suppressing inconsistent data access completely.

Concurrent Manipulation of Expanded AVL Trees

The concurrent manipulation of an expanded AVL tree (EAVL tree) is considered in this paper. The presented system can support any number of concurrent processes which perform searching, insertion and deletion on the tree. Simulation results indicate the high performance of the system. Elaborate techniques are used to achieve such a system unawilable based on any known algorithms. Methods developed in this paper may provide new insights into other problems in the area of concurrent search structure manipulation.

The Catalog Management Strategy of Distributed Data Base Systems

In this paper the catalog management strategy of the successfully integrating andrunning DDBMS C-POREL is summarized. The new catalog management strategyand its implementation scheme are based on the analysis of the catalog managementmethods of the pioneer DDBMS. The goal of the new strategy is to improve the systemefficiency. Analysis and practice show that this strategy is successful.