Validation concurrency control protocol in parallel real-time database systems

In parallel real-time database systems, concurrency control protocols must satisfy time constraints as well as the integrity constraints. The authors present a validation concurrency control(VCC) protocol, which can enhance the performance of real-time concurrency control mechanism by reducing the number of transactions that might miss their deadlines, and compare the performance of validation concurrency control protocol with that of HP2PL(High priority two phase locking) protocol and OCC-TI-WAIT-50(Optimistic concurrency control-time interval-wait-50) protocol under shared-disk architecture by simulation. The simulation results reveal that the protocol the author presented can effectively reduce the number of transactions restarting which might miss their deadlines and performs better than HP2PL and OCC-TI-WAIT-50. It works well when arrival rate of transaction is lesser than threshold. However, due to resource contention the percentage of missing deadline increases sharply when arrival rate is greater than the threshold.

A dynamic crash recovery scheme for distributed real-time database systems

Recovery performance in the event of failures is very important for distributed real-time database systems. This paper presents a time-cognizant logging-based crash recovery scheme （TCLCRS） that aims at distributed real-time databases, which adopts a main memory database as its ground support. In our scheme, each site maintains a real-time log for local transactions and the subtransactions, which execute at the site, and execte local checkpointing independently. Log records are stored in non-volatile high- speed store, which is divided into four different partitions based on transaction classes. During restart recovery after a site crash, partitioned crash recovery strategy is adopted to ensure that the site can be brought up before the entire local secondary database is reloaded in main memory. The partitioned crash recovery strategy not only guarantees the internal consistency to be recovered, but also guarantee the temporal consistency and recovery of the sates of physical world influenced by uncommitted transactions. Combined with two- phase commit protocol, TCLCRS can guarantee failure atomicity of distributed real-time transactions.

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.

Scheduling transactions in mobile distributed real-time database systems

A DMVOCC-MVDA(distributed multiversion optimistic concurrency control with multiversion dynamic adjustment)protocol was presented to process mobile distributed real-time transaction in mobile broadcast environments.At the mobile hosts,all transactions perform local pre-validation.The local pre-validation process is carried out against the committed transactions at the server in the last broadcast cycle.Transactions that survive in local pre-validation must be submitted to the server for local final validation.The new protocol eliminates conflicts between mobile read-only and mobile update transactions,and resolves data conflicts flexibly by using multiversion dynamic adjustment of serialization order to avoid unnecessary restarts of transactions.Mobile read-only transactions can be committed with no-blocking,and respond time of mobile read-only transactions is greatly shortened.The tolerance of mobile transactions of disconnections from the broadcast channel is increased.In global validation mobile distributed transactions have to do check to ensure distributed serializability in all participants.The simulation results show that the new concurrency control protocol proposed offers better performance than other protocols in terms of miss rate,restart rate,commit rate.Under high work load(think time is 1s)the miss rate of DMVOCC-MVDA is only 14.6%,is significantly lower than that of other protocols.The restart rate of DMVOCC-MVDA is only 32.3%,showing that DMVOCC-MVDA can effectively reduce the restart rate of mobile transactions.And the commit rate of DMVOCC-MVDA is up to 61.2%,which is obviously higher than that of other protocols.

Quasi Serializable Concurrency Control in Distributed Real-Time Database Systems

This paper formally defines and analyses the new notion of correctness called quasi serializability, and then outlines corresponding concurrency control protocol QDHP for distributed real-time databases. Finally, through a series of simulation studies, it shows that using the new concurrency control protocol the performance of distributed real-time databases can be much improved.

The Multi-level Recovery of Main-memory Real-time Database Systems with ECBH

