CN103684948B - A kind of 1553B bus list sorting optimization method - Google Patents
A kind of 1553B bus list sorting optimization method Download PDFInfo
- Publication number
- CN103684948B CN103684948B CN201310687111.XA CN201310687111A CN103684948B CN 103684948 B CN103684948 B CN 103684948B CN 201310687111 A CN201310687111 A CN 201310687111A CN 103684948 B CN103684948 B CN 103684948B
- Authority
- CN
- China
- Prior art keywords
- message blocks
- message
- cycle
- list
- time
- 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
Links
Abstract
The present invention proposes a kind of 1553B bus list sorting optimization method.The method is all message blocks in message blocks list to be resequenced: for arbitrary message blocks M in messaging list, be arranged according to following flow process: (1) calculates the maximum delay time of message blocks M and the ratio b of minor cycle；Determine the minor cycle scope at place when message blocks M arranges for [(x 1) * b, x*b)；(2) according to the minor cycle scope at message blocks M place, arranged in the range of message blocks M is arranged in the current minor cycle in message transmission the shortest minor cycle used time；(3) the transmission time t of message blocks M is accumulated in this minor cycle with in the transmission time；And check the whether value more than Min_Cycle with the transmission time, it is finally completed the arrangement of bus table.The method is simply effective, and the bus table generated by the method directly can be used by bus control unit, and meets application to message blocks function and the requirement of performance.
Description
Technical field
The invention belongs to 1553B application, be specifically related to a kind of 1553B bus list sorting optimization method.
Background technology
Bus table is the core application technology of 1553B, and it applies the description information to message blocks according to system,
Generating command sequence according to specific sorting consistence method, bus control unit (BC) is by performing command sequence
The transmission of completion message, and ensure the application requirement to message time determinability.
1553B message blocks includes message source, purpose, data word length, message cycle and maximum delay time
Deng.Bus list sorting optimization method, with message blocks for input, by sequence, optimizes, generates and meet message
Functional characteristic and time response and the bus table that directly can be used by bus control unit.Bus list sorting
The quality of optimization method directly affects time delay and the bus load of message transmission.
Summary of the invention
The present invention proposes a kind of 1553B bus list sorting optimization method, and the method is according to the message of message blocks
The information such as type (MSG_TYPE), data word length (MSG_LEN), maximum delay time (Max_Delay),
Message blocks is reasonably arranged, it is ensured that message is performed in the maximum delay time allowed.
Technical scheme is as follows:
A kind of 1553B bus list sorting optimization method, including:
All message blocks in message blocks list are resequenced according to following rule: according to message blocks
Maximum delay time Max_Delay arranges from small to large；For the message blocks that maximum delay time is identical,
Arrange from small to large according to transmission data word length；Equal for maximum delay time and transmission data word length
Identical situation, arranges according to its sequence number in message blocks list；
The transmission time t of message blocks calculates according to type of message and the transmission data word length of message blocks；
Transmission time t according to each bar message blocks and maximum delay time Max_Delay, drew the bus transfer time
It is divided into a large period and several minor cycles, sets large period Max_Cycle as message blocks list intermediate value
Maximum Max_Delay, minor cycle Min_Cycle is the Max_Delay that message blocks list intermediate value is minimum,
The maximum delay time of arbitrary message blocks in message blocks list and the ratio of minor cycle are necessary for the power of 2
Side；
Read the message blocks list of rearrangement, for arbitrary message blocks M in messaging list, according to as follows
Flow process is arranged:
(1) maximum delay time of message blocks M and the ratio b of minor cycle, i.e. often b minor cycle are calculated,
Message blocks M arranges once, and b=MAX_DELAY (M)/Min_Cycle；
Determine the minor cycle scope at place when message blocks M arranges for [(x-1) * b, x*b), x minima is 1,
Maximum is the ratio of large period and message blocks M maximum delay time, i.e. x ∈
[1, Max_Cycle/Max_Delay] and be integer；
(2) according to the minor cycle scope at message blocks M place, message blocks M is arranged in current minor cycle model
Arrange in enclosing in message transmission the shortest minor cycle used time；Message transmission has been arranged if there is multiple minor cycles
The situation that used time is equal, then select the minor cycle that minor cycle sequence number is less to arrange this message blocks M；
(3) the transmission time t of message blocks M is accumulated in this minor cycle with in the transmission time；And check
The whether value more than Min_Cycle with the transmission time, if it is not, then message to rearrangement successively
Other message blocks in block list process, and i.e. complete the arrangement of bus table；If it is, report mistake
By mistake, termination flow process, show that user message block list requires to conflict with time response.
Wherein: after the message blocks list reading rearrangement, first calculate the number of minor cycle
A=Max_Cycle/Min_Cycle, if a be odd number or a more than 64, then return mistake, exit institute
State flow process, do not continue to perform.
The invention has the beneficial effects as follows:
The method is simply effective, and the bus table generated by the method directly can be made by bus control unit
With, and meet application to message blocks function and the requirement of performance.
Accompanying drawing illustrates:
Fig. 1 is the flow chart of one embodiment of the present of invention.
Detailed description of the invention:
As it is shown in figure 1, all message in messaging list are again arranged by the present invention according to following rule
Sequence: arrange from small to large according to message maximum delay time Max_Delay；Maximum delay time is identical
Message, arranges from small to large according to transmission data word length；Maximum delay time and message transmission data word
In the case of identical length is same, arrange according to its sequence number in messaging list.
Reading the file after sequence and leave in Block_Container [] array, the number of message blocks is used
Block_Member represents；
Calculate number a=Max_Cycle/Min_Cycle of minor cycle, if a is odd number or a is more than
64, then return-1, exit optimization program, otherwise continue executing with；
Recording each minor cycle by time [a] array and used the transmission time, time [0] to time [a-1] is just
Value is 0；
Put current message index m=0；
Current message block M is taken out from Block_Container [m]；
Calculating message M minor cycle period b=Max_Delay (M)/Min_Cycle, i.e. message M is in bus
In table, every b minor cycle needs to arrange this message；
Calculate the position that message M occurs in bus table for the first time: within the 0th to the b-1 minor cycle,
Search time minima time [c], then minor cycle c is the minor cycle that message first occurs；
According to type of message, calculate message blocks M transmission time t；
Minor cycle c transmission used time time [c] inserting M is increased t, and time [c]=time [c]+t certainly；
And judge that time [c], whether more than Min_Cycle, if greater than then returning-2, otherwise continues executing with；
The current minor cycle c of M and insertion M is stored to Opti_Block_Container [] as a record
In；
It is inserted into message blocks M successively in the c+n*b minor cycle, n ∈ [1, Max_Cycle/Max_Delay (M)),
Certainly increase t in transmission used time time [c+n*b] of the minor cycle c+n*b inserting M, and judge time [c+n*b]
Whether more than Min_Cycle, if greater than then returning-2, otherwise continue executing with；
The current minor cycle c+n*b of M and insertion M is stored to as a record
Opti_Block_Container[]；
Process this bar message M, message index has been incremented by, taken off a piece of news block, enter according to above-mentioned steps
Row processes, until Block_Member bar message being all disposed；
By message all in Opti_Block_Container by Xiao Zhou's issue, maximum delay time, message
Amount sorts from small to large, first extracts the message that all Xiao Zhou's issues are identical, and by these same little
Message in cycle arranges from small to large according to message maximum delay time Max_Delay；During maximum delay
Between identical message, arrange from small to large according to transmission data word length；Maximum delay time and message pass
In the case of transmission of data word length is the most identical, arrange according to its sequence number in messaging list；
All message in Opti_Block_Container after sequence are sequentially output tape11.dat,
It it is the bus list file after optimization.
Claims (2)
1. a 1553B bus list sorting optimization method, including:
All message blocks in message blocks list are resequenced according to following rule: according to disappearing
Breath block maximum delay time Max_Delay arranges from small to large；Identical for maximum delay time
Message blocks, arranges from small to large according to transmission data word length；For maximum delay time and transmission
The situation that data word length is the most identical, arranges according to its sequence number in message blocks list；
The transmission time t of message blocks calculates according to type of message and the transmission data word length of message blocks
Draw；Transmission time t according to each bar message blocks and maximum delay time Max_Delay, by bus
The transmission time is divided into a large period and several minor cycles, set large period Max_Cycle as
The Max_Delay, minor cycle Min_Cycle of message blocks list intermediate value maximum are message blocks list intermediate value
Minimum Max_Delay, the maximum delay time of the arbitrary message blocks in message blocks list and minor cycle
Ratio be necessary for 2 power side；
Read the message blocks list of rearrangement, for arbitrary message blocks M in messaging list, according to
Following flow process is arranged:
(1) calculating the maximum delay time of message blocks M and the ratio b of minor cycle, i.e. every b is individual little
In the cycle, message blocks M arranges once, and b=MAX_DELAY (M)/Min_Cycle；
Determine the minor cycle scope at place when message blocks M arranges for [(x-1) * b, x*b), x minima
Being 1, maximum is the ratio of large period and message blocks M maximum delay time, i.e. x ∈
[1, Max_Cycle/Max_Delay] and be integer；
(2) according to the minor cycle scope at message blocks M place, message blocks M is arranged in current Xiao Zhou
Arrange in the range of phase in message transmission the shortest minor cycle used time；Arrange if there is multiple minor cycles
The situation that the message transmission used time is equal, then select the minor cycle that minor cycle sequence number is less to arrange this message
Block M；
(3) the transmission time t of message blocks M is accumulated in this minor cycle with in the transmission time；And
Check the whether value more than Min_Cycle with the transmission time, if it is not, then successively to again arranging
Other message blocks in the message blocks list of sequence process, and i.e. complete the arrangement of bus table；If
It is then to report mistake, termination flow process, shows user message block list and time response requirement
Conflict.
1553B bus list sorting optimization method the most according to claim 1, it is characterised in that:
After the message blocks list reading rearrangement, first calculate the number of minor cycle
A=Max_Cycle/Min_Cycle, if a be odd number or a more than 64, then return mistake, move back
Go out described flow process, do not continue to perform.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310687111.XA CN103684948B (en) | 2013-12-13 | 2013-12-13 | A kind of 1553B bus list sorting optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310687111.XA CN103684948B (en) | 2013-12-13 | 2013-12-13 | A kind of 1553B bus list sorting optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103684948A CN103684948A (en) | 2014-03-26 |
| CN103684948B true CN103684948B (en) | 2016-08-17 |
Family
ID=50321327
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310687111.XA Active CN103684948B (en) | 2013-12-13 | 2013-12-13 | A kind of 1553B bus list sorting optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103684948B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105245423B (en) * | 2015-08-28 | 2018-06-26 | 中国航天科工集团第三研究院第八三五七研究所 | 1553B bus message transmission optimization methods based on maximum allocated distance algorithm |
| CN105389287B (en) * | 2015-12-11 | 2018-07-03 | 中国航空工业集团公司西安航空计算技术研究所 | The method of cycle command is inserted into a kind of 1553 bus sequence table |
| CN106027308B (en) * | 2016-06-06 | 2019-03-29 | 西北工业大学 | A kind of spaceborne 1553B bus communication optimization method |
| CN112114981B (en) * | 2020-09-09 | 2023-12-12 | 天津津航计算技术研究所 | 1553B bus message scheduling method based on linked list |
| CN113515366B (en) * | 2021-04-09 | 2023-11-17 | 北京临近空间飞行器系统工程研究所 | Bus load balancing processing method, device and storage medium |
| CN114531316A (en) * | 2022-01-18 | 2022-05-24 | 北京临近空间飞行器系统工程研究所 | General service-oriented high-reliability bus system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5367641A (en) * | 1992-11-04 | 1994-11-22 | United Technologies Corporation | MIL-STD-1553 interface device having a bus controller minor frame timer |
| US6167120A (en) * | 1996-11-06 | 2000-12-26 | Lextron Systems, Inc. | Apparatus and methods for home networking |
| EP1548991B1 (en) * | 2003-12-23 | 2007-04-04 | Airbus Deutschland GmbH | Transforming bus connection |
| CN102088332A (en) * | 2010-12-15 | 2011-06-08 | 北京航空航天大学 | Method and device for expansion 1553B bus to perform file transfer from BC to RT |
| CN102970202A (en) * | 2012-11-26 | 2013-03-13 | 北京空间飞行器总体设计部 | 1553B bus communication method based on preemptive strategy |
-
2013
- 2013-12-13 CN CN201310687111.XA patent/CN103684948B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5367641A (en) * | 1992-11-04 | 1994-11-22 | United Technologies Corporation | MIL-STD-1553 interface device having a bus controller minor frame timer |
| US6167120A (en) * | 1996-11-06 | 2000-12-26 | Lextron Systems, Inc. | Apparatus and methods for home networking |
| EP1548991B1 (en) * | 2003-12-23 | 2007-04-04 | Airbus Deutschland GmbH | Transforming bus connection |
| CN102088332A (en) * | 2010-12-15 | 2011-06-08 | 北京航空航天大学 | Method and device for expansion 1553B bus to perform file transfer from BC to RT |
| CN102970202A (en) * | 2012-11-26 | 2013-03-13 | 北京空间飞行器总体设计部 | 1553B bus communication method based on preemptive strategy |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103684948A (en) | 2014-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103684948B (en) | A kind of 1553B bus list sorting optimization method | |
| US20160350087A1 (en) | Parsing source code into a linear array | |
| EP3113020A1 (en) | Data processing device and method for processing serial tasks | |
| EP3640813B1 (en) | Cluster-based random walk method and apparatus | |
| CN105867944B (en) | Web front end data operation layer and its implementation | |
| CN105573711B (en) | A kind of data cache method and device | |
| CN104424240A (en) | Multi-table correlation method and system, main service node and computing node | |
| CN114138231B (en) | Method, circuit and SOC for executing matrix multiplication operation | |
| CN109587997A (en) | Method, electronic equipment and the computer readable storage medium of distribution server position | |
| CN104424239A (en) | Resource file loading method and device | |
| CN103401569A (en) | Method for blind identification of (n, k and m) system convolutional code | |
| CN109375897A (en) | The generation method of pseudo-random sequence | |
| CN112506992B (en) | Fuzzy query method and device for Kafka data, electronic equipment and storage medium | |
| US20200349433A1 (en) | Streaming-based artificial intelligence convolution processing method and apparatus, readable storage medium and terminal | |
| CN110471896B (en) | Data processing method, system and server | |
| CN110019975B (en) | Random walk, random walk method based on cluster, random walk device and equipment | |
| JP6038292B2 (en) | Data transfer apparatus and data transfer method | |
| CN110515604A (en) | The acquisition methods and device of the executable program file of verification environment | |
| CN105740365A (en) | Rapid query method and apparatus for data warehouse | |
| CN102184286A (en) | Method for generating instrument circuit diagram automatically | |
| CN105550089A (en) | FC network frame header data fault injection method based on digital circuit | |
| CN111814417B (en) | Method for converting Verilog codes based on character separation value file | |
| CN111368250B (en) | Data processing system, method and equipment based on Fourier transformation/inverse transformation | |
| CN111651118B (en) | Memory system, control method and control device | |
| CN105786882B (en) | A kind of tables of data mark generates, method for writing data and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |