Probabilistic Real-Time Data Access with Deadline and Interval Constraints

In this chapter, we address the issues of real-time data access in the context of manufacturing control applications using a combination of simulations and measurements based on the University of Michigan Open-Architecture Controller (UMOAC) testbed. Figure 1 shows the basic control loop of a typical real-time application. The controller takes the input (e.g., the desired position and velocity) from the user and the feedback (e.g., the actual position and velocity) from the controlled process, and computes a new control command to send to the controlled process. An open-architecture controller consists of a set of cooperative tasks, e.g., sensor-reading tasks and control-law tasks, and needs a database management system (DBMS) to support concurrent data access and to provide well-defined interfaces between different software modules [14, 23]. Typically these tasks are subject to a range of timing constraints, which require the DBMS to provide timing guarantees, sometimes under complex operating conditions.

[1]  Parameswaran Ramanathan,et al.  Real-time computing: a new discipline of computer science and engineering , 1994, Proc. IEEE.

[2]  Michael Pinedo,et al.  Stochastic Scheduling with Release Dates and Due Dates , 1983, Oper. Res..

[3]  Peter P. Puschner,et al.  Developing real-time tasks with predictable timing , 1992, IEEE Software.

[4]  John A. Muckstadt,et al.  Stochastic Analysis of Cyclic Schedules , 1993, Oper. Res..

[5]  Lei Zhou,et al.  Performance evaluation of modular real-time controllers , 1996 .

[6]  Wei Zhao,et al.  Performance evaluation of a bandwidth allocation scheme for guaranteeing synchronous messages with arbitrary deadlines in an FDDI network , 1993, 1993 Proceedings Real-Time Systems Symposium.

[7]  Miron Livny,et al.  Earliest deadline scheduling for real-time database systems , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[8]  David Lorge Parnas,et al.  Scheduling Processes with Release Times, Deadlines, Precedence, and Exclusion Relations , 1990, IEEE Trans. Software Eng..

[9]  Lei Zhou,et al.  OODB Support for Real-Time Open-Architecture Controllers , 1995, DASFAA.

[10]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[11]  Debasis Mitra,et al.  Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics , 1984, JACM.

[12]  Vincenzo Grassi,et al.  On the Optimal Checkpointing of Critical Tasks and Transaction-Oriented Systems , 1992, IEEE Trans. Software Eng..

[13]  Jane W.-S. Liu,et al.  Scheduling Periodic Jobs That Allow Imprecise Results , 1990, IEEE Trans. Computers.

[14]  Krithi Ramamritham,et al.  Preemptive Scheduling Under Time and Resource Constraints , 1987, IEEE Transactions on Computers.

[15]  Wei-Kuan Shih,et al.  Algorithms for scheduling imprecise computations , 1991, Computer.

[16]  Young-Kuk Kim,et al.  Predictability and consistency in real-time database systems , 1995 .

[17]  Young-Kuk Kim,et al.  Predictability and consistency in real-time transaction processing , 1995 .

[18]  Donald F. Towsley,et al.  A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System , 1989, IEEE Trans. Computers.

[19]  Kwei-Jay Lin,et al.  Scheduling Real-Time Computations with Separation Constraints , 1992, Inf. Process. Lett..

[20]  Krithi Ramamritham,et al.  Distributed Scheduling of Tasks with Deadlines and Resource Requirements , 1989, IEEE Trans. Computers.

[21]  Arbee L. P. Chen,et al.  A probabilistic approach to query processing in heterogeneous database systems , 1992, [1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing.

[22]  Kwei-Jay Lin,et al.  Scheduling distance-constrained real-time tasks , 1992, [1992] Proceedings Real-Time Systems Symposium.