Storing the whole database in the main-memory is a common method to processreal-time transaction in real-time database systems. The recovery mechanism of Main-memory Real-timeDatabase Systems (MMRTDBS) should reflect the characteristics of the main-memory database andreal-time database because their structures are quite different from other conventional databasesystems. In this paper, therefore, we propose a multi-level recovery mechanism for main-memoryreal-time database systems with Extendable Chained Bucket Hashing (ECBH). Owing to the occurrence ofreal-time data in real-time systems, we should also consider it in our recovery mechanism .According to our performance test, this mechanism can improve the transaction concurrency, reducingtransactions ' deadline missing rate.

Cyber Resilience through Real-Time Threat Analysis in Information Security

This paper examines how cybersecurity is developing and how it relates to more conventional information security. Although information security and cyber security are sometimes used synonymously, this study contends that they are not the same. The concept of cyber security is explored, which goes beyond protecting information resources to include a wider variety of assets, including people [1]. Protecting information assets is the main goal of traditional information security, with consideration to the human element and how people fit into the security process. On the other hand, cyber security adds a new level of complexity, as people might unintentionally contribute to or become targets of cyberattacks. This aspect presents moral questions since it is becoming more widely accepted that society has a duty to protect weaker members of society, including children [1]. The study emphasizes how important cyber security is on a larger scale, with many countries creating plans and laws to counteract cyberattacks. Nevertheless, a lot of these sources frequently neglect to define the differences or the relationship between information security and cyber security [1]. The paper focus on differentiating between cybersecurity and information security on a larger scale. The study also highlights other areas of cybersecurity which includes defending people, social norms, and vital infrastructure from threats that arise from online in addition to information and technology protection. It contends that ethical issues and the human factor are becoming more and more important in protecting assets in the digital age, and that cyber security is a paradigm shift in this regard [1].

An Efficient Real-Time Fault-Tolerant Scheduling Algorithm Based on Multiprocessor Systems

In the context of real-time fault-tolerant scheduling in multiprocessor systems, Primary-backup scheme plays an important role. A backup copy is always preferred to be executed as passive backup copy whenever possible because it can take the advantages of backup copy de-allocation technique and overloading technique to improve schedulability. In this paper, we propose a novel efficient fault-tolerant ratemonotonic best-fit algorithm efficient fault-tolerant rate-monotonic best-fit （ERMBF） based on multiprocessors systems to enhance the schedulability. Unlike existing scheduling algorithms that start scheduling tasks with only one processor. ERMBF pre-allocates a certain amount of processors before starting scheduling tasks, which enlarge the searching spaces for tasks. Besides, when a new processor is allocated, we reassign the task copies that have already been assigned to the existing processors in order to find a superior tasks assignment configuration. These two strategies are all aiming at making as many backup copies as possible to be executed as passive status. As a result, ERMBF can use fewer processors to schedule a set of tasks without losing real-time and fault-tolerant capabilities of the system. Simulation results reveal that ERMBF significantly improves the schedulability over existing, comparable algorithms in literature.

An Efficient Crash Recovery Technique for Real-Time Main Memory Database

This paper presents an efficient recovery scheme suitable for real-time mainmemory database. In the recovery scheme, log records are stored in non-volatile RAM which is dividedinto four different partitions based on transaction types. Similarly, a main memory database isdivided into four partitions based data types. When the using ratio of log store area exceeds thethreshold value, checkpoint procedure is triggered. During executing checkpoint procedure, someuseless log records are deleted. During restart recovery after a crash, partition reloading policyis adopted to assure that critical data are reloaded and restored in advance, so that the databasesystem can be brought up before the entire database is reloaded into main memory. Therefore downtime is obvionsly reduced. Simulation experiments show our recovery scheme obviously improves thesystem performance, and does a favor to meet the dtadlints of real-time transactions.

A BiLSTM cardinality estimator in complex database systems based on attention mechanism

