This paper addresses the problem of schedu ling reactive real-time tran saction s (task
groups) implementing a net work of extend ed Finite State Machines comm unicating …

Task scheduling for reactive real time systems is adifficult problem due to tight constraints
that theschedule must satisfy. A static priority schemeis proposed here that can be formally …

Static scheduling of tasks in embedded distributed real-time systems often implies a tediuos
iterative design process. The reason for this is the lack of exibility and expressive power in …

The problem of real-time scheduling spans a broad spectrum of algorithms from simple
uniprocessor to highly sophisticated multiprocessor scheduling algorithms. In this paper, we …

We present a resource conscious approach to designing distributed real-time systems. This
work extends our original solution (Gerber et al., 1995), which was limited to single …

Real-time system is playing an important role in our society. For such a system, sensitivity to
timing is the central feature of system behaviors, which means tasks in the systems are …

The objective of this paper is to present how to design a system that can accommodate
additional functionality with either no changes to the design or adding architectural modules …

Using two branch-and-bound (B&B) algorithms, an optimal solution is proposed to the
problem of allocating (or assigning with the subsequent scheduling considered) periodic …

In Shepard and Gagne (1991), a branch-and-bound implicit enumeration algorithm is
described whose purpose is to generate a feasible schedule, if any, for each processor on a …

In this paper, we present a power-conscious algorithm for jointly scheduling multi-rate
periodic task graphs and aperiodic tasks in distributed real-time embedded systems. While …