CN103281227A - Method of driving bus arrangement - Google Patents
Method of driving bus arrangement Download PDFInfo
- Publication number
- CN103281227A CN103281227A CN2012104325183A CN201210432518A CN103281227A CN 103281227 A CN103281227 A CN 103281227A CN 2012104325183 A CN2012104325183 A CN 2012104325183A CN 201210432518 A CN201210432518 A CN 201210432518A CN 103281227 A CN103281227 A CN 103281227A
- Authority
- CN
- China
- Prior art keywords
- slave
- data
- main frame
- frame
- information
- 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
Images
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
- H04L12/403—Bus networks with centralised control, e.g. polling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F13/00—Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
- G06F13/14—Handling requests for interconnection or transfer
- G06F13/36—Handling requests for interconnection or transfer for access to common bus or bus system
- G06F13/362—Handling requests for interconnection or transfer for access to common bus or bus system with centralised access control
- G06F13/364—Handling requests for interconnection or transfer for access to common bus or bus system with centralised access control using independent requests or grants, e.g. using separated request and grant lines
-
- 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
- H04L12/403—Bus networks with centralised control, e.g. polling
- H04L12/4035—Bus networks with centralised control, e.g. polling in which slots of a TDMA packet structure are assigned based on a contention resolution carried out at a master unit
-
- 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
- H04L2012/40208—Bus networks characterized by the use of a particular bus standard
- H04L2012/40234—Local Interconnect Network LIN
Abstract
In the method of driving a bus arrangement including a master and k slaves as subscribers, a header 85 of an inquiry frame 84 including k information fields 96, 98, 100, 102 is transmitted by the master to the slave. The m-th information fields 96, 98, 100, 102 are assigned to the m-th slaves, respectively, and the information about how much data is transmitted to the master by the m-th slaves is written in the m-th information fields 96, 98, 100, 102 assigned to the m-th slaves by the m-th slaves. The inquiry frame 84 is transmitted to the master, and a time schedule considering the volume of data being transmitted is provided by the master for the purpose of data transmission.
Description
Technical field
The present invention relates to a kind of method and a kind of bus unit for moving bus unit.
Background technology
Local internet (LIN) is serial communication system and the standard of serial bus device thus, and this bus unit is also referred to as the LIN bus.This bus unit can be for realizing transducer and/or actuator and as bus unit or communication between the user's of automobile control appliance.
Utilize the LIN2.0 standard to introduce frame (Event Triggered Frames, ETF) and the fragmentary frame (Sporadic Frames, SF) by Event triggered for the data that transmit between the user.Can affect thus for transmitting the time flow planning (planning chart) of data, it is fragmentary or by the transfer of data of event control that the frame mentioned allows, but wherein these frames itself are in flow layout (planning chart), to define regularly.
In the situation that fragmentary frame can define a plurality of message with static priority for time slot.Only when having data the main frame of the user for as bus unit or responded by the host request slave, send message in this time slot (Slot).If two kinds are not, bus unit keeps idle in this time.Therefore, bus unit can not be by fragmentary frame full and down.
Utilization can consider that by the frame of Event triggered the not all user's as bus unit slave all must send data in each data transfer cycle.Can distribute a plurality of slaves to a frame by Event triggered at this, a plurality of slaves can be responded the header of the frame by Event triggered.If produce conflict between transmitted frame, these slaves can be identified this situation and interrupt process of transmitting by the retaking of a year or grade data.Then main frame identification receives fault or time out fault.In the next time slot of this frame by Event triggered, main frame is by normal message or with independent identifier requesting host.That is to say, the slave frame by Event triggered reacted for each, also must have respectively unique normal identifier.
From the LIN2.1 standard, start to set, main frame must disposablely be switched to another conflict free time flow planning after conflict, and must again turn back to the initial table of this time flow planning after it is processed.But need to realize conflict identification for this reason.In addition, again with independent request, producing significantly and postponing by slave when conflict.Therefore, general only just meaningful when estimating very little conflict is only arranged by the frame of Event triggered.
Control method for the medium access at universal serial bus is described in document DE197 21 740 A1.This universal serial bus comprises a plurality of users that intercom mutually via datagram.In order to allow each user in the specific bus of constantly accessing, by the first user that is configured to main frame, with periodic sequence, send and trigger telegram.At this, each triggers telegram and comprises beginning and the duration for the license of the transmission by selected at least one user of main frame.Trigger telegram by this, set for transmitting the time flow of datagram for selected user.Before sending next triggering telegram, slave can the transmission license for other datagram to host request.
Summary of the invention
The method and the bus unit that there is the feature of independent claims based on this background proposition.Other design of the present invention is provided by dependent claims and specification.
Utilize the present invention can realize eliminating free time and/or the idle bytes in the frame at the bus unit transmitting data (Frame), reduce cycle time and the stand-by period of reducing, if for example do not need the slave transmission data as the user of bus unit.Conflict does not appear in the method.Thus can this bus unit is fully loaded until 100%.
In order to realize this point, whether must send data according to each slave and must send how many data, k slave of a claim frame request that host computer using all shares all k slave in data transfer cycle subsequently.Use a plurality of slaves wherein to share the method for this claim frame for this reason.
This claim frame comprises k information field.Main frame sends the header of this claim frame, and then each of k slave writes in k information field by information.The verification that header and information field send with last slave and together with on bus unit generation complete and with LIN consistent claim frame.Main frame reads the information field sent by slave after receiving this claim frame.Then by main frame, producing the time flow that distributes or offer at least one slave also at least impliedly to be notified to thus at least one slave by least one time slot (Slot) (being generally sequence of time slots) plans.In addition, at least one slave can be by main frame-this main frame for sending data-allow to utilize data transmission frames to transmit data at the time slot of distributing to it.
At this, main frame can additionally transmit for slave and/or for the synchronizing information of data transfer cycle with header.In addition, can be by these information being written in information field to order, scope and/or the maximum of setting the data that will be transmitted by slave.
In design of the present invention, each slave can be in the information field that for example comprises a byte of claim frame writing information, wherein the order of information field is determined by identity (ID) and/or the position of slave in bus unit of slave.The header of claim frame is sent out for carrying out request.According to the LIN standard, claim frame can have 8 information fields that are 8 byte lengths to the maximum, thereby can ask at most k=8 the slave as the user of bus unit.
Pass through particular value, for example " 0 ", it also can be called null value, wherein slave is entered into this null value in the information field of distributing to this slave of claim frame and writes thus this null value, and this slave signals that main frame is introduced by claim frame for the next one and/or there is not new data in the data transfer cycle prepared.
If there are the data for sending in m slave, the first of the information field of distributing to this slave of claim frame can be used the value of the first indication of the data that will transmit in data transfer cycle, and wherein this first for example comprises 5 an of byte.The information field of distributing to this slave, for example comprise the second portion of 3, slave is informed the amount of the data that will transmit in next data transfer cycle, for example byte number.
After obtaining and having processed claim frame, main frame can provide the time flow of optimizing according to actual needs planning for next data transfer cycle, for example from a plurality of flow layouts that existed, selects now.But also possibly, this flow layout is followed operation ground to produce by main frame and in case of necessity can be by being stored the pre-recorded data transfer cycle got off for other in the future.
Utilize the claim frame received that the following information of slave is provided to main frame:
-must send the quantity of the slave of data: main frame can be derived how many time slots will be set thus.
First of-data waiting for transmission are indicated, and for example relate to appearance, correlation, importance and/or the emergency of described data: main frame can be derived the time slot to the planning of slave allocation flow with which type of time sequencing thus.The time sequencing of in data transfer cycle, to slave, distributing time slot to follow can be quantized according to the indication for to sending data the size of the value of classification and be set.At this, constantly to thering is selected first slave of the first value as the data indication, distribute the first time slot first, constantly to thering is the selected n slave of n value as the data indication, distribute the n time slot at n, the rest may be inferred.
The amount of-the data that will be sent by slave: derive which by main frame thus in the time interval and should comprise a time slot, wherein the length in this time interval is determined by amount and/or the needed memory space of this data of the data that will be transmitted in data transmission frames by slave.
Main frame for example arranges different time flow planning (planning chart) corresponding to the quantity k that has slave now in its configuration.At this each flow layout, by the quantity of time slot and order, characterize.The quantity of time slot is corresponding with the quantity of the slave that must in data transfer cycle, send data.The length in the time interval of a time slot is the respective amount coupling with the data that will be sent by corresponding slave by main frame.In addition, can set delivery time via time flow planning for each time slot.Set thus the order by the time slot of host assignment.Therefrom also show that slave sends the time sequencing that data transmission frames is followed.Set thus in addition main frame and again receive the time sequencing that described data transmission frames is followed.This relates to main frame and receives the moment while being m data transmission frames now from the m slave.
Wherein the header of claim frame sends to the request of slave periodically to implement by main frame.Thus at when request transmit head periodically, until at least one slave signals this at least one slave and must transmit new data by information being write in the information field of distributing to this slave.Thus, as long as also do not transmit data, in fact just can ask slave and thus slave be carried out to poll with the cycle time of request.If produce mistake when the transmission of header, this header resends and/or initialization by main frame.
Method of the present invention adopts in the time of for example can after the time period through wherein not sending data, should starting as far as possible rapidly new data transfer cycle.Utilize the method to consider, always or all the time by slave, do not provide data.By being provided for the time slot of data transmission frames, can consider that the data volume of slave may change in each data transfer cycle.Can adjust neatly the flow layout comprised for the time slot of a data transfer cycle for slave thus.
For the bus unit for for example being configured to the LIN bus unit provides the flow layout (planning chart) of optimizing by demand, the host asks slave, whether described slave must send data and will send how many data.At this, use all slaves of the common header request LIN bus unit of claim frame, these slaves are shared described header.At this, distribute for example information field of a byte that has of claim frame to each slave, whether this slave sends new data by described information field explanation.In addition, slave can also illustrate the data that will transmit how many bytes.After this information field is filled up, claim frame is sent to main frame.Can provide the data-optimized time flow planning to transmitting for actual demand based on this claim frame.General slave can to main frame clearly illustrate the amount of the data that will be transferred to main frame have much with and importance how highly have.
In the LIN bus unit of being controlled by the time, main frame determines that by dedicated time slot when which slave can send its data, and wherein said dedicated time slot is transmitted to slave according to flow layout.For the flow layout of data transfer cycle, be dynamically adjusted with can following operation.Can define a plurality of flow layouts, main frame can dynamically be changed when operation between these flow layouts.
Utilize the present invention can mainly consider not all slave but only some slaves also must send current data, and the data volume of slave can change with data transfer cycle is different.Much free time and idle bytes on bus unit can be avoided thus, thereby useful data speed can be optimized.In addition, can avoid now the long stand-by period.
By that arrange in scope of the present invention, to slave in data transfer cycle what constantly send its data and carry out dynamic setting, for example can consider, at first following slave sends its data, at first the data of this slave also exist and are the most outmoded thus.Can avoid thus at first determining that last transmits this data in data transfer cycle for the slave of its data.
The institute that bus unit of the present invention is constituted as the method that execution proposes in steps.At this, each step of the method also can be carried out by all parts of bus unit.In addition, the function of all parts of the function of bus unit or this bus unit can be converted into the step of the method.Possible in addition, the step of the method is implemented as the function of at least one parts of bus unit or the function of whole bus unit.
Other advantage of the present invention and design draw from specification and accompanying drawing.
Be appreciated that the above-mentioned and following feature that also will set forth can not only be with the combination illustrated respectively, can also be with other combination or use separately, and can not depart from the scope of the present invention.
The accompanying drawing explanation
Fig. 1 illustrates the example of the flow layout of the order that comprises time slot with schematic diagram, described time slot is used in first execution mode of the inventive method.
Fig. 2 illustrates the example of claim frame with schematic diagram.
Fig. 3 illustrates other example of distributing to the time slot of different slaves in second execution mode of the inventive method with schematic diagram.
Fig. 4 illustrates the chart of the 3rd execution mode of the inventive method with schematic diagram.
Fig. 5 illustrates the execution mode of bus unit of the present invention with schematic diagram.
Embodiment
at the header 1 of the claim frame 2 of introducing by Fig. 2 subsequently shown in the first row, in order to transform request, by the main frame of bus unit, to the slave of k altogether of bus unit, send this header, wherein k=8 in Fig. 1.During this request, only be transmitted in this in the header 1 shown in Fig. 1.
If only by the first slave transmission data, according to first pass planning, by the main frame as shown in the second row as Fig. 1, for example, for only one (first) slave, provide the first time slot 4 during set data transfer cycle.
In the third line, the second time slot 6 also is shown except the first time slot 4, this second time slot is in the flow layout of the data transfer cycle for wherein being sent by two slaves data.At this, the second time slot 6 is assigned to the second slave of bus unit.
At this, data transfer cycle in the flow layout shown in the fourth line of Fig. 1, by three slaves transmission data.For this reason by this flow layout be provided for the first time slot 4 of the first slave, for the 3rd time slot 8 of the 3rd slave and for the 4th time slot 10 of the 4th slave.
If send data by all k slave in data transfer cycle in the execution mode of the inventive method, by the flow layout shown in the fifth line in Fig. 1, for each in these slaves, provide time slot 4,6,8,10,12,14,16,18.At this, the first time slot 4 is assigned to the first slave, the second time slot 6 is assigned to the second slave, the 3rd time slot 8 is assigned to the 3rd slave, the 4th time slot 10 is assigned to the 4th slave, and the 5th time slot 12 is assigned to the 5th slave, and the 6th time slot 14 is assigned to the 6th slave, the 7th time slot 16 is assigned to the 7th slave, and the 8th time slot 18 is assigned to the 8th slave.
In addition, also set main frame by the flow layout of introducing in Fig. 1 and distribute time slot 4,6,8,10,12,14,16,18 orders of following to slave.Therefrom go out again the order that slave provides the data transmission frames that fills up data to follow, and the slave order that sends to main frame to follow described data transmission frames, and main frame receives data transmission frames with which kind of order from slave.
By Fig. 3 subsequently, time slot 4,6,8,10 are described, 12,14,16, the possible details of the length in 18 the time interval, this length depends on data volume, and defines thus the length of the data transmission frames for holding the data that will transmit at corresponding data transfer cycle.
Fig. 2 illustrates the CONSTRUCTED SPECIFICATION of the claim frame 2 of the header 1 that is included in Fig. 1 to be introduced with schematic diagram.Claim frame 2, except header 1k, wherein also has idle information field 24,26,28,30 outside k=8, and 32,34,36,38 and additional check field 40.Filled up information field 24,26 in the information of using the data about sending by slave, 28,30,32,34, after 36,38, claim frame 2 is sent to main frame.At this, first information field 24 is assigned to the first slave of bus unit, the second information field 26 is assigned to the second slave of bus unit, the 3rd information field 28 is assigned to the 3rd slave of bus unit, the 4th information field 30 is assigned to the 4th slave of bus unit, the 5th information field 32 is assigned to the 5th slave of bus unit, the 6th information field 34 is assigned to the 6th slave of bus unit, the 7th information field 36 is assigned to the 7th slave of bus unit and the 8th slave that the 8th information field 38 is assigned to bus unit, this bus unit has 8 slaves altogether at this.Via last check field 40, provide when the redundancy check in cycle for whole claim frame 2 and/or calculate the verification that for this reason arranges and.
In this execution mode of carrying out the inventive method, when the header 1 of claim frame 2 sends slave to from main frame in RQ cycle, in the information field 24,26,28,30,32,34,36,38 of distributing to slave, also there is no data writing.According to them, the order in bus unit receives header 1 to slave.If at least one slave, for example the m slave must send data to main frame in data transfer cycle subsequently, and this m slave will write about at least one information of data to be sent the m information field 24 of the free time of distributing to it, 26,28,30,32, in 34,36,38.At this, each in these information fields 24,26,28,30,32,34,36,38 is divided into two parts.At this, the m slave can comprise herein in the first of 5 and writes the information about the indication of data to be sent.The m information field 24,26,28,30,32,34 that the m slave can distributed to it, in 36,38 second portion, write about will be by the information of the data volume of its transmission, wherein this information field 24,26,28,30,32,34,36,38 second portion comprises 3 at this.If the m slave does not need to send data, the m information field 24,26,28 that the m slave is being distributed to it to main frame in next data transfer cycle, 30,32,34, write so-called null value in 36,38, this null value is suitable for making an appointment and for example can has is 0 value.Therefore stipulate, the information of the identity (ID) of the slave that for example can comprise 1 addressing of described header of header 1 is write by main frame and is read by slave.Information field 24,26, the information in 28,30,32,34,36,38 is write by slave.Verification and being write in check field 40 by last slave of bus unit.Information field 24,26,28,30,32,34,36,38 and check field 40 form the response of being read by main frame of slaves.
Fig. 3 illustrates time slot 42,44, and 46,48,50,52,54,56,58,60,62,64,66,68,70,72 example, the time interval of these time slots is depended on by slave 74,76, the amount of the data that 78,80 use data transmission frames send.At this, within 74 minutes, be used in the first time slot 42 of the amount of 1 byte data to the first slave, for the second time slot 44 of the amount of 2 byte datas, for the x time slot 46 of the amount of x byte data, or for the 8th time slot 48 of the amount of 8 byte datas.Corresponding, within 76 minutes, be used in the first time slot 50 of the amount of 1 byte data to the second slave, for the second time slot 52 of the amount of 2 byte datas, for the x time slot 54 of the amount of x byte data, or for the 8th time slot 56 of the amount of 8 byte datas.In flow layout, by main frame to k slave 74 altogether, 76,78, m slave 78 in 80 is provided for the first time slot 58 of the amount of 1 byte data, the second time slot 60 that is used for the amount of 2 byte datas, the x time slot 62 that is used for the amount of x byte data, perhaps for the 8th time slot 64 of the amount of 8 byte datas, thereby distribute time slot 58,60,62 shown here to this m slave 78, one of 64, the time intervals that these time slots have different sizes are with for providing the data transmission frames of the difference size of holding the different pieces of information amount.
Regulation, bus unit has k slave 74,76,78,80, wherein k=8 altogether.Utilize flow layout by main frame to last, the k slave is used in the first time slot 66 of the amount of 1 byte data in 80 minutes, the second time slot 68 that is used for the amount of 2 byte datas, for the x time slot 70 of the amount of x byte data, or for the 8th time slot 72 of the amount of 8 byte datas.
The chart of the 3rd execution mode for the inventive method of Fig. 4 comprises transverse axis 82, along this transverse axis, draws and take the time that ms is unit.At this, the chart of Fig. 4 comprises another example for the claim frame 84 that comprises header 85, and described header 85 is transmitted to the main frame of bus unit in the request 86 of slave, and comprises the data transmission frames 88 used in data transfer cycle 94,90,92 example.At this, data transfer cycle 94 is immediately being asked after 86, and also by request 86, prepares and/or introduce.
In described execution mode, stipulate herein, bus unit has k=4 slave.Therefore claim frame 84 has the first information field 96 for the first slave, for the second information field 98 of the second slave, for the 3rd information field 100 of the 3rd slave and for the 4th information field 102 of the 4th slave.At this, information field 96,98,100,102 headers at claim frame 84 85 of mentioning are empty while from main frame, sending slave to.As long as slave obtains header 85 during request 86, this slave just writes about during data transfer cycle 94 subsequently, from corresponding slave, sending to the information of the data of main frame in the information field 96,98,100,102 of distributing to it.
Specifically, in the example of the first slave shown in herein in distributing to its first information field 96 writing information " 20:2 ".The second slave is writing information " 0:0 " in distributing to its second information field 98, and the 3rd slave is writing information " 13:2 " in distributing to its 3rd information field 100.The 4th slave writing information " 19:4 " in distributing to its 4th information field 102 in addition.
Thus, by m slave writing information " Y:Z " in the m information field 96,98,100 of distributing to it, wherein Y means the first numeral and/or the first value, and Z means the second numeral and/or the second value.At this, the first value Y comprises the information about the indication of data to be sent, namely 20,0,13 or 19 in example shown herein.In current execution mode, there is which type of correlation by it indicates that the data that will be sent by the m slave, for example importance and/or emergency, or have the great age.At this, correlation is larger, and the value Y of indication is just less.Replace or supplement, by value Y show data to be sent when by m from machine testing.At this, data to be sent are more outmoded, and value Y is just less.Size and/or the amount of data to be sent are described by the second value Z.
Thus, the information " 20:2 " of the first slave utilization in first information field 96 informs, this first slave must send the amount of 2 byte datas, and described data have correlation 20 and/or detect at moment Y=20.The 3rd slave informs to main frame via the 3rd information field 100 of distributing to it, and this slave must send the amount of 2 byte datas, and described data have correlation 13 and/or detect at moment Y=13.The 4th slave is informed main frame by the information " 19:4 " in distributing to its 4th information field 102, and this slave must send the amount of 4 bytes, and these data have correlation 19 and/or detect at moment Y=19.
In current execution mode, the information " 0:0 " in distributing to the second information field 98 of the second slave presents particularity.At this, show that by the first information with Y value 0 the second slave does not send data in data transfer cycle 94 subsequently, described data forcibly comprise the amount of 0 byte.
During request 86, claim frame 84 will be transmitted to main frame analyzed after being written to about the information " Y:Z " of data to be sent at each slave the information field 96,98,100,102 of distributing to it.In the situation that the information provided by slave is provided, by host assignment, there is now the time flow planning of the time slot for transmitting data during the data transfer cycle 94 subsequently, wherein this time flow planning is by the data transmission frames 88 transmitted during data transfer cycle 94 by main frame, 90,92 order and size characterize.
At this, from information field 96,98, the information in 100,102 learns that data and data to be sent which slave must send much amounts have which type of correlation and/or much ages.At this, main frame is apprised of, the second slave does not need to send the correlation (Y=13) of data of data and the 3rd slave higher than the correlation (Y=19) of the data of the 4th slave, and the correlation of the data of the 4th slave is again higher than the correlation (Y=20) of the data of the first slave.In addition, main frame is apprised of, and the first and the 3rd slave must send the amount of 2 byte datas respectively, and the 4th slave must send the amount of 4 byte datas.
In the situation that consider these information, main frame provides time flow planning for data transfer cycle 94 subsequently, and the amount of the correlation of this time flow planning by data to be sent and/or age and the data that will be sent by slave respectively characterizes.During data transfer cycle 94, main frame divides at the first moment 104 t1 the first time slot that is used in first data transmission frame 88 now to the 3rd slave, and this first data transmission frame has two data fields 106 to store 2 byte datas.At the second moment 108 t2, main frame divides to the 4th slave the time slot that is used in the second data transmission frames 90, and this second data transmission frames has four data fields 106 to store 4 byte datas.At the 3rd moment 110 t3, main frame divides the 3rd time slot that is used in the 3rd data transmission frames 92 to the first slave, and the 3rd data transmission frames has two data fields 106 to store 2 byte datas.
In current execution mode, stipulate, for each position waiting for transmission arranges transmission time T
bit=52 μ s.In addition, header 85 and thus shown each frame datagram header, namely for claim frame 84 and for data transmission frames 88,90,92 datagram header comprises data length Bits
header=34.Afterbody (Trailer) for each frame shown in Fig. 4 arranges data length Bits
trailer=10.Thus for the transmission time T of claim frame 84
f0draw following formula (1):
T
f0=1.4* (T
bit* (Bits
header+ (N
slave* 10)+Bits
trailer)) (1)
The transfer of data duration of claim frame 84 illustrates by the first double-head arrow 108 in the chart of Fig. 4.Mean the transmission time of data transmission frames 88,90,92 by following formula (2), wherein m means the quantity of slave, and Z means the quantity of byte to be transmitted.
T
FmZ=1.4*(T
Bit*(Bits
Header+(Z*10)+Bits
Trailer))
(2)
Represent all set data transmission period T at this
fmZthe data transmission period T that ground means for the first data transmission frame 88 of the 3rd slave by the second double-head arrow 110 in the chart of Fig. 4
f32.In said embodiment, for example stipulate can transmit maximum 6 byte datas to each data transfer cycle 94 and to each slave.Therefore in bus unit, each data transmission frames 88,90,92 being arranged at most to 6 data fields 106 holds useful data (payload).Therefore, the data transmission frames 88,90,92 that is configured to the amount for transmitting 6 byte datas has data transmission period T
fm6=7.58ms.Data transfer cycle 94 continues 4*7.58ms=30.32ms thus.Draw data transmission period T for claim frame 84
f0=6.13ms.For for transmitting the first data transmission frame 88 of 2 byte datas, draw data transmission period T
f32=4.67ms, for for transmitting the second data transmission frames 90 of 4 byte datas, draw data transmission period T
f44=6.13ms, and, for the 3rd data transmission frames 92 for 2 byte datas of same transmission, draw data transmission period T
f12=4.67ms, thus for cycle time of RQ cycle 86 and data transfer cycle 94 by data transmission period and draw 21.60ms.
The execution mode of the bus unit of the present invention 112 schematically shown by Fig. 5 is configured to LIN(Local Interconnect Network, local internet) network and comprise main frame 114, this main frame is configured to the control appliance of automobile at this.In addition, bus unit 112 comprises the first slave 116, the second slave 118, m slave 120 and last k slave 122.At this, slave 116,118,120,122 can be configured to transducer or the actuator of automobile.In addition, whole users of bus unit 112, i.e. main frame 114 and slave 116,118,120,122, the connected in series and series connection thus along communication connection 124.
Stipulate in addition, m slave 116,118,120,122 additionally write the information about the indication of data to be sent in distributing to its m information field.Information about the data indication is considered equally for time flow planning is provided by main frame 114.
By m slave 116,118,120,122 will write in the m information field about the amount of data to be sent and/or the information of indication, and this m slave informs whether by this slave, send data to main frame 114.
The data that will send during data transfer cycle are in the situation that consider that time flow planning transmits.Time flow planning is by distributing to slave 116,118 by main frame 114, and the order of 120,122 time slot realizes.
By time flow planning is provided, the slave 116,118,120,122 that to each, will transmit data is transmitted as the time slot of its setting, and wherein to m slave 116,118,120,122 distribute the m time slots.During data transfer cycle, main frame 114 is not to following slave 116,118,120,122 distribute time slot, described slave 116,118,120,122 by writing at least one information the information field of distributing to it, declaring from it, not send data by the information of the amount about data and/or indication.
Utilize time flow planning, set about which slave when to transmit the order of data to be sent by.This sequentially depends primarily on the indication of data to be sent.Slave 116,118,120,122 by informing to main frame 114 about the information field of distributing to this slave of information write request frame of indication, and when sequentially the data that be sent by this slave have which type of correlation, importance, urgency and/or.After having received claim frame, main frame 114 will be compared by the information of all slave 116,118,120,122 explanations.The value of crossing indication about the information exchange of indication quantizes to set, and wherein slave 116,118, and 120,122 data are processed must be more early, and by slave 116,118, the value of 120,122 indications as the information explanation is just larger.For realization flow planning, to data to be sent, there are now slave 116,118,120,122 distribution first time slots of maximum indicated value.To n slave 116,118,120,122-should from confidential transmission, take n order-distribute n time slot about the data of indication the order of all indicated values.According to this order, the slave 116,118,120,122 that has minimum indicated value to the data that will transmit distributes last time slot.Corresponding with this order, slave 116,118,120,122 provide data transmission frames, fill up data transmission frames and described data transmission frames is sent to main frame 114 by data to be sent, the data that this main frame receives data transmission frames and deposits in data transmission frames according to this sequential processes according to described order.
The m data transmission frames has at least one data field, this at least one data field comprise with will be by m slave 116,118, the flux matched memory space of 120,122 data that send, wherein m slave 116,118,120,122 insert data to be sent at least one data field after having received the m data transmission frames, and the data transmission frames filled up by data is transmitted to main frame 114.
Claims (10)
1. for moving the method for bus unit (112), this bus unit comprises main frame (114) and k slave (116, 118, 120, 122) as the user, wherein by main frame (114) to slave (116, 118, 120, 122) transmit claim frame (2, 84) header (1, 85), the described request frame comprises k information field (24, 26, 28, 30, 32, 34, 36, 38, 96, 98, 100, 102), wherein respectively to m slave (116, 118, 120, 122) distribute m information field (24, 26, 28, 30, 32, 34, 36, 38, 96, 98, 100, 102), wherein by m slave (116, 118, 120, 122) the m information field (24 of distributing to it, 26, 28, 30, 32, 34, 36, 38, 96, 98, 100, 102) in, write about will be from m slave (116, 118, 120, 122) send the information of the data of much amounts to main frame (114), wherein said claim frame (2, 84) be transmitted to main frame (114), and wherein by main frame (114), provide time flow planning with for transmitting data, utilize this time flow planning to consider the amount of data to be sent.
2. write the information about the indication of data to be sent by m slave (116,118,120,122) according to the process of claim 1 wherein in distributing to its m information field (24,26,28,30,32,34,36,38,96,98,100,102).
3. according to the method for claim 1 or 2, wherein by m slave (116,118,120,122) by least one information is written to m information field (24,26,28,30,32,34,36,38,96,98,100,102) inform in and whether will send data by this slave.
4. according to the method for one of the claims, wherein said header (1) sends slave (116 to by main frame (114), 118,120,122) with for importing data transfer cycle (94), and wherein data to be sent in the situation that considering that described time flow planning transmits during data transfer cycle (94).
5. according to the method for one of the claims, wherein by the slave (116,118,120,122) that provides time flow planning will transmit data to each, distribute at least one time slot (4,6 of this flow layout, 8,10,12,14,16,18,42,44,46,48,50,52,54,56,58,60,62,64,66,68,70,72), wherein to m slave (116,118,120,122) distribute m time slot (4,6,8,10,12,14,16,18,42,44,46,48,50,52,54,56,58,60,62,64,66,68,70,72).
6. according to the method for claim 5, wherein the m time slot (4, 6, 8, 10, 12, 14, 16, 18, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72) with will be by m slave (116, 118, 120, 122) data of transmission is flux matched, wherein the m slave (116, 118, 120, 122) the m time slot (4 of distributing to it, 6, 8, 10, 12, 14, 16, 18, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 88, 90, 92) be assigned with afterwards at m data transmission frames (88, 90, 92) insert data to be sent at least one data field (106), wherein distribute to its m data transmission frames (4, 6, 8, 10, 12, 14, 16, 18, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72) by m slave (116, 118, 120, 122) send main frame (114) to.
7. according to the method for one of the claims, wherein utilize time flow planning to set and when pass through the order which slave (116,118,120,122) transmits data to be sent.
8. according to the method for one of claim 5 to 7, wherein in the situation that planning, the consideration time flow distributes a plurality of time slots (4 by main frame (114) to slave (116,118,120,122), 6,8,10,12,14,16,18,42,44,46,48,50,52,54,56,58,60,62,64,66,68,70,72).
9. bus unit, comprise main frame (114) and k slave (116, 118, 120, 122) as the user, wherein main frame (114) is configured to slave (116, 118, 120, 122) transmit claim frame (2, 84) header (1, 85), the described request frame comprises k information field (24, 26, 28, 30, 32, 34, 36, 38, 96, 98, 100, 102), wherein to m slave (116, 118, 120, 122) distribute m information field (24, 26, 28, 30, 32, 34, 36, 38, 96, 98, 100, 102), wherein the m slave (116, 118, 120, 122) be constituted as respectively the m information field (24 of distributing to it, 26, 28, 30, 32, 34, 36, 38, 96, 98, 100, 102) in, write about will be from m slave (116, 118, 120, 122) send the information of the data of much amounts to main frame (114), wherein slave (116, 118, 120, 122) be configured to described request frame (2, 84) send main frame (114) to, and wherein main frame (114) is configured to, time flow planning is provided in order to transmit data, the amount of data to be sent is considered in this time flow planning.
10. according to the bus unit of claim 9, it is configured to the LIN(local internet) network.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| DE102011085764.8 | 2011-11-04 | ||
| DE102011085764A DE102011085764A1 (en) | 2011-11-04 | 2011-11-04 | Method for operating a bus arrangement |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103281227A true CN103281227A (en) | 2013-09-04 |
| CN103281227B CN103281227B (en) | 2018-11-09 |
Family
ID=48128806
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210432518.3A Active CN103281227B (en) | 2011-11-04 | 2012-11-02 | Method for running bus unit |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US9143348B2 (en) |
| JP (1) | JP6258579B2 (en) |
| CN (1) | CN103281227B (en) |
| DE (1) | DE102011085764A1 (en) |
| FR (1) | FR2982443A1 (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111587560A (en) * | 2018-02-28 | 2020-08-25 | Wago管理有限责任公司 | Master-slave bus system and method for operating a bus system |
| CN113169986A (en) * | 2018-12-07 | 2021-07-23 | 深圳市柔宇科技股份有限公司 | Network conference data transmission method and electronic equipment |
| CN113994638A (en) * | 2019-04-16 | 2022-01-28 | 罗伯特·博世有限公司 | Subscriber station for a serial bus system and method for communication in a serial bus system |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE102013002648B3 (en) * | 2013-02-15 | 2014-05-22 | Audi Ag | Master bus device for a vehicle communication bus of a motor vehicle |
| US9582452B2 (en) * | 2013-06-05 | 2017-02-28 | The Boeing Company | Sensor network using pulse width modulated signals |
| FR3033110B1 (en) * | 2015-02-19 | 2017-02-17 | Peugeot Citroen Automobiles Sa | DATA TRANSMISSION DEVICE AND VEHICLE THEREFOR |
| AT517782B1 (en) * | 2015-10-01 | 2021-10-15 | B & R Ind Automation Gmbh | Method for asynchronous data communication in a real-time capable Ethernet data network |
| EP3453144B1 (en) * | 2016-05-02 | 2019-08-07 | Sew-Eurodrive GmbH & Co. KG | Method for integrating a further bus subscriber into a bus system, and bus system |
| JP6729488B2 (en) * | 2017-05-17 | 2020-07-22 | 株式会社デンソー | Communication system, master node, and control program |
| FR3069077B1 (en) * | 2017-07-12 | 2019-07-26 | Safran Electronics & Defense | COMMUNICATION SYSTEM AND METHOD FOR CONTROLLING AND CONTROLLING AT LEAST ONE DEVICE |
| DE102017118565A1 (en) | 2017-08-15 | 2019-02-21 | Valeo Schalter Und Sensoren Gmbh | Method for operating a sensor arrangement in a motor vehicle on the basis of a DSI protocol |
| KR102256670B1 (en) * | 2019-11-06 | 2021-05-27 | (주)로보티즈 | System and method for bus arbitration in multi-drop communication |
| DE102020215329A1 (en) * | 2020-12-03 | 2022-06-09 | Continental Automotive Gmbh | Process for fast flashing of sensor nodes over an Ethernet network |
| DE102020215763A1 (en) * | 2020-12-11 | 2022-06-15 | Continental Automotive Gmbh | Method for optimizing the transmission data rate in a sensor network in partial network operation in an Ethernet network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101453757A (en) * | 2007-12-07 | 2009-06-10 | 中兴通讯股份有限公司 | Method and system for HSDPA flow control |
| WO2010067749A1 (en) * | 2008-12-12 | 2010-06-17 | 三菱電機株式会社 | Data transceiving method, data transceiving system, master device and slave device |
| US7899954B2 (en) * | 2007-03-09 | 2011-03-01 | Yazaki Corporation | Relay connector unit and electronic device control system |
| CN102111688A (en) * | 2009-12-29 | 2011-06-29 | 华为技术有限公司 | Uplink bandwidth distribution method for passive optical network and optical line terminal |
Family Cites Families (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH04354221A (en) * | 1991-05-31 | 1992-12-08 | Toshiba Corp | Satellite packet communication system |
| JP3235041B2 (en) * | 1993-11-10 | 2001-12-04 | 日本電信電話株式会社 | TDD wireless communication system |
| DE19721740B4 (en) | 1997-05-24 | 2005-06-30 | Bosch Rexroth Ag | Control method for media access on a serial bus |
| JP2001211192A (en) * | 2000-01-28 | 2001-08-03 | Nec Corp | Transmission method, communication method, transmission device and communication system for data broadcast distribution |
| DE10065115A1 (en) * | 2000-12-28 | 2002-07-04 | Bosch Gmbh Robert | Exchanging data between bus system users involves sending data in event-oriented manner as long as defined latency time can be ensured, otherwise transmitting data deterministically |
| DE50205287D1 (en) * | 2001-03-15 | 2006-01-19 | Bosch Gmbh Robert | METHOD AND DEVICE FOR CREATING A SCHEDULE OF COMMUNICATING MESSAGES ON A BUS SYSTEM |
| DE10145218A1 (en) * | 2001-09-13 | 2003-04-03 | Bosch Gmbh Robert | Method and device for time determination in a bus system and bus system |
| FR2889010B1 (en) * | 2005-07-19 | 2007-09-28 | Valeo Vision Sa | METHOD AND COMMUNICATION DEVICE FOR MOTOR VEHICLE |
| JP4756340B2 (en) * | 2005-10-13 | 2011-08-24 | 株式会社デンソー | Communication system and method, and distributed control system and method |
| DE102006055514A1 (en) * | 2006-05-24 | 2007-11-29 | Robert Bosch Gmbh | Gateway for data transfer between serial buses |
| JP2008062802A (en) * | 2006-09-07 | 2008-03-21 | Denso Corp | Communication system, and method of assigning address |
| JP5140692B2 (en) * | 2010-03-12 | 2013-02-06 | 株式会社日立情報制御ソリューションズ | Polling transmission system, polling transmission method, and polling transmission program |
| KR101703106B1 (en) * | 2011-01-04 | 2017-02-06 | 삼성전자주식회사 | Non-volatile memory device of performing partial-erase operation and apparatuses having the same |
| PL2661798T3 (en) * | 2011-09-07 | 2021-05-04 | Samsung Sdi Co., Ltd. | Communication method, communication system, and energy storage system including the same |
-
2011
- 2011-11-04 DE DE102011085764A patent/DE102011085764A1/en active Pending
-
2012
- 2012-10-31 FR FR1260421A patent/FR2982443A1/en active Pending
- 2012-11-02 JP JP2012242295A patent/JP6258579B2/en not_active Expired - Fee Related
- 2012-11-02 CN CN201210432518.3A patent/CN103281227B/en active Active
- 2012-11-05 US US13/668,699 patent/US9143348B2/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7899954B2 (en) * | 2007-03-09 | 2011-03-01 | Yazaki Corporation | Relay connector unit and electronic device control system |
| CN101453757A (en) * | 2007-12-07 | 2009-06-10 | 中兴通讯股份有限公司 | Method and system for HSDPA flow control |
| WO2010067749A1 (en) * | 2008-12-12 | 2010-06-17 | 三菱電機株式会社 | Data transceiving method, data transceiving system, master device and slave device |
| CN102111688A (en) * | 2009-12-29 | 2011-06-29 | 华为技术有限公司 | Uplink bandwidth distribution method for passive optical network and optical line terminal |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111587560A (en) * | 2018-02-28 | 2020-08-25 | Wago管理有限责任公司 | Master-slave bus system and method for operating a bus system |
| CN113169986A (en) * | 2018-12-07 | 2021-07-23 | 深圳市柔宇科技股份有限公司 | Network conference data transmission method and electronic equipment |
| CN113994638A (en) * | 2019-04-16 | 2022-01-28 | 罗伯特·博世有限公司 | Subscriber station for a serial bus system and method for communication in a serial bus system |
| CN113994638B (en) * | 2019-04-16 | 2023-08-25 | 罗伯特·博世有限公司 | Subscriber station for a serial bus system and method for communication in a serial bus system |
| US11838146B2 (en) | 2019-04-16 | 2023-12-05 | Robert Bosch Gmbh | Subscriber station for a serial bus system and method for communicating in a serial bus system |
Also Published As
| Publication number | Publication date |
|---|---|
| JP2013098992A (en) | 2013-05-20 |
| US20130117483A1 (en) | 2013-05-09 |
| DE102011085764A1 (en) | 2013-05-08 |
| JP6258579B2 (en) | 2018-01-10 |
| FR2982443A1 (en) | 2013-05-10 |
| US9143348B2 (en) | 2015-09-22 |
| CN103281227B (en) | 2018-11-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103281227A (en) | Method of driving bus arrangement | |
| CN103946830B (en) | Sensor transmissions equipment and the method for the bus control equipment transmitting useful data from multiple sensors to vehicle | |
| JP4331777B2 (en) | Method and communication system for transmitting information in a vehicle | |
| CN110990034B (en) | ECU upgrading method, system, electronic equipment and storage medium | |
| JP5300324B2 (en) | Test apparatus and test method | |
| CN101263465A (en) | Method and system for bus arbitration | |
| US20190253355A1 (en) | Control device, control system, control method, and non-transitory computer-readable storage medium | |
| CN105512081A (en) | Method and apparatus for serial data transmission at switchable data rate | |
| CN103281321B (en) | A kind of spaceborne FlexRay bus dynamic segment communication means | |
| KR101400329B1 (en) | Communication system | |
| CN103067634A (en) | Image forming system, image forming device, image forming method, and non-transitory computer readable medium | |
| CN103597416A (en) | Programmable controller system | |
| US9377771B2 (en) | Numerical controller for communication with I/O units | |
| US20140188253A1 (en) | Method and system for reprogramming | |
| CN115022293B (en) | Multichannel resource allocation method and device, computer equipment and storage medium | |
| CN115150286B (en) | Transmission node changing method, device, computer equipment and storage medium | |
| CN101292488A (en) | System and method of optimizing the bandwidth of a time triggered communication protocol with homogeneous slot sizes | |
| US20210399906A1 (en) | Method for operating a sensor arrangement in a motor vehicle on the basis of a dsi protocol | |
| CN113545012B (en) | Communication device, communication system, and message arbitration method | |
| CN110659043B (en) | Firmware upgrading method, device, equipment and storage medium | |
| US8631085B2 (en) | Method for exchanging data | |
| CN111782425A (en) | Inter-task communication method and device based on index queue and computer equipment | |
| EP2223205B1 (en) | Flexray system using efficient storage of instructions | |
| CN104253727A (en) | Diagnosis method and system of vehicle LIN (local interconnect network) | |
| CN117155928B (en) | Communication task processing method, system, equipment, cluster and readable storage medium |
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 |