CN106878132B - Bus scheduling method based on period and priority - Google Patents

Bus scheduling method based on period and priority Download PDF

Info

Publication number
CN106878132B
CN106878132B CN201710083541.9A CN201710083541A CN106878132B CN 106878132 B CN106878132 B CN 106878132B CN 201710083541 A CN201710083541 A CN 201710083541A CN 106878132 B CN106878132 B CN 106878132B
Authority
CN
China
Prior art keywords
scheduling
period
network
bus
priority
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201710083541.9A
Other languages
Chinese (zh)
Other versions
CN106878132A (en
Inventor
刘靖
郑云龙
冷佳鹏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Catic General Technology Co Ltd
Original Assignee
Beijing Catic General Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Catic General Technology Co Ltd filed Critical Beijing Catic General Technology Co Ltd
Priority to CN201710083541.9A priority Critical patent/CN106878132B/en
Publication of CN106878132A publication Critical patent/CN106878132A/en
Application granted granted Critical
Publication of CN106878132B publication Critical patent/CN106878132B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40Bus networks
    • H04L12/403Bus networks with centralised control, e.g. polling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/62Queue scheduling characterised by scheduling criteria
    • H04L47/625Queue scheduling characterised by scheduling criteria for service slots or service orders

Abstract

The invention discloses a bus network scheduling method based on period and priority, which comprises the following steps: dividing a bus network scheduling period into a determined scheduling section and a competition scheduling section, wherein the determined scheduling section is used for transmitting small data blocks with a specific period, and the competition scheduling section is used for transmitting large data blocks with the specific period; the non-periodic messages are divided into high-priority non-periodic messages and low-priority non-periodic messages according to priorities, the high-priority non-periodic messages can be inserted into the whole bus network scheduling period at any time, and the current executing periodic messages or the low-priority non-periodic messages are interrupted; for low priority aperiodic messages, they can only be inserted in the contention scheduling segment. The invention can give consideration to the data scheduling of various modules contained in the bus network with different rates and priorities, reduces the network scheduling delay and improves the utilization rate of the bus network bandwidth.

Description

Bus scheduling method based on period and priority
Technical Field
The invention relates to the technical field of network communication and high-speed buses, in particular to a bus scheduling method based on cycles and priorities.
Background
The high-speed data bus technology is a key technology of an avionics system, the avionics system is a brain and a neural center of a modern airplane, an airborne bus network is a key neural network of the modern airplane, airborne network transmission is triggered based on time and events, but the traditional bus technology does not give consideration to processing between the time and the events so as to achieve a balanced state, for example, an MIL-STD-1553 bus is carried out in a complete time slice mode for bus scheduling, and an FC bus is based on event scheduling.
The airborne bus network is a complex network, the bus comprises modules with various rates, the data volume of each module is different, the data blocks have priorities, and the traditional scheduling mode cannot give consideration to the processing aspects in the aspects.
The network scheduling delay is the key of the airborne network, the scheduling delay directly affects the utilization rate of network bandwidth, when the scheduling average delay is too large, the network data throughput cannot be met, and the requirements have to be met by increasing the bandwidth and other cost improving modes. Therefore, how to consider time and events, reduce network scheduling delay and improve the utilization rate of the bus bandwidth is the technical problem to be solved by the invention.
Disclosure of Invention
In view of the above-mentioned deficiencies of the prior art, the present invention provides a bus scheduling method based on cycles and priorities.
According to an aspect of the present invention, there is provided a bus scheduling method based on cycles and priorities, the method including: the bus is scheduled according to periods, each scheduling period is divided into a determined scheduling section and a competitive scheduling section, and for messages to be scheduled with high priority, the messages to be scheduled can be scheduled at any time in the determined scheduling section and the competitive scheduling section, and other messages with low priority which are currently executed are interrupted; for messages to be scheduled with low priority, they can be scheduled only in the contention scheduling segment.
According to another aspect of the present invention, the certain scheduling segment is used for transmitting a small data block having a specific period, and the contention scheduling segment is used for transmitting a large data block having a specific period.
According to another aspect of the invention, the transmission priority of the low-priority aperiodic message is higher than that of the periodic message in the contention scheduling segment and lower than that of the high-priority aperiodic message.
According to another aspect of the invention, the bus cycles are timed by the network controller, a cycle start packet is sent at the arrival of each new cycle, and the scheduled segments are determined to be at the start of each cycle. The network controller broadcasts the remaining time of the current network cycle through the network synchronization packet, each network node reloads the cycle time down counter after receiving the network synchronization packet, and waits for the next cycle to start transmission when the time value of the down counter is not enough to send a non-periodic message.
According to another aspect of the invention, small blocks of data having a particular period are transmitted in a time-triggered manner in certain scheduled segments, with a fixed transmission once per bus cycle. Large data blocks with a specific period are transmitted in a contention scheduling section in an event-triggered manner, a plurality of possible large data blocks are polled in each bus network period, if any, the data is transmitted until the bus network period is finished, and if the data blocks are large, the polling can be continued in the next period and the data can be transmitted through a plurality of continuous bus periods.
Compared with the prior art, the invention can give consideration to the data scheduling of various modules contained in the bus network with different rates and priorities, reduce the network scheduling delay and improve the utilization rate of the bus network bandwidth.
Drawings
FIG. 1 is a schematic diagram of a bus network scheduling cycle according to the present invention.
Detailed Description
The present invention is described in further detail below with reference to the attached drawing figures.
The invention designs a new scheduling mode aiming at the existing network triggering conditions, considers the characteristics of data transmitted on a bus, such as complex length, periodicity, burstiness, priority and the like, and designs an effective method for reducing scheduling delay and improving bus efficiency.
Network scheduling requires a node as a network controller, and the network controller realizes network cycle control, network cycle packet broadcasting, cycle message network scheduling and network head segment instruction list functions.
The scheduling is implemented by a periodic method, as shown in fig. 1, the bus scheduling period message is divided into the following two parts according to the size of the data block:
1. determining a scheduling segment
The scheduling segment is determined to be the determined scheduling segment time in one period, the scheduling segment is determined to be located at the starting position of each period, and the period interval has certainty, so that the scheduling segment execution period message is determined to have good period characteristics and is suitable for transmitting small data blocks with a specific period.
2. Contention scheduling segment
The contention scheduling section is a contention scheduling section time in one period, is suitable for transmitting a large data block having a specific period, and may schedule one period to transmit a plurality of messages or a plurality of periods to transmit one message according to the size and the periodic characteristics of the data block.
The bus scheduling non-periodic message is also divided into two stages according to the priority, and the two stages are respectively as follows:
1. high priority transmission zone
The high-priority transmission area is used for transmitting high-priority aperiodic messages, the aperiodic messages are emergencies in the network, and the emergencies are divided into two priorities, namely high priority and low priority. High priority means that the network device is required to respond as quickly as possible, so that a high priority message can be inserted at any time throughout a bus cycle, interrupting a currently executing periodic message or a low priority aperiodic message.
Network interrupts are similar to software and hardware interrupts, message vectors in computers, and belong to high priority aperiodic messages in a cycle. The nodes in the network can initiate network interruption, and after receiving the network interruption, the network controller triggers network interruption scheduling according to the network interruption vector, wherein the scheduling mode has the highest priority and is suitable for the emergency of the nodes in the network. The data blocks of the network interrupt data frame are small, so that the maximum real-time performance can be achieved.
2 low priority transmission area
The low priority transmission area is used for transmitting low priority non-periodic messages, the time of the low priority execution area is coincident with the time of the competitive scheduling section, but the transmission priority of the low priority non-periodic messages is greater than the periodic messages in the competitive scheduling and less than the high priority non-periodic messages.
The network synchronization packet is the starting point of the scheduling mode of the invention, the network controller times the network period and sends a period starting packet when each new period arrives; and after the scheduling section is determined to be completed, sending a network low-priority initial packet until a new period starts to send a period initial packet, and simultaneously broadcasting the remaining time of the current network period by a network synchronization packet.
And (3) network period synchronization, wherein each network node reloads a period time down counter after receiving a network synchronization packet, and when the time value of the down counter is less than the time value of a sent non-periodic message, the next period is required to be waited for starting transmission.
Periodic small data block transmission
The periodic data of the small data blocks with low bandwidth is executed in a time-triggered mode in a determined scheduling section, and is fixedly transmitted once in each bus period. Although each cycle needs to be transmitted, the data volume is not large, the occupied bandwidth is small, and the data can be scheduled only once every several bus cycles according to the cycle characteristics of the data block, so that the occupied bandwidth is further reduced.
Periodic large data block transmission
And executing the large data block high-bandwidth periodic data in a competitive scheduling section in an event triggering mode. Polling is performed for a number of possible large data blocks in each bus network cycle, and if there is data, a certain amount of data is transmitted until the end of the bus network cycle. If the data block is large, polling may continue in the next cycle, with transmissions occurring over several consecutive bus cycles.
Aperiodic high priority data block transmission
The non-periodic high-priority data block is transmitted in a high-priority transmission area, a network node can initiate a high-priority non-periodic message at any time, and the non-periodic high-priority data block has high priority and is used for the node to actively initiate the transmission of the small data block emergency message.
Aperiodic low priority data block transmission
The non-periodic low-priority big data is transmitted in the low-priority transmission area, the network node can initiate the non-periodic low-priority data after receiving the network low-priority synchronous packet, and the deterministic periodic transmission is completed, so the non-periodic low-priority data can initiate any large amount of data transmission under the condition that the bandwidth of the exchange interconnection equipment is enough until the network period starting packet is received.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks. It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims (6)

1. A bus scheduling method based on cycle and priority is characterized in that scheduling is controlled by a network controller on a bus, and the network controller realizes network cycle control, network cycle packet broadcasting and cycle message network scheduling functions; the network controller times a bus network period, sends a period starting packet when each new period arrives, each scheduling period is divided into a determined scheduling section and a competitive scheduling section, the determined scheduling section is located at the starting position of each period, sends a network low-priority starting packet after the determined scheduling section is completed, and switches the bus network period into the competitive scheduling section; for the messages to be scheduled with high priority, scheduling can be carried out at any time in the determined scheduling section and the competitive scheduling section, and other messages with low priority which are currently executed are interrupted; for messages to be scheduled with low priority, they can be scheduled only in the contention scheduling segment.
2. The cycle and priority based bus scheduling method of claim 1, wherein the certain scheduling segment is used for transmitting a small data block having a specific cycle, and the contention scheduling segment is used for transmitting a large data block having a specific cycle.
3. The method for bus scheduling based on cycles and priorities as claimed in claim 2, wherein the transmission of the low priority aperiodic message has a priority greater than the periodic message in the contention scheduling segment and less than the high priority aperiodic message.
4. The cycle and priority based bus scheduling method of claim 3, wherein the network controller further broadcasts the remaining time of the current bus cycle via a network synchronization packet, each network node reloads its own cycle time down counter after receiving the network synchronization packet, and waits for the next cycle to start transmission when the time value of the down counter is not sufficient to send a non-periodic message.
5. The method of claim 4, wherein the small data blocks with a specific period are transmitted in a time-triggered manner in the deterministic scheduling segments, and are transmitted constantly once per bus period.
6. A method according to claim 5, wherein large blocks of data with a specific period are transmitted in a contention scheduling section in an event-triggered manner, a plurality of possible large blocks of data are polled in each bus period, if any, until the end of the bus period, and if the blocks are large, the polling in the next period can be continued for transmission over several consecutive bus periods.
CN201710083541.9A 2017-02-16 2017-02-16 Bus scheduling method based on period and priority Active CN106878132B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710083541.9A CN106878132B (en) 2017-02-16 2017-02-16 Bus scheduling method based on period and priority

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710083541.9A CN106878132B (en) 2017-02-16 2017-02-16 Bus scheduling method based on period and priority

Publications (2)

Publication Number Publication Date
CN106878132A CN106878132A (en) 2017-06-20
CN106878132B true CN106878132B (en) 2020-01-07

Family

ID=59166609

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710083541.9A Active CN106878132B (en) 2017-02-16 2017-02-16 Bus scheduling method based on period and priority

Country Status (1)

Country Link
CN (1) CN106878132B (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109298917B (en) * 2017-07-25 2020-10-30 沈阳高精数控智能技术股份有限公司 Self-adaptive scheduling method suitable for real-time system mixed task
JP6981290B2 (en) * 2018-02-14 2021-12-15 オムロン株式会社 Slave device, control system, response data communication method, and response data communication program
WO2020202850A1 (en) * 2019-04-01 2020-10-08 株式会社デンソー Information processing device
CN110149259B (en) * 2019-05-09 2021-09-14 中国航空工业集团公司西安航空计算技术研究所 GJB289A bus scheduling method and device based on hybrid triggering
CN111090600B (en) * 2019-12-09 2021-07-16 苏州浪潮智能科技有限公司 Bus sharing method
CN111478838B (en) * 2020-04-08 2021-12-21 浙江中控研究院有限公司 High-efficiency high-bandwidth communication method and system
CN113783773B (en) * 2021-11-12 2022-03-11 北京国科天迅科技有限公司 Message scheduling method and system
CN114363107A (en) * 2021-12-29 2022-04-15 上海联影医疗科技股份有限公司 Time-sharing scheduling method and system for controller area network bus

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105141552A (en) * 2015-09-14 2015-12-09 中国航空无线电电子研究所 Data scheduling and transmitting method supporting time trigger mechanism in FC switch
CN105991384A (en) * 2016-06-23 2016-10-05 天津大学 Communication method for aerospace Ethernet compatible with time-triggered Ethernet and 1553B
CN106101021A (en) * 2016-05-31 2016-11-09 河南理工大学 A kind of Ethernet system functional device perform dispatching method in real time

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105141552A (en) * 2015-09-14 2015-12-09 中国航空无线电电子研究所 Data scheduling and transmitting method supporting time trigger mechanism in FC switch
CN106101021A (en) * 2016-05-31 2016-11-09 河南理工大学 A kind of Ethernet system functional device perform dispatching method in real time
CN105991384A (en) * 2016-06-23 2016-10-05 天津大学 Communication method for aerospace Ethernet compatible with time-triggered Ethernet and 1553B

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
Combining event-triggered and time-triggered traffic in FTT-CAN: analysis of the asynchronous messaging system;P. Pedreiras;《2000 IEEE International Workshop on Factory Communication Systems. Proceedings 》;20000908;全文 *
Latency analysis for the cooperation of event and time-triggered networks;Sebastian Zug et al;《 2008 IEEE International Workshop on Factory Communication Systems》;20080523;全文 *
MIL_STD_1553B总线上的实时调度算法;蒲舰舸等;《成都信息工程学院学报》;20051025;全文 *
电动汽车TTCAN总线技术研究;王欢;《中国优秀博硕士学位论文全文数据库 (硕士)工程科技Ⅱ辑》;20060915(第9期);全文 *

Also Published As

Publication number Publication date
CN106878132A (en) 2017-06-20

Similar Documents

Publication Publication Date Title
CN106878132B (en) Bus scheduling method based on period and priority
CN110601997B (en) Time division multiplexing method for mixed flow fusion
CN112737979B (en) Best effort flow scheduling method for time sensitive network
US9197576B2 (en) Method and apparatus for allocating and prioritizing data transmission
CN107092521B (en) Distributed task scheduling method, device and system
Nguyen et al. Real-time communication for manufacturing cyber-physical systems
US20100195491A1 (en) Bounded minimal latency for network resources without synchronization
WO2006098688A1 (en) Wlan transmit scheduler comprising an accelerated back-off function
JP7394986B2 (en) Method of transmitting data packets and apparatus for implementing this method
TW200307433A (en) Flexible scheduling architecture
WO2020077568A1 (en) Time-frequency resource contention method, apparatus, device and system for direct-connection communication
CN111836312B (en) Resource reservation method and equipment based on competition
CN113411242B (en) Asynchronous multi-priority scheduling processing method under time trigger mechanism
CN109450817B (en) Mixed scheduling method for time-triggered Ethernet multi-service message transmission
CN109525315B (en) Optical fiber channel network end system based on time triggering
CN111988345B (en) Information synchronization method and device
EP3166257B1 (en) Start-up triggering in an ethernet-based in-vehicle network
EP2721897B1 (en) Contention based access of resources in a wireless network
CN109167738B (en) Method and apparatus for scheduling communication data
CN110809012B (en) Train network communication data scheduling control method
CN115150340A (en) Method and device for dynamically adjusting message queue weight
CN108111428B (en) Congestion control method and device
US10404602B2 (en) Transmission apparatus and transmission processing method
CN103873386A (en) Method for managing network transmission sequence
CN114448546B (en) Scheduling method of time-triggered network message based on timer

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant