CN105245423B - 1553B bus message transmission optimization methods based on maximum allocated distance algorithm - Google Patents
1553B bus message transmission optimization methods based on maximum allocated distance algorithm Download PDFInfo
- Publication number
- CN105245423B CN105245423B CN201510542207.6A CN201510542207A CN105245423B CN 105245423 B CN105245423 B CN 105245423B CN 201510542207 A CN201510542207 A CN 201510542207A CN 105245423 B CN105245423 B CN 105245423B
- Authority
- CN
- China
- Prior art keywords
- message
- time
- bus
- group
- num
- 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 relates to a kind of 1553B bus message transmission optimization methods based on maximum allocated distance algorithm, belong to technical field of data transmission.On the basis of the present invention is improved genetic algorithm, a kind of transmit aperiodicity message based on maximum allocated distance algorithm is proposed to optimize, realize the rational tissue to the 1553B message blocks of transmission, 1553B bus cycles property message and aperiodicity message mixed transport are optimized using the algorithm, it can be under the premise of every message maximum delay time requirement be met, rationally determine the phase of every message, so that the delay time rate of each message of bus reaches balanced, effectively alleviate bus message congestion and saturated phenomenon, solves the problems, such as bus load equilibrium, improve the ability of bus processing asynchronous message, optimal communication efficiency is reached.
Description
Technical field
The present invention relates to technical field of data transmission, and in particular to a kind of 1553B based on maximum allocated distance algorithm is total
Line message transmission optimization method.
Background technology
1553B buses be a kind of centerized fusion interior of aircraft electronic system networking standard, its high reliability, reality
When property and flexibility make it be widely used on the fields such as Aeronautics and Astronautics.Since data transmission system is to real-time
There is very high requirement with reliability, it is necessary to assure the real-time of the total Thread Message transmission of 1553B.It is needed when in 1553B buses
When handling a variety of message of different length, different cycles, and needing processing there are asynchronous message, the real-time of system is generally very
It is difficult to guarantee.1553B bus message optimization algorithms relatively common at present have based on calculation amount vector algorithm, RMS dispatching algorithms, length
Release time interval priority algorithm, HTSF algorithms etc..In the above-mentioned methods, based on calculation amount vector algorithm and RMS dispatching algorithms
Static load balancing is all based on, does not solve the problems, such as the dynamic load leveling of message, when there are many aperiodicity in bus
During message, it is easy to cause bus blocking or saturation；Long release time interval priority algorithm cannot be guaranteed that release interval is smaller and disappear
Breath or shocking flash can complete scheduling before the off period；HTSF algorithms, which do not account for synchronization, may have multiple messages simultaneously
The situation of arrival, and algorithm performs are less efficient.
Therefore, in order to avoid occurring, 1553B buses block and saturated phenomenon, the utilization rate of raising 1553B buses reduce total
The average delay time of line, equalizing bus bar load need to design a kind of method for optimizing the transmission of 1553B bus messages.
Invention content
(1) technical problems to be solved
The technical problem to be solved by the present invention is to：How a kind of method that optimizes 1553B bus message transmission is designed, with drop
The average retardation rate of low bus, equalizing bus bar load, the communication efficiency being optimal.
(2) technical solution
In order to solve the above technical problem, the present invention provides a kind of 1553B buses based on maximum allocated distance algorithm
Message transmission optimization method, includes the following steps：
S1, message transmission time X=X is enabledc+Xs+Xr+Xg+n*Xd.Wherein, XcFor coding line transmission time, XsFor status word
Transmission time, XrFor response time, XgFor message interval time, XdFor the dataword transfer time, n is the number in period；
The number of aperiodicity message is set as m, this m aperiodicity message will be arranged on n period, m >=n,
The sum of upper transmission time of each period is respectively A1, A2..., An；
Define d=| Ai–Aj|, i, j=1,2 ..., n, i ≠ j are distribution distance, and maximum allocated distance is dmax=| max
(Ai)–min(Aj)|；
S2, by the descending arrangement of the transmission time of m aperiodicity message：X1≥X2…≥Xm, enable num=n；
S3, X is taken out1, X2..., XmIn preceding n element, and by XnAnd Xn+1It is added, obtains X1, X2..., Xn+Xn+1This group
N number, then this group of number is ranked sequentially to obtain Y according to descending1, Y2..., Yn, num is added 1 at this time, if m-num is not at this time
Equal to zero, then again Xn+2And YnIt is added, obtains Y1, Y2..., Xn+2+YnThis group of n number, then by this group of number according to suitable from big to small
Sequence arranges to obtain Z1, Z2..., Zn, num is added 1 again at this time, and so on, until m-num terminates this step equal to zero；
S4, the one group of n number of descending order arrangement finally obtained is set as K1, K2..., Kn, every number of this group of number
All by X1, X2..., XmIn number represent, at this time according to K1, K2..., KnIn expression formula per number by X1, X2..., XmIt is corresponding
Message be arranged on the corresponding period and be transmitted.
(3) advantageous effect
On the basis of the present invention is improved genetic algorithm, it is proposed that one kind is based on maximum allocated distance algorithm to non-week
The transmission of phase property message optimizes, and realizes the rational tissue to the 1553B message blocks of transmission, utilizes the algorithm pair
1553B bus cycles property message and aperiodicity message mixed transport optimize, and can meet every message maximum delay
Under the premise of time requirement, the phase of every message is rationally determined so that the delay time rate of each message of bus reaches balanced,
Bus message congestion and saturated phenomenon are effectively alleviated, solves the problems, such as bus load equilibrium, it is different to improve bus processing
The ability of message is walked, has reached optimal communication efficiency.
Description of the drawings
Fig. 1 is maximum allocated distance algorithm flow chart in the method for the embodiment of the present invention.
Specific embodiment
To make the purpose of the present invention, content and advantage clearer, with reference to the accompanying drawings and examples, to the present invention's
Specific embodiment is described in further detail.
Remaining time after each minor cycle periodically message is transmitted be for handling aperiodicity message,
If the aperiodicity message in first minor cycle has not been handled, bus control unit will be put it in next minor cycle
Processing.If continuous several minor cycles can not all handle this aperiodicity message, it is likely that cause at the aperiodicity message
Reason failure, causes bus saturation or clogging.In order to improve the real-time of 1553B bus messages transmission, bus is reduced
Communication delay rate, on the basis of the present invention is improved genetic algorithm, it is proposed that a kind of based on maximum allocated distance algorithm
1553B bus message transmission optimization methods can be realized in aperiodicity message equilibrium assignment to minor cycle, improve processing
The ability of aperiodicity message.
With reference to figure 1, the 1553B bus message transmission optimizations provided in an embodiment of the present invention based on maximum allocated distance algorithm
Method includes the following steps：
S1, message transmission time X=X is enabledc+Xs+Xr+Xg+n*Xd.Wherein, XcFor coding line transmission time, XsFor status word
Transmission time, XrFor response time, XgFor message interval time, XdFor dataword transfer time, numbers of the n for the period, this period
To be less than the minor cycle of preset value；
The number of aperiodicity message is set as m, this m aperiodicity message will be arranged on n period, m >=n,
The sum of upper transmission time of each period is respectively A1, A2..., An；
Define d=| Ai–Aj|, i, j=1,2 ..., n, i ≠ j are distribution distance, and maximum allocated distance is dmax=| max
(Ai)–min(Aj)|；
S2, in order to ensure that the difference distributed between each group reaches minimum, need to ensure maximum allocated distance value minimum.By m
The descending arrangement of transmission time of aperiodicity message：X1≥X2…≥Xm, enable num=n；
S3, X is taken out1, X2..., XmIn preceding n element, and by XnAnd Xn+1It is added, obtains X1, X2..., Xn+Xn+1This group
N number, then this group of number is ranked sequentially to obtain Y according to descending1, Y2..., Yn, num is added 1 at this time, if m-num is not at this time
Equal to zero, then again Xn+2And YnIt is added, obtains Y1, Y2..., Xn+2+YnThis group of n number, then by this group of number according to suitable from big to small
Sequence arranges to obtain Z1, Z2..., Zn, num is added 1 again at this time, and so on, until m-num terminates this step S3 equal to zero, after
It is continuous to perform step S4；
S4, the one group of n number of descending order arrangement finally obtained is set as K1, K2..., Kn, every number of this group of number
All by X1, X2..., XmIn number represent, at this time according to K1, K2..., KnIn expression formula per number by X1, X2..., XmIt is corresponding
Message be arranged on the corresponding period and be transmitted, passed so as to which m aperiodicity message was arranged on n period
It is defeated.
It is exemplified below.
For example, m=6, n=4, X1=10, X2=8, X3=7, X4=6.5, X5=6, X6=3, then according to step S3, first
Y is obtained after minor sort1=X4+X5=12.5, Y2=X1=10, Y3=X2=8, Y4=X3=7；Z is obtained after second minor sort1=Y1
=X4+X5=12.5, Z2=Y4+X6=X3+X6=10, Z3=Y2=X1=10, Z4=Y3=X2=8, it therefore, will in step S4
4th, 5 aperiodic message is arranged on the 1st period and is transmitted, and the 3rd, 6 aperiodic message is arranged in the 2nd period
On be transmitted, the 1st aperiodic message was arranged on the 3rd period and is transmitted, the 2nd aperiodic message is arranged in
It is transmitted on 4th period.It can also be verified by calculating, for any other method of salary distribution, this distribution side
The obtained maximum allocated distance value of formula is minimum, is dmax=| max (Ai)–min(Aj) |=| 12.5-8 |=4.5.
As can be seen that the transmission of aperiodicity message is optimized the present invention is based on maximum allocated distance algorithm, it is real
The rational tissue to the 1553B message blocks of transmission is showed, simulation result shows using the algorithm to 1553B bus cycles property
Message and aperiodicity message mixed transport optimize, can be in the premise for meeting every message maximum delay time requirement
Under, rationally determine the phase of every message so that the delay time rate of each message of bus reaches balanced, effectively alleviates total
Line message congestion and saturated phenomenon solve the problems, such as bus load equilibrium, improve the ability of bus processing asynchronous message, reach
Optimal communication efficiency is arrived.
The above is only the preferred embodiment of the present invention, it is noted that for the ordinary skill people of the art
For member, without departing from the technical principles of the invention, several improvement and deformation can also be made, these are improved and deformation
Also it should be regarded as protection scope of the present invention.
Claims (1)
- A kind of 1. 1553B bus message transmission optimization methods based on maximum allocated distance algorithm, which is characterized in that including following Step：S1, message transmission time X=X is enabledc+Xs+Xr+Xg+n*Xd, wherein, XcFor coding line transmission time, XsIt is transmitted for status word Time, XrFor response time, XgFor message interval time, XdFor the dataword transfer time, n is the number in period；The number of aperiodicity message is set as m, this m aperiodicity message will be arranged on n period, and m >=n is each The sum of transmission time is respectively A on period1, A2..., An；Define d=| Ai–Aj| for distribution distance, i, j=1,2 ..., n, i ≠ j, maximum allocated distance is dmax=| max (Ai)– min(Aj)|；S2, by the descending arrangement of the transmission time of m aperiodicity message：X1≥X2…≥Xm, enable num=n；S3, X is taken out1, X2..., XmIn preceding n element, and by XnAnd Xn+1It is added, obtains X1, X2..., Xn+Xn+1This group n Number, then this group of number is ranked sequentially to obtain Y according to descending1, Y2..., Yn, num is added 1 at this time, if m-num etc. at this time In zero, then again Xn+2And YnIt is added, obtains Y1, Y2..., Xn+2+YnThis group of n number, then by this group of number according to descending order Arrangement obtains Z1, Z2..., Zn, num is added 1 again at this time, and so on, until m-num terminates this step equal to zero；S4, the one group of n number of descending order arrangement finally obtained is set as K1, K2..., Kn, every number of this group of number all by X1, X2..., XmIn number represent, at this time according to K1, K2..., KnIn expression formula per number by X1, X2..., XmCorresponding disappears Format is transmitted on the corresponding period.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510542207.6A CN105245423B (en) | 2015-08-28 | 2015-08-28 | 1553B bus message transmission optimization methods based on maximum allocated distance algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510542207.6A CN105245423B (en) | 2015-08-28 | 2015-08-28 | 1553B bus message transmission optimization methods based on maximum allocated distance algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105245423A CN105245423A (en) | 2016-01-13 |
| CN105245423B true CN105245423B (en) | 2018-06-26 |
Family
ID=55042931
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510542207.6A Active CN105245423B (en) | 2015-08-28 | 2015-08-28 | 1553B bus message transmission optimization methods based on maximum allocated distance algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105245423B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107370689B (en) * | 2017-09-08 | 2020-03-31 | 天津津航计算技术研究所 | Message load balancing method of 1553B bus |
| CN108092865B (en) * | 2017-11-28 | 2020-07-14 | 北京空间技术研制试验中心 | Balanced distribution method for periodic bus messages |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1517481A1 (en) * | 2003-09-16 | 2005-03-23 | Volcano Communication Technology Ab | Response time prediction method for frames on a serial bus |
| CN101208687A (en) * | 2005-04-22 | 2008-06-25 | 通用汽车环球科技运作公司 | Extensible scheduling of messages on time-triggered buses |
| CN103634184A (en) * | 2013-07-29 | 2014-03-12 | 北京汇能精电科技有限公司 | Network scheduling algorithm for CAN (controller area network) bus master-slave answer mode protocol |
| CN103684948A (en) * | 2013-12-13 | 2014-03-26 | 中国航空工业集团公司第六三一研究所 | 1553B bus table ranking optimization method |
| CN104317764A (en) * | 2014-10-10 | 2015-01-28 | 北京石竹科技股份有限公司 | Real-time control method for asynchronous messages of 1553B bus |
-
2015
- 2015-08-28 CN CN201510542207.6A patent/CN105245423B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1517481A1 (en) * | 2003-09-16 | 2005-03-23 | Volcano Communication Technology Ab | Response time prediction method for frames on a serial bus |
| CN101208687A (en) * | 2005-04-22 | 2008-06-25 | 通用汽车环球科技运作公司 | Extensible scheduling of messages on time-triggered buses |
| CN103634184A (en) * | 2013-07-29 | 2014-03-12 | 北京汇能精电科技有限公司 | Network scheduling algorithm for CAN (controller area network) bus master-slave answer mode protocol |
| CN103684948A (en) * | 2013-12-13 | 2014-03-26 | 中国航空工业集团公司第六三一研究所 | 1553B bus table ranking optimization method |
| CN104317764A (en) * | 2014-10-10 | 2015-01-28 | 北京石竹科技股份有限公司 | Real-time control method for asynchronous messages of 1553B bus |
Non-Patent Citations (2)
| Title |
|---|
| "1553B总线上消息的实时调度";赵昶宇，颜昌翔，于平;《光学精密工程》;20100331;第18卷(第3期);第732-740页 * |
| "遗传算法研究综述";吉根林;《计算机应用与软件》;20040229;第21卷(第2期);第69-73页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105245423A (en) | 2016-01-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2893678B1 (en) | Apparatus for transferring packets between interface control modules of line cards | |
| CN102902587A (en) | Distribution type task scheduling method, distribution type task scheduling system and distribution type task scheduling device | |
| CN105117284A (en) | Scheduling method for worker thread based on priority proportion queue | |
| CN111526606B (en) | Method and device for data transmission, smart home equipment and storage medium | |
| CN105245423B (en) | 1553B bus message transmission optimization methods based on maximum allocated distance algorithm | |
| CN104461727A (en) | Memory module access method and device | |
| CN105991588B (en) | A kind of method and device for defending message attack | |
| CN103455375A (en) | Load-monitoring-based hybrid scheduling method under Hadoop cloud platform | |
| CN107370689B (en) | Message load balancing method of 1553B bus | |
| CN104780118B (en) | A kind of flow control method and device based on token | |
| CN101374109B (en) | Method and apparatus for scheduling packets | |
| CN114448989B (en) | Method, device, electronic equipment, storage medium and product for adjusting message distribution | |
| CA2790609C (en) | Method for the optimized allocation of a satellite communication resource and associated communication system | |
| CN108123891A (en) | The dynamic load balancing method realized in SDN network using distributed domain controller | |
| CN102567120B (en) | Node scheduling priority determining method and node scheduling priority determining device | |
| CN110602004A (en) | Supervision data reporting, electronic device, equipment and computer readable storage medium | |
| CN103701721B (en) | Message transmitting method and device | |
| CN111555984B (en) | Method and device for data transmission, smart home equipment and storage medium | |
| WO2023109445A1 (en) | Service scheduling method based on time trigger ethernet | |
| CN110247854A (en) | A kind of multitrack necking dispatching method and scheduling system and scheduling controller | |
| Hordijk et al. | Analysis of a customer assignment model with no state information | |
| CN105512079B (en) | A kind of 1394 bus multi-channel flow datas organize packet method parallel | |
| CN104144134B (en) | A kind of array dispatching method and device | |
| CN106330772B (en) | Flow table sending method and OpenFlow controller in SDN | |
| CN105119843A (en) | A method for setting a message buffer queue length |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |