In conventional database systems, performance is primarily measured by the number of transactions completed within a unit time. In real-time applications, timing and criticality characteristics of transactions must be taken into account. In this paper, we examine the performance of StarBase, a firm real-time database system. The deadline guarantee ratio and average response times are the primar...

This paper introduces and assesses novel strategies to schedule firm semi-periodic real-time tasks. Jobs are released periodically have the same relative deadline. Job execution times obey an arbitrary probability distribution can take either bounded or unbounded values. We investigate several optimization criteria, most prominent being <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xml...

The emergence of multimedia and high-speed networks has expanded the class of applications that combine the timing requirements of hard real-time applications with the need for operating system services typically available only on soft-real time or timesharing systems. These applications, which we describe as firm real-time, currently have no widely-available, low-cost operating system to suppo...

Date: 1st October 1996 Slide: 1-1 University of Skovde Technology Transfer: Real-time systems and databases Overview Model of real-time systems Basic concepts Dependability concepts Resource allocation Scheduling Real-time database { concurrency control { recovery { weakening of the ACID properties Date: 1st October 1996 Slide: 2 University of Skovde Technology Transfer: Real-time systems and...

The problem addressed by this paper is that real-time embedded software today is commonly built using programming abstractions with little or no temporal semantics. The paper discusses the use of an extension to the Ptolemy II framework as a coordination language for the design of distributed real-time embedded systems. Specifically, the paper shows how to use modal models in the context of the...