Message load balancing method of 1553B bus

Abstract

The invention relates to a message load balancing method of a 1553B bus, and belongs to the technical fields of avionics and satellite navigation. The method performs rational organization on transmitted 1553B message blocks. Specifically, message transmission major cycle (maximum transmission cycle) and a minor cycle (minimum transmission cycle) on the 1553B bus are firstly determined. In a major cycle, the shorter the cycle of information transmission is, the higher the transmission number is. Therefore, in load balancing scheduling of messages, balancing scheduling on transmission time phase is started from the shortest cycle in which transmission number is highest, and then the messages of the second shortest cycle are scheduled, until scheduling is completed. The scheduling method reduces average delay rate of the bus, balances bus load, and achieves optimal communication efficiency.

Description

technical field [0001] The invention relates to the technical fields of avionics and satellite navigation, in particular to a message load balancing method of a 1553B bus. Background technique [0002] Since the equipment system has high requirements on real-time and reliability, it is necessary to ensure the real-time performance of message transmission on the 1553B bus. When multiple messages of different lengths and periods need to be processed on the 1553B bus, and there are asynchronous messages to be processed, it is generally difficult to guarantee the real-time performance of the system. At present, the more common 1553B bus message optimization algorithms include calculation-based vector algorithm, RMS scheduling algorithm, long release time interval priority algorithm, HTSF algorithm, etc. In the above methods, both the calculation-based vector algorithm and the RMS scheduling algorithm are based on static load balancing, which does not solve the problem of dynami...

AI Technical Summary

Problems solved by technology

In the above methods, both the calculation-based vector algorithm and the RMS scheduling algorithm are based on static load balancing, which does not solve the problem of dynamic load balancing of messages. When there are many aperiodic messages on the bus, it is easy to cause bus congestion or saturation; The release time interval priority algorithm cannot guarantee that messages with a small release interval or burst messages can be scheduled before the deadline; the HTSF algorithm does not consider the situation that multiple messages may arrive at the same time at the same time, and the algorithm execution efficiency is low

Images