An excellent cardinality estimation can make the query optimiser produce a good execution plan.Although there are some studies on cardinality estimation,the prediction results of existing cardinality estimators are inaccurate and the query efficiency cannot be guaranteed as well.In particular,they are difficult to accurately obtain the complex relationships between multiple tables in complex database systems.When dealing with complex queries,the existing cardinality estimators cannot achieve good results.In this study,a novel cardinality estimator is proposed.It uses the core techniques with the BiLSTM network structure and adds the attention mechanism.First,the columns involved in the query statements in the training set are sampled and compressed into bitmaps.Then,the Word2vec model is used to embed the word vectors about the query statements.Finally,the BiLSTM network and attention mechanism are employed to deal with word vectors.The proposed model takes into consideration not only the correlation between tables but also the processing of complex predicates.Extensive experiments and the evaluation of BiLSTM-Attention Cardinality Estimator(BACE)on the IMDB datasets are conducted.The results show that the deep learning model can significantly improve the quality of cardinality estimation,which is a vital role in query optimisation for complex databases.

Use of Dynamical Systems Modeling to Hybrid Cloud Database

In the article, an experiment is aimed at clarifying the transfer efficiency of the database in the cloud infrastructure. The system was added to the control unit, which has guided the database search in the local part or in the cloud. It is shown that the time data acquisition remains unchanged as a result of modification. Suggestions have been made about the use of the theory of dynamic systems to hybrid cloud database. The present work is aimed at attracting the attention of specialists in the field of cloud database to the apparatus control theory. The experiment presented in this article allows the use of the description of the known methods for solving important practical problems.

A State-of-the-Art Survey on Real-Time Issues in Embedded Systems Virtualization

Virtualization has gained great acceptance in the server and cloud computing arena. In recent years, it has also been widely applied to real-time embedded systems with stringent timing constraints. We present a comprehensive survey on real-time issues in virtualization for embedded systems, covering popular virtualization systems including KVM, Xen, L4 and others.

THE OPTIMAL TRUNCATED LOW-DIMENSIONAL DYNAMICAL SYSTEMS BASED ON FLOW DATABASES

A new theory on the construction of optimal truncated Low-Dimensional Dynamical Systems (LDDSs) with different physical meanings has been developed, The physical properties of the optimal bases are reflected in the user-defined optimal conditions, Through the analysis of linear and nonlinear examples, it is shown that the LDDSs constructed by using the Proper Orthogonal Decomposition (POD) method are not the optimum. After comparing the errors of LDDSs based on the new theory POD and Fourier methods, it is concluded that the LDDSs based on the new theory are optimally truncated and catch the desired physical properties of the systems.

Partitioned k-Exclusion Real-Time Locking Protocol Motivated by Multicore Multi-GPU Systems

Graphic processing units （GPUs） have been widely recognized as cost-efficient co-processors with acceptable size, weight, and power consumption. However, adopting GPUs in real-time systems is still challenging, due to the lack in framework for real-time analysis. In order to guarantee real-time requirements while maintaining system utilization ~in modern heterogeneous systems, such as multicore multi-GPU systems, a novel suspension-based k-exclusion real-time locking protocol and the associated suspension-aware schedulability analysis are proposed. The proposed protocol provides a synchronization framework that enables multiple GPUs to be efficiently integrated in multicore real-time systems. Comparative evaluations show that the proposed methods improve upon the existing work in terms of schedulability.

An OWL-Based Specification of Database Management Systems

In the context of a proliferation of DatabaseManagement Systems(DBMSs),we have envisioned and produced an OWL 2 ontology able to provide a high-level machine-processable description of the DBMSs domain.This conceptualization aims to facilitate a proper execution of various software engineering processes and database-focused administration tasks.Also,it can be used to improve the decision-making process for determining/selecting the appropriate DBMS,subject to specific requirements.The proposed model describes the most important features and aspects regarding the DBMS domain,including the support for various paradigms(relational,graph-based,key-value,tree-like,etc.),query languages,platforms(servers),plus running environments(desktop,Web,cloud),specific contexts—i.e.,focusing on optimizing queries,redundancy,security,performance,schema vs.schema-less approaches,programming languages/paradigms,and others.The process of populating the ontology with significant individuals(actual DBMSs)benefits from the existing knowledge exposed by free and open machine-processable knowledge bases,by using structured data fromWikipedia and related sources.The pragmatic use of our ontology is demonstrated by two educational software solutions based on current practices in Web application development,proving support for learning and experimenting key features of the actual semantic Web technologies and tools.This approach is also an example of using multiple knowledge from database systems,semanticWeb technologies,and software engineering areas.

