CN108092865A - A kind of periodicity bus message equilibrium assignment method - Google Patents
A kind of periodicity bus message equilibrium assignment method Download PDFInfo
- Publication number
- CN108092865A CN108092865A CN201711213098.9A CN201711213098A CN108092865A CN 108092865 A CN108092865 A CN 108092865A CN 201711213098 A CN201711213098 A CN 201711213098A CN 108092865 A CN108092865 A CN 108092865A
- Authority
- CN
- China
- Prior art keywords
- bus
- bus message
- message
- cycle
- cycles
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/40—Bus networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/62—Establishing a time schedule for servicing the requests
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Small-Scale Networks (AREA)
Abstract
The present invention relates to a kind of periodical bus message equilibrium assignment method, the periodicity bus message equilibrium assignment method comprises the following steps：S1 designs the transmission cycle of multiple bus messages according to the requirement of the transmission delay of periodical bus message；And S2, using sequence summation the multiple bus message is distributed in multiple basic controlling cycles, so that the multiple bus message at least occurs once in the multiple basic controlling cycle, and so that the dispersion of the bus message length summation in each basic controlling cycle is minimum.Present invention optimizes bus message equilibrium assignment as a result, improving allocative efficiency.
Description
Technical field
The present invention relates to spacecraft bus field of communication technology more particularly to a kind of periodical bus message equilibrium assignment sides
Method.
Background technology
It will be appreciated that bus is the platform device interface communication way being most widely used in spacecraft model, it is responsible for flat
The transmission and distribution of platform basic status information and control instruction are the in-orbit basic guarantees reliably to fly of spacecraft.Bus is born
The processing sequential progress rational allocation for characterizing information in bus is carried, ensures each basic cycle internal bus uniform flow distribution.
Bus message is generally divided into periodical bus message and aperiodicity bus message, and a total line traffic control is generally taken in system design
Silent period (i.e. without the period of periodical bus message transmission) transmission aperiodicity bus message in cycle processed, as long as therefore
Property performance period bus message equilibrium assignment in each controlling cycle is just realized simultaneously available for transmission aperiodicity bus
The silent period of message is balanced.Bus load equilibrium is located in time in the reliable and stable communication of guarantee spacecraft bus, aperiodicity message
Vital effect is waved in haircut.
For realize spacecraft bus load balancing distribution, existing implementation method have rely on the artificial exhaustive computations of designer and
Computer software calculates two ways.It is based on the good bus protocol of Preliminary design manually to calculate, and various message frames are put
It looks into and compares, by taking turns manual iteration adjustment, realize the approximate equalization of the flow bus in each cycle eventually more.Computer software calculates
It is to establish object function, is solved using simulated annealing.But there are following defects for existing two kinds of technological means：
(1) either manually calculate and calculated by computer software, what is drawn is not only optimal solution, final result
Simply realize the approximate equalization of flow bus, and different personnel draw result of calculation, using algorithm carry out different numbers
It is being calculated as a result, being all different.
(2) using artificial algorithm inefficiency, it is high to calculate repeatedly risk.Artificial exhaustive computations need to each message frame into
Row manually compare by arrangement, and with the increase of bus system design complexity, the workload manually calculated will greatly increase.
(3) calculated using computer, algorithm is complex, and algorithm mechanism is not easy to be grasped, and is not easy to promote
It uses.
The content of the invention
It is an object of the invention to solve above-mentioned technical problem, a kind of periodical bus message equilibrium assignment method is provided,
Optimize the equilibrium assignment of bus message as a result, improving allocative efficiency.
For achieving the above object, the present invention provides a kind of periodical bus message equilibrium assignment method, the cycle
Property bus message equilibrium assignment method comprises the following steps：S1 designs multiple buses according to the requirement of the transmission delay of bus message
The transmission cycle of message；And S2, the multiple bus is distributed in multiple basic controlling cycles disappear using sequence accumulation algorithm
Breath so that the multiple bus message at least occurs once in the multiple basic controlling cycle, and causes each basic
The dispersion of bus message length summation in controlling cycle is minimum.
Preferably, in step sl, the minimum value for designing transmission cycle is equal to the basic controlling cycle, the transmission week
The ratio of the maximum of phase and the basic controlling cycle is N=2n, n is the integer more than 1, and the bus of each bus message is all
Phase multiple is defined as the transmission cycle of the bus message divided by the minimum value of transmission cycle, from the transmission cycle with maximum
Bus message start to arrive the bus message of the transmission cycle with minimum value successively, bus cycles multiple is respectively 2n、2n -1、…、2、1。
Preferably, step S2 includes：In N number of basic controlling cycle, bus week is sequentially allocated using sequence accumulation algorithm
Phase multiple is 2n、2n-1..., 2 bus message.
Preferably, the use of sequence accumulation algorithm distribution bus cycles multiple is 2n、2n-1..., 2 bus message includes：
N number of basic controlling cycle is divided into two time slots N1 and N2 by S21, the use of sort accumulation algorithm by bus cycles multiple is 2n
Bus message distribute in time slot N1 and N2, wherein N1 includes preceding N/2 basic controlling cycles, N2 include rear N/2 it is basic
Controlling cycle；Time slot N1 is divided into two time slots N11 and N12, and the bus of distribution to time slot N1 in step S21 is disappeared by S22
Breath is considered as bus cycles multiple as 2n-1Bus message, using sequence accumulation algorithm by bus cycles multiple be 2n-1Bus disappear
Breath is distributed in time slot N11 and N12, wherein, N11 includes preceding N/4 basic controlling cycles, and N12 includes next N/4 base
This controlling cycle；Time slot N2 is divided into two time slots N21 and N22, and will be distributed in step S21 to the bus of time slot N2 by S23
Message is considered as bus cycles multiple as 2n-1Bus message, using sequence accumulation algorithm by bus cycles multiple be 2n-1Bus
Message is distributed in time slot N21 and N22, wherein, N21 includes being connected on N/4 basic controlling cycles behind N12, and N22 is included most
N/4 basic controlling cycles afterwards；S24 repeats above-mentioned time slot decomposition step and sequence accumulation algorithm, until distributing the bus cycles
Multiple is 2n-2..., 2 bus message.
Preferably, the positive used in the accumulation algorithm that sorts is the length value of bus message.
Preferably, after the multiple bus message is distributed, statistical is assigned to the bus of each basic controlling cycle
The cycle of message-length and the bus message, and output bus message control table.
Periodicity bus message equilibrium assignment method according to the present invention, compared to existing artificial calculating and passes through computer
Software calculates, and realizes the equilibrium assignment of the bus message of big quantity variable period, and allocation result is only optimal solution, together
When, this method improves bus message and divides equally the efficiency distributed, and both can be used for manually calculating, and can be used for information tool
It calculates, calculation amount is small, easy to spread.
Description of the drawings
It in order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to institute in embodiment
Attached drawing to be used is needed to be briefly described, it should be apparent that, the accompanying drawings in the following description is only some implementations of the present invention
Example, for those of ordinary skill in the art, without creative efforts, can also obtain according to these attached drawings
Obtain other attached drawings.
Fig. 1 is the flow chart for schematically showing periodical bus message equilibrium assignment method according to the present invention；
Fig. 2 is the principle flow chart for schematically showing sequence accumulation algorithm according to the present invention；
Fig. 3 is the particular flow sheet for schematically showing periodical bus message equilibrium assignment method according to the present invention.
Specific embodiment
The description of this specification embodiment should be combined with corresponding attached drawing, and attached drawing should be used as the one of complete specification
Part.In the accompanying drawings, the shape of embodiment or thickness can expand, and to simplify or facilitate mark.Furthermore it is respectively tied in attached drawing
The part of structure will be to describe to illustrate respectively, it is notable that the member for being not shown in figure or not illustrated by word
Part is the form known to a person of ordinary skill in the art in technical field.
The description of embodiments herein, any reference in relation to direction and orientation, is for only for ease of description, and cannot manage
It solves as to may be all in any restrictions of the busy scope of the present invention.It can be related to spy below for the explanation of preferred embodiment
The combination of sign, these features may be individually present or combine presence, and the present invention is not defined in preferred embodiment party particularly
Formula.The scope of the present invention is defined by the claims.
Fig. 1 is the flow chart for schematically showing periodical bus message equilibrium assignment method according to the present invention.Such as Fig. 1 institutes
Show, periodicity bus message equilibrium assignment method according to the present invention comprises the following steps：S1 prolongs according to the transmission of bus message
Shi Yaoqiu designs the transmission cycle of multiple bus messages；And S2, using sequence accumulation algorithm in multiple basic controlling cycles
Distribute multiple bus messages so that multiple bus cycles message at least occur once in multiple basic controlling cycles, and make
The dispersion for obtaining the bus message length summation in each basic controlling cycle is minimum.
In step sl, the transmission cycle of each bus message, bus are designed according to the requirement of the transmission delay of bus message
Transmission cycle is variable, design transmission cycle minimum value be bus message basic controlling cycle, the maximum of transmission cycle
Ratio with basic controlling cycle is N=2n, wherein n is the integer more than 1, in other words, by the bus week of each bus message
Phase multiple is defined as the transmission cycle of the bus message divided by the minimum value of transmission cycle, from the transmission cycle with maximum
Bus message start to arrive the bus message that transmission cycle is obtained with minimum value successively, bus message multiple is respectively 2n、2n -1、…、2。
As shown in Fig. 2, the principle of sequence accumulation algorithm is as follows：M positive integer is ranked up from big to small first, is sorted
Numerical value afterwards is Y1 ＞ Y2 ＞ Y3 ＞ ... .Ym, and the cumulative and initial value for initializing two groups of numbers is 0.Access is placed from big to small afterwards
In two groups current data add up with smaller one group in (if current cumulative and equal be placed on first group), data are placed
After, recalculate the current cumulative of this group of number and, until all data are assigned.And it is finished in the placement of all data
Afterwards, calculate the cumulative of every group of number and.That is, when placing data into two groups of A, B, it is necessary to judge in current A groups data accumulation and
With data accumulation in current B groups and size, then current data is put into current cumulative and smaller one group, is so ensured
The harmony of distribution.
According to above-mentioned principle, the step S2 of periodicity bus message equalization methods according to the present invention is included in N number of basic
In controlling cycle, bus cycles multiple is sequentially allocated as 2 using sequence accumulation algorithmn、2n-1..., 2 bus message.
Specifically, as shown in figure 3, being sequentially allocated bus cycles multiple using sequence accumulation algorithm as 2n、2n-1..., 2
Bus message flow is：N number of basic controlling cycle is divided into two time slots N1 and N2 by S21, will be total using sequence accumulation algorithm
Line cycle multiple is 2nBus message distribute in time slot N1 and N2, wherein N1 includes preceding N/2 basic controlling cycles, N2 bags
Include rear N/2 basic controlling cycles；Time slot N1 is divided into two time slots N11 and N12 by S22, and will be distributed in step S21 to
The bus message of time slot N1 is considered as bus cycles multiple as 2n-1Bus message, using sequence accumulation algorithm by bus cycles times
Number is 2n-1Bus message distribute in time slot N11 and N12, wherein, N11 includes preceding N/4 basic controlling cycles, and N12 includes
Next N/4 basic controlling cycles；Time slot N2 is divided into two time slots N21 and N22 by S23, and by step S21 points
The bus message for being assigned to time slot N2 is considered as bus cycles multiple as 2n-1Bus message, using sequence accumulation algorithm by bus week
Phase multiple is 2n-1Bus message distribute in time slot N21 and N22, wherein, N21 include being connected on N/4 behind N12 it is basic
Controlling cycle, N22 include last N/4 basic controlling cycles；S24 repeats above-mentioned time slot decomposition step and sequence accumulation algorithm,
Until distributing bus cycles multiple as 2n-2..., 2 bus message.The bus message that bus cycles multiple is 1 is in each base
This controlling cycle is required to transmit, therefore need not distribute.
It may be noted that when, the positive that uses is the length value of bus message in the accumulation algorithm that sorts.
For example, the cycle of design bus message is respectively 500ms, 1s, 2s and 4s, so as to which minimum period T0 is 500ms, most
Large period and the ratio N=2 of minimum periodn=8, n=3.The bus cycles multiple of these bus messages is respectively from big to small
8、4、2、1。
When carrying out bus assignment, it is 2 to distribute bus multiple firstnBus message, i.e., the cycle be 4s bus message.
N number of (that is, 8) basic controlling cycle is divided into former and later two time slots N1 and N2, N1 includes preceding four basic controlling cycles, N2
Including rear four basic controlling cycles.Assuming that the bus message that the cycle is 4s has a and b, then a is distributed according to sequence accumulation algorithm
In time slot N1, by b distribution in time slot N2.
Then, it is 2 to distribute bus multiplen-1Bus message, i.e., the cycle be 2s bus message.Assuming that the cycle is 2s's
Bus message has c and d.N1 is divided into two time slots N11 and N12, such N11 is just including the basic controlling cycle of the first two, N12
Including next two basic controlling cycles.
At this point, will be distributed above, to be considered as in N1 time slots bus cycles multiple to the bus message of time slot N1 be 2n-1It is total
Line message will distribute to the message a of time slot N1 and be also considered as bus cycles multiple as 2 aboven-1Bus message.It needs at this time
The bus message distributed in time slot N11 includes a, c and d.They are ranked up according to the length value of bus message, it is assumed that c
＞ d ＞ a.First by c distribution in time slot N11, then by d distribution in time slot N12, at this time due to the adduction in time slot N12
(that is, bus message length) is less than the adduction in time slot N11, so also distributing a in time slot N12.
Similarly, N2 is divided into two time slot N21 and N22, such N21 just include two be connected on behind N12 it is basic
Controlling cycle, N22 include most latter two basic controlling cycle.At this point, it is considered as being distributed above to the bus message of time slot N2
Bus cycles multiple is 2 in N1 time slotsn-1Bus message, will distribute above to the message b of time slot N1 and be also considered as the bus cycles
Multiple is 2n-1Bus message.The bus message distributed in time slot N11 is needed to include b, c and d at this time.According to bus message
Length value they are ranked up, it is assumed that c ＞ d ＞ b.First then c distribution is distributed d in time slot in time slot N21
In N22, at this time since the adduction (that is, bus message length) in time slot N22 is less than the adduction in time slot N21, so b is also divided
It fits in time slot N22.
Above step is repeated, time slot N 11, N12, N21, N22 are divided into two time slots, then distribute the bus cycles
Multiple is 2n-2Bus message, i.e., the cycle be 1s bus message.
Since the bus message (that is, the bus message of 500ms) that bus cycles multiple is 1 is equal in each basic controlling cycle
It needs to transmit, therefore need not distribute.
Through the above scheme, equilibrium assignment has been carried out to bus message so that the bus message of different cycles is N number of basic
At least occur once in controlling cycle, and cause the dispersion of the bus message length summation in each basic controlling cycle most
It is small.
In periodical bus message equilibrium assignment method according to the present invention, multiple cycle bus message are being assigned
Afterwards, further include statistical and be assigned to the bus message length of each basic controlling cycle and the cycle of the bus message, and export
Bus message control table.
As described above, periodicity bus message equilibrium assignment method according to the present invention, compared to existing artificial calculating and
It is calculated by computer software, realizes the equilibrium assignment of the bus message of big quantity variable period, and allocation result is unique
Optimal solution, meanwhile, this method improves bus message and divides equally the efficiency distributed, and both can be used for manually calculating, and can be used for
Information tool calculates, and calculation amount is small, easy to spread.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention
With within principle, any modifications, equivalent replacements and improvements are made should all be included in the protection scope of the present invention god.
Claims (6)
- A kind of 1. periodicity bus message equilibrium assignment method, which is characterized in that the periodicity bus message equilibrium assignment side Method comprises the following steps：S1 designs the transmission cycle of multiple bus messages according to the requirement of the transmission delay of bus message；AndS2 distributes the multiple bus message so that the multiple using sequence accumulation algorithm in multiple basic controlling cycles Bus message at least occurs once in the multiple basic controlling cycle, and causes the bus in each basic controlling cycle The dispersion of message-length summation is minimum.
- 2. periodicity bus message equilibrium assignment method according to claim 1, which is characterized in that in step sl, if The minimum value for counting transmission cycle is equal to the basic controlling cycle, the maximum of the transmission cycle and the basic controlling cycle Ratio be N=2n, n is the integer more than 1, and the bus cycles multiple of each bus message is defined as the biography of the bus message Defeated cycle divided by the minimum value of transmission cycle, successively to minimum since the bus message of the transmission cycle with maximum The bus message of the transmission cycle of value, bus cycles multiple are respectively 2n、2n-1、…、2、1。
- 3. periodicity bus message equilibrium assignment method according to claim 2, which is characterized in that step S2 includes：In N In a basic controlling cycle, bus cycles multiple is sequentially allocated as 2 using sequence accumulation algorithmn、2n-1..., 2 bus message.
- 4. periodicity bus message equilibrium assignment method according to claim 3, which is characterized in that calculated using sequence is cumulative Method distribution bus cycles multiple is 2n、2n-1..., the bus message of 2 bus message includes：N number of basic controlling cycle is divided into two time slots N1 and N2 by S21, using sequence accumulation algorithm by bus cycles multiple For 2nBus message distribute in time slot N1 and N2, wherein N1 includes preceding N/2 basic controlling cycles, and N2 includes rear N/2 Basic controlling cycle；Time slot N1 is divided into two time slots N11 and N12, and the bus message of distribution to time slot N1 in step S21 is regarded by S22 It is 2 for bus cycles multiplen-1Bus message, using sequence accumulation algorithm by bus cycles multiple be 2n-1Bus message point It fits in time slot N11 and N12, wherein, N11 includes preceding N/4 basic controlling cycles, and N12 includes next N/4 basic controls Cycle processed；Time slot N2 is divided into two time slots N21 and N22, and the bus message of distribution to time slot N2 in step S21 is regarded by S23 It is 2 for bus cycles multiplen-1Bus message, using sequence accumulation algorithm by bus cycles multiple be 2n-1Bus message point It fits in time slot N21 and N22, wherein, N21 includes being connected on N/4 basic controlling cycles behind N12, and N22 includes last N/4 A basic controlling cycle；S24 repeats above-mentioned time slot decomposition step and sequence accumulation algorithm, until distributing bus cycles multiple as 2n-2..., 2 Bus message.
- 5. periodicity bus message equilibrium assignment method according to claim 4, which is characterized in that in sequence accumulation algorithm The positive used is the length value of bus message.
- 6. periodicity bus message equilibrium assignment method according to claim 3, which is characterized in that described more distributing After a bus message, statistical is assigned to the bus message length of each basic controlling cycle and the cycle of the bus message, and Output bus message control table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711213098.9A CN108092865B (en) | 2017-11-28 | 2017-11-28 | Balanced distribution method for periodic bus messages |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711213098.9A CN108092865B (en) | 2017-11-28 | 2017-11-28 | Balanced distribution method for periodic bus messages |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108092865A true CN108092865A (en) | 2018-05-29 |
| CN108092865B CN108092865B (en) | 2020-07-14 |
Family
ID=62173250
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711213098.9A Active CN108092865B (en) | 2017-11-28 | 2017-11-28 | Balanced distribution method for periodic bus messages |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108092865B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113515366A (en) * | 2021-04-09 | 2021-10-19 | 北京临近空间飞行器系统工程研究所 | Bus load balancing processing method and device and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090265485A1 (en) * | 2005-11-30 | 2009-10-22 | Broadcom Corporation | Ring-based cache coherent bus |
| CN101729941A (en) * | 2009-10-10 | 2010-06-09 | 浙江工业大学 | Novel fairness resource allocation system for unidirectional light bus network |
| CN103077147A (en) * | 2012-12-31 | 2013-05-01 | 北京石竹科技股份有限公司 | Linked list-based full-function 1553B bus IP (Internet Protocol) core |
| CN105245423A (en) * | 2015-08-28 | 2016-01-13 | 中国航天科工集团第三研究院第八三五七研究所 | Message transmission optimizing method of 1553B bus based on maximal distribution distance algorithm |
| CN106302062A (en) * | 2016-08-10 | 2017-01-04 | 北京空间飞行器总体设计部 | A kind of communication time slot arrangement method based on Time Triggered bus |
| CN106383744A (en) * | 2016-09-28 | 2017-02-08 | 北京润科通用技术有限公司 | Scheduling method and scheduling system for periodic messages in bus |
| CN107370689A (en) * | 2017-09-08 | 2017-11-21 | 天津津航计算技术研究所 | A kind of Message Payload equalization methods of 1553B buses |
-
2017
- 2017-11-28 CN CN201711213098.9A patent/CN108092865B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090265485A1 (en) * | 2005-11-30 | 2009-10-22 | Broadcom Corporation | Ring-based cache coherent bus |
| CN101729941A (en) * | 2009-10-10 | 2010-06-09 | 浙江工业大学 | Novel fairness resource allocation system for unidirectional light bus network |
| CN103077147A (en) * | 2012-12-31 | 2013-05-01 | 北京石竹科技股份有限公司 | Linked list-based full-function 1553B bus IP (Internet Protocol) core |
| CN105245423A (en) * | 2015-08-28 | 2016-01-13 | 中国航天科工集团第三研究院第八三五七研究所 | Message transmission optimizing method of 1553B bus based on maximal distribution distance algorithm |
| CN106302062A (en) * | 2016-08-10 | 2017-01-04 | 北京空间飞行器总体设计部 | A kind of communication time slot arrangement method based on Time Triggered bus |
| CN106383744A (en) * | 2016-09-28 | 2017-02-08 | 北京润科通用技术有限公司 | Scheduling method and scheduling system for periodic messages in bus |
| CN107370689A (en) * | 2017-09-08 | 2017-11-21 | 天津津航计算技术研究所 | A kind of Message Payload equalization methods of 1553B buses |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113515366A (en) * | 2021-04-09 | 2021-10-19 | 北京临近空间飞行器系统工程研究所 | Bus load balancing processing method and device and storage medium |
| CN113515366B (en) * | 2021-04-09 | 2023-11-17 | 北京临近空间飞行器系统工程研究所 | Bus load balancing processing method, device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108092865B (en) | 2020-07-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108363615B (en) | Method for allocating tasks and system for reconfigurable processing system | |
| CN108874525B (en) | Service request distribution method facing edge computing environment | |
| CN106056212B (en) | A kind of artificial neural networks core | |
| CN108848146A (en) | A kind of method for optimizing scheduling based on time trigger communication service | |
| CN102131198B (en) | Realizing method of elliptic curve cryptography arithmetic device in authentication system | |
| CN111538570B (en) | Energy-saving and QoS guarantee-oriented VNF deployment method and device | |
| Jiang et al. | Optimal dynamic bandwidth allocation for complex networks | |
| CN104461748A (en) | Optimal localized task scheduling method based on MapReduce | |
| CN109548161A (en) | A kind of method, apparatus and terminal device of wireless resource scheduling | |
| CN105677447A (en) | Clustering-based delay bandwidth minimization virtual machine deployment method in distributed cloud | |
| CN115907038A (en) | Multivariate control decision-making method based on federated split learning framework | |
| CN108092865A (en) | A kind of periodicity bus message equilibrium assignment method | |
| Tashev | Computering simulation of schedule algorithm for high performance packet switch node modelled by the apparatus of generalized nets | |
| CN105577834A (en) | Cloud data center two-level bandwidth allocation method and system with predictable performance | |
| CN107370689B (en) | Message load balancing method of 1553B bus | |
| Sassen et al. | A heuristic rule for routing customers to parallel servers | |
| CN103678000B (en) | Calculating grid schedule equalization tasks method based on reliability and cooperative game | |
| Aghajani et al. | Mean-field dynamics of load-balancing networks with general service distributions | |
| CN105183692B (en) | A kind of group system equipment room data communications method and system | |
| CN103873383A (en) | Queue scheduling method and device | |
| Hordijk et al. | Analysis of a customer assignment model with no state information | |
| CN104283805B (en) | A kind of SDN file transmitting method and equipment | |
| He et al. | On-demand multimedia data broadcast in MIMO wireless networks | |
| CN107360262B (en) | Software updating method and device | |
| Chang et al. | The effect of prioritization on the behavior of a concentrator under an accept, otherwise reject strategy |
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 |