| 1. |
- Nolte, Thomas, et al.
(författare)
-
Introducing Substitution-Queries in Distributed Real-Time Database Management Systems
- 2005
-
Ingår i: IEEE International Conference on Emerging Technologies and Factory Automation, ETFA. - 9780780394025 ; , s. 707-714
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- This paper introduces query mechanisms that allow automotive control-systems (using a distributed real-time database management system(RTDBMS)) to be queried, monitored and stimulated during run-time without violating its temporal properties. The mechanisms are completely transparent to the control application since they are handled by the RTDBMS. The COMET RTDBMS is extended with ad hoc capabilities to support the introduction of subscription and substitution queries, which are used for monitoring and stimulation. These queries are intended to be used by service and calibration tools to help in the development and maintenance of modern automotive systems. Using these queries could reduce development costs, result in higher quality of the system design and consequently yield higher reliability.
|
|
| 2. |
- Nolte, Thomas, et al.
(författare)
-
Real-time server-based communication with CAN
- 2005
-
Ingår i: IEEE Transactions on Industrial Electronics. - 0278-0046 .- 1557-9948. ; 1:3, s. 192-200
-
Tidskriftsartikel (refereegranskat)abstract
- This paper investigates the concept of share-driven scheduling of networks using servers with real-time properties. Share-driven scheduling provides fairness and bandwidth isolation between predictable as well as unpredictable streams of messages on the network. The need for this kind of scheduled real-time communication network is high in applications that have requirements on flexibility, both during development for assigning communication bandwidth to different applications, and during run-time to facilitate dynamic addition and removal of system components. We illustrate the share-driven scheduling concept by applying it to the popular controller area network (CAN). We propose a scheduling mechanism that we call simple server-scheduled CAN (S-3-CAN), for which we also present an associated timing analysis. Additionally, we present a variant of S'-CAN called periodic server-scheduled CAN (PS2-CAN), which for some network configurations gives lower worst-case response-times than S-3-CAN. Also for this improvement, a timing analysis is presented. Moreover, we use simulation to evaluate the timing performance of both S-3-CAN and PS2-CAN, comparing them with other scheduling mechanisms.
|
|
