Heuristic techniques for allocating and scheduling communicating periodic tasks in distributed real-time systems

Faucou, Sébastien; Déplanche, Anne-Marie; Beauvais, J.-P.

doi:10.1109/wfcs.2000.882557

Cited by 15 publications

(11 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There are several reasons for using the GA approach. GA is a general optimisation method that has been used successfully for solving a wide variety of complex problems including scheduling, e.g., in [8] [9][10] [11]. It can also easily be extended to optimise on other attributes such as minimising the response time of handling an event.…”

Section: Introductionmentioning

confidence: 99%

Managing complex temporal requirements in real-time control systems

Sandström

Norström

Proceedings Ninth Annual IEEE International Conference and Workshop on the Engineering of Computer-Based Systems

View full text Add to dashboard Cite

Design and implementation of motion control applications includes the transition from control design to real-time system implementation. To make this transition smooth, the specification model for the real-time system should allow also for temporal requirements other than deadlines, e.g., deviation from nominal period time of an activity, end-to-end timing constraints, temporal correlation between different sampling tasks and constraints on temporal variations in output. Many realtime systems in industry today are based on pre-emptive priority based run-time systems, and hence, the temporal requirements should be fulfilled by correctly assigning attributes such as priorities and offsets to the tasks executing in such systems. Assigning priorities and offsets in order to fulfill complex temporal requirements originating from control design and computer system design is a hard task that should be supported by powerful methods and tools. In this paper we propose a method, which by assigning priorities and offsets to tasks guarantees that complex timing constraints can be met. In addition to the complex timing constraints, the method supports sporadic tasks, shared resources, and varying execution times of tasks. We present the idea and the implementation, which is based on a genetic algorithm, and illustrate the method by an example.

show abstract

Section: Introductionmentioning

confidence: 99%

Managing complex temporal requirements in real-time control systems

Sandström

Norström

Proceedings Ninth Annual IEEE International Conference and Workshop on the Engineering of Computer-Based Systems

View full text Add to dashboard Cite

show abstract

“…Zhao et al [11] use a BP neural network to predict the next transmission rate of cross traffic, and a more general MLP neural network has been applied to predict one-step-ahead round-trip delay time and packet loss successfully [6]. On the other hand, GA is successful in computing the typical constrained job-shop scheduling problem, such as the case in the Fieldbus control system [12] and the reconfiguration progress happened in NCS [13]. Therefore, based on the experiences of these works, we develop a novel reconfigurable scheduling architecture with integration of NN predictor and GA scheduler.…”

Section: Introductionmentioning

confidence: 99%

A hybrid neural-genetic approach for reconfigurable scheduling of networked control system

Chen

Zhou

Zhu

2009

Proceedings of the First ACM/SIGEVO Summit on Genetic and Evolutionary Computation

View full text Add to dashboard Cite

In this paper, a novel approach for networked control system (NCS) task scheduling is proposed. The proposed neural-genetic method utilizes the information about the quality of service (QoS) over the communication network and enables online reconfigurable scheduling on distributed environment. In this way the NCS's bandwidth can be shared properly among different parallel control tasks. For NCS, two significant factors of QoS that affect validity of scheduling results are the packet loss and delay, which occurred in the communication among tasks. By adopting a Elman neural network based prediction model, the one-step ahead packet loss and time delay are obtained. The knowledge about the predict QoS factors, combined with the task execution features and the resources available in the system, are used as an entry to improve the decisions of the proposed scheduling algorithm. Such algorithm uses genetic algorithm techniques to find out the appropriate task scheduling scheme to adapt changes of application and communication circumstance. The proposed neural-genetic approach is evaluated through simulation by using a model parameterized with the features obtained from a real scenario of Ethernet based control system. The simulation results clearly show the effectiveness of the proposed approach in solving the task scheduling problems in NCS.

show abstract

“…There are studies to solve these problems. Those studies can be divided into three categories: scheduling for tasks in a processor [1][2][3][4][5], scheduling for messages via a network [6][7][8][9][10], and adjusting parameters of tasks and messages to guarantee end-to-end constraints [11][12][13]. Researches belonging to third category are intended to solve the design problem of distributed control system, which is known as NP-hard in decision problems [14].…”

Section: Introductionmentioning

confidence: 99%

“…In A conference version of this paper has been presented in 2002 Asian Control Conference held in Singapore. [11], a method for scheduling distributed control system consisting of CSMA/CA and TDMA networks was proposed using a genetic algorithm and a clustering algorithm. But this method is difficult to apply to the practical systems because it does not consider precedence constraints between tasks and messages.…”

Section: Introductionmentioning

confidence: 99%

Period And Priority Assignment Method For Dcs Design

Kim

Park

2003

Asian Journal of Control

View full text Add to dashboard Cite

Distributed control systems (DCS) used in industry environments consist of sensors, actuators, and controllers that are connected with a fieldbus. It is difficult to design the DCS while guaranteeing the time‐critical requirements because of both communication delays due to the fieldbus and computation delays due to many tasks executed in one node. This paper proposes a priority assignment method and a period assignment method that find the shortest periods of control loops and guarantee the end‐to‐end constraints such as precedence constraints and timing constraints. Also, a DCS design method is presented by using the proposed two assignment methods. The presented design method considers the worst‐case response times of tasks and messages simultaneously and is applicable to a practical DCS, which consists of several constraints. The design method is validated by examples.

show abstract

Heuristic techniques for allocating and scheduling communicating periodic tasks in distributed real-time systems

Cited by 15 publications

References 11 publications

Managing complex temporal requirements in real-time control systems

Managing complex temporal requirements in real-time control systems

A hybrid neural-genetic approach for reconfigurable scheduling of networked control system

Period And Priority Assignment Method For Dcs Design

Contact Info

Product

Resources

About