In this paper, we introduce the target scenario of our HELISCOPE project with the emphasis on the four modes for flying-camera task. We also explain the control points that are considered as the interfaces where the on-flight embedded software and mechanical implementation of the unmanned helicopter are contacted for the autopilot necessarily used in performing such as various modes of flying-camera tasks. Being related to real-time issues, we are developing a real-time S/W platform based on TMO (time-triggered and message-triggered object) scheme. We, in this paper, explain the clues in becoming to use the TMO mode with the survey of other on-flight real-time S/W platform researches.

Timeliness-guaranteed computing considering the worst case can hardly be accomplished at run time because of the uncertainty caused by resource sharing, asynchronous events and conflicting timing constraints between tasks. An easier way to reach it is to do some off-line analysis from design time with predictable characteristics of tasks. The TMO model supporting time-triggered (SpM) and message-triggered (SvM) member-threads is a well-known real-time object-oriented task model that aims the design-time guaranteed computing. In this paper, a new efficient task serializer that allocates the executions of time-triggered periodic tasks of multiple TMOs without delay and preemption to avoid resource conflicts is presented. The serializer tries to find scheduling scenarios in that each SpM is executed at its exact trigger-time without delay based on the given WCET. This is done by recasting the initial offsets of SpMs to avoid overlaps of executions. And several methods to handle SvMs according to the types of SvMs using the serializer are also proposed.

In this paper, we present an application of self-healing systems in the form of service request optimization algorithm for service gateways. This algorithm preestimates the load of the gateway and accepts the service request according to the capability of the worker thread. The experimental and simulation results show that the performance of load control algorithm works well for managing the service request. Our study has revealed that normally the networks fail to entertain the requests after the saturation point. Whereas the algorithm proposed in this paper, virtually accepts the service requests almost always which is what is essentially required from hybrid network in a ubiquitous environment. The algorithm proposed is already embedded and are in work in the IT infrastructure of major banks of Korea.

This paper proposes the TMO model-based monitoring structure (TMS) for monitoring TMO model-based real-time systems. The monitoring infrastructure configured through TMS is managed by the middleware layer, allowing for automatic monitoring and ease of deployment. In addition, since TMS is designed to utilize proven distributed capabilities enabled by the TMO model, it allows for stable, distributed monitoring on the TMO systems. As the results of experiments indicate, TMS instrumentation overhead on the execution of middleware threads and TMO methods does not exceed 1ms. This means TMS has little or no effect on the operation of the middleware and TMO methods. As such, TMS is a suitable structure for monitoring TMO systems in a stable manner

As various kinds of embedded systems (or devices) become widely available, research on home network middleware which can access and control embedded home appliances are actively being progressed. However, there is a significant problem in applying the home network technology to embedded systems because of their limited storage space and low computing power. In order to enhance the practicality of home network middleware, various technical demands have been recently emphasized such as mobility and lightweight. In this paper, we present a lightweight middleware for home network on embedded systems. Also, we propose a mechanism for mobility management which adopts the anycast technology.

The authors examine a priority driven two-phase lock protocol called the read/write priority ceiling protocol. It is shown that this protocol leads to freedom from mutual deadlock. In addition, a high-priority transactions can be blocked by lower priority transactions for at most the duration of a single embedded transaction. These properties can be used by schedulability analysis to guarantee that a set of periodic transactions using this protocol can always meet its deadlines. Finally, the performance of this protocol is examined for randomly arriving transactions using simulation studies.>