Energy-Efficient Deterministic Fault-Tolerant Scheduling for Embedded Real-Time Systems

By combining fault-tolerance with power management, this paper developed a new method for aperiodic task set for the problem of task scheduling and voltage allocation in embedded real-time systems. The scbedulability of the system was analyzed through checkpointing and the energy saving was considered via dynamic voltage and frequency scaling. Simulation results showed that the proposed algorithm had better performance compared with the existing voltage allocation techniques. The proposed technique saves 51.5% energy over FT-Only and 19.9% over FT ＋ EC on average. Therefore, the proposed method was more appropriate for aperiodic tasks in embedded real-time systems.

T4SP: A Novel Tool and Database for Type IV Secretion Systems in Bacterial Genomes

Secretion systems, macromolecules to pass which can mediate the across cellular membranes, are essential for virulent and genetic material exchange among bacterial species[1]. Type IV secretion system （T4SS） is one of the secretion systems and it usually consists of 12 genes： VirB1, VirB2 ...VirB11, and VirD4[2]. The structure and molecular mechanisms of these genes have been well analyzed in Gram-negative strains[3] and Gram-positive strains were once believed to be lack of T4SS. However, some recent studies revealed that one or more virB/D genes also exist in some kinds of Gram-positive bacteria and play similar role, and form a T4SS-like system[3]. The VirBl-like, VirB4, VirB6, and VirD4 genes were identified in the chromosome of Gram-positive bacterium Streptococcus suis in our previous studies and their role as important mobile elements for horizontal transfer to recipients in an 89 K pathogenicity island （PAl） was demonstrated[45]. However, their structure and molecular mechanisms in other strains, especially in Gram-positive strains, are remained unclear.

Assigning Real-Time Tasks in Environmentally Powered Distributed Systems

Harvesting energy for execution from the environment (e.g., solar, wind energy) has recently emerged as a feasible solution for low-cost and low-power distributed systems. When real-time responsiveness of a given application has to be guaranteed, the recharge rate of obtaining energy inevitably affects the task scheduling. This paper extends our previous works in?[1] [2] to explore the real-time task assignment problem on an energy-harvesting distributed system. The solution using Ant Colony Optimization (ACO) and several significant improvements are presented. Simulations compare the performance of the approaches, which demonstrate the solutions effectiveness and efficiency.

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.

A Concept of Dynamically Reconfigurable Real-time Vision System for Autonomous Mobile Robotics

This paper describes specific constraints of vision systems that are dedicated to be embedded in mobile robots. If PC-based hardware architecture is convenient in this field because of its versatility, flexibility, performance, and cost, current real-time operating systems are not completely adapted to long processing with varying duration, and it is often necessary to oversize the system to guarantee fail-safe functioning. Also, interactions with other robotic tasks having more priority are difficult to handle. To answer this problem, we have developed a dynamically reconfigurable vision processing system, based on the innovative features of Cleopatre real-time applicative layer concerning scheduling and fault tolerance. This framework allows to define emergency and optional tasks to ensure a minimal quality of service for the other subsystems of the robot, while allowing to adapt dynamically vision processing chain to an exceptional overlasting vision process or processor overload. Thus, it allows a better cohabitation of several subsystems in a single hardware, and to develop less expensive but safe systems, as they will be designed for the regular case and not rare exceptional ones. Finally, it brings a new way to think and develop vision systems, with pairs of complementary operators.