Locking-based concurrency control algorithms are often proposed as an alternative to optimistic algorithms for real-time database systems. Many of them suffer from the costs of transaction restarts, usually having influence on the system performance. We propose a new method called partial abort aimed to minimize the costs of restarts by saving the part of previously performed work, which is ind...

Fault tolerance and fault recovery are integral parts of real-time systems. The literature addresses the issue of fault recovery via two main methods. One is hardware redundancy, and the other is achieved through task replication. Although lots of research has been done in this area, most of the work fell within one of the two streams, or as a combination of both. One point that did not have en...

Real-Time Database Systems (RTDBSs), have attracted considerable amount of research attention in the recent past and a number of important applications have been identi ed for such systems, such as telecommunications network management, automated air tra c control, automated nancial trading, process control and military command and control systems. Due to the rapidity of change of the system st...

In this research project the performance of two well-known scheduling policies for Real Time Systems based on fixed priority, namely Enhanced (m,k)-firm Guarantee and Weakly hard scheduling, will be compared in terms of the overall schedulibility of a number of randomly generated task sets . Both methods are based on the common assumptions. A new scheduling alogrithm will then be derived by com...

This paper1 presents linear time, on-line algorithms which guarantee and jointly schedule firm aperiodic, hard sporadic and periodic tasks in fixedpriority real-time systems. We develop and capitalize on a methodology which computes the spare capacity Z(a; b) exactly in time (n), for arbitrary schedule intervals [a; b), which, to the best of our knowledge, is the first linear time algorithm rep...

Systems-on-Chip (SoC) complexity increases as a growing number of applications are integrated and executed on contemporary systems. These applications consist of communicating tasks mapped on heterogeneous multi-processor platforms with distributed memory hierarchies that strike a good balance between performance, cost, power consumption and flexibility [1], [2]. Complexity is further increased...

Systems-on-Chip (SoC) complexity increases as a growing number of applications are integrated and executed on sophisticated multi-processor systems that strike a balance between performance, cost, power consumption and flexibility [4, 6]. Complexity is further increased by an increasing number of concurrently executing applications, which result in a large number of possible use-cases. The appl...

Systems-on-Chip (SoC) complexity increases as a growing number of applications are integrated and executed on contemporary systems. These applications consist of communicating tasks mapped on heterogeneous multi-processor platforms with distributed memory hierarchies that strike a good balance between performance, cost, power consumption and flexibility [1], [2]. Complexity is further increased...

In many real time applications, security is an important requirement, since the system maintains sensitive information to be shared by multiple users with different security levels. A secure real-time database system must satisfy not only logical data consistency but also the timing constraints and security requirements associated with transactions. Even though an optimistic concurrency control...

Energy reduction is critical to increase the mobility and battery life for today’s pervasive computing systems. At the same time, energy reduction must be subject to the real-time constraints and quality of service (QoS) requirements for applications running on these systems. This paper presents a novel run-time approach to reduce the system-wide energy consumption for such systems using dynami...