A task scheduling model of ttfc network and a method for generating message scheduling table

Abstract

The invention discloses a task scheduling model of a TTFC network and a method for generating a message scheduling table. The TTFC network task scheduling model comprehensively considers computing tasks running on end systems and communication tasks for data exchange through the network, and supports Time-Triggered (TT) traffic classes and Rate-Constrained (Rate-Constrained, RC) traffic Modeling of classes that support multicast communication. The model consists of network topology model, task, link tree, data frame model, and a set of task scheduling model constraints. The message scheduling table generation method of TTFC network designs a staged scheduling framework for TT tasks and RC tasks. In this method, the schedulability test of the task is performed first. If the test is passed, the specific scheduling table generation algorithm is called for the TT task to obtain the static scheduling table of the TT task. On this basis, it is checked whether the link has enough remaining bandwidth to complete the RC. Task scheduling, and finally obtain a static scheduling table that satisfies all constraints of the model, which solves the task scheduling problem in the TTFC network.

Description

technical field [0001] The invention relates to the research field of scheduling methods for time-triggered traffic types in TTFC networks belonging to the technical field of network communication, in particular to a task scheduling model in TTFC networks and a method for generating message scheduling tables. Background technique [0002] In recent years, network communication technology has developed rapidly in the fields of military, avionics systems, and manufacturing. The growing demand for networking means more complex network wiring, more congested information transmission, and higher costs. In an FC network, end systems communicate by exchanging Ethernet frames, and data frames are forwarded hop-by-hop through switches from sender to receiver. Usually when a data frame is forwarded to the same link at the same time, it is stored in a queue and sent according to the output scheduler. Therefore, switch queuing causes transmission delays, which in turn are further topol...

AI Technical Summary

Problems solved by technology

In terms of real-time performance, most of the existing message schedule generation algorithms for time-triggered networks only schedule network traffic, but in fact the real-time performance of distributed application systems depends on both the computing tasks on the end system and the network traffic on the link. Communication tasks, the real-time scheduling problem of distributed systems cannot be reduced to a single communication scheduling problem

In addition, most existing solutions for time-triggered networks only consider time-triggered traffic scheduling, and do not support rate-limited traffic scheduling; they only consider unicast applications, and do not support multicast applications enough, so they cannot meet more complex requirements. Application requirements

At present, the research on time-triggered network has just started, and further investment is needed for the designation of relevant standards and the design of FC network switch software.

Images