CN106375153A - Schedulability analysis method for real-time communication on network-on-chip - Google Patents

Schedulability analysis method for real-time communication on network-on-chip Download PDF

Info

Publication number
CN106375153A
CN106375153A CN201610802013.XA CN201610802013A CN106375153A CN 106375153 A CN106375153 A CN 106375153A CN 201610802013 A CN201610802013 A CN 201610802013A CN 106375153 A CN106375153 A CN 106375153A
Authority
CN
China
Prior art keywords
stream
indirectly
interference
maximum
target
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
Application number
CN201610802013.XA
Other languages
Chinese (zh)
Other versions
CN106375153B (en
Inventor
吴非
谢长生
熊钦
鲁中海
朱玥
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huazhong University of Science and Technology
Original Assignee
Huazhong University of Science and Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huazhong University of Science and Technology filed Critical Huazhong University of Science and Technology
Priority to CN201610802013.XA priority Critical patent/CN106375153B/en
Publication of CN106375153A publication Critical patent/CN106375153A/en
Application granted granted Critical
Publication of CN106375153B publication Critical patent/CN106375153B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14Network analysis or design

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a schedulability analysis method for real-time communication on a network-on-chip. The method comprises the following steps: taking a stream with the highest priority among streams that are not analyzed as a target stream; searching a direct interference stream, the direct interference stream having high priority and sharing link resources on a routing path of the target stream; searching an indirect interference stream and a downstream indirect interference stream of the indirect interference stream, wherein the indirect interference stream is the stream that has high priority, shares the link resources with the direct interference stream on a direct interference stream path of the target stream and does not share the link resources with the target stream, and the indirect interference stream is divided into an upstream indirect interference stream and the downstream indirect interference stream according to a relative position in which the indirect interference stream and the direct interference stream share the link resources; calculating the maximum indirect interference and the maximum downstream indirect interference; and calculating the maximum time delay of the target stream. The method makes a distinction between different effects of the upstream indirect interference stream and the downstream indirect interference stream upon the target stream when analyzing and calculating the maximum time delay of the target stream, thereby ensuring correctness of schedulability analysis for real-time communication on the network-on-chip.

Description

A kind of Schedulability Analysis method of real-time Communication for Power in network-on-chip
Technical field
The invention belongs to integrated circuit network-on-chip communication technical field, more particularly, to real in a kind of network-on-chip The Schedulability Analysis method of Shi Tongxin.
Background technology
Compared to non-realtime traffic, real-time Communication for Power, except requiring to transmit the logical correctness of result, also requires transmission delay Less than or equal to predetermined threshold value, to ensure service quality (quality of service, abbreviation qos).For critical system, If when running, real-time Communication for Power fails to meet corresponding predetermined threshold value, and result will be catastrophic.Therefore, in design Can the stage meet corresponding predetermined threshold value to real-time Communication for Power streams all in network-on-chip and verify, you can the analysis of scheduling property, It is particularly important.
For this problem, it is published in the tenth ieee/acm international symposium in 2008 " the real-time communication analysis for of the 161-170 page of networks-on-chip international conference On-chip networks with wormhole switching " uses Real-Time Scheduling analysis theories, establishes a model (hereinafter referred to as sb model) analyzing the maximum delay of each target stream, this model is easy to calculate, but is the introduction of excessive Non-existent interference, leads to that calculated maximum delay is excessive, and schedulability is too low.It is published in " ieee transactions On computers " 1177-1190 page of the 4th phase of volume 64 in 2015 " sla:a stage-level latency Analysis for real-time communication in a pipelined resource model " proposes one kind More fine-grained model (hereinafter referred to as sla model), introduce in model before can removing to a certain extent does not exist Interference so that the maximum delay being calculated and schedulability are closer to reality, but this model improves calculating Complexity.Meanwhile, the maximum delay that above-mentioned model calculates may be less than time delay in practice, by original non-scheduling Stream be considered to dispatch, real-time system causes catastrophic effect.
Content of the invention
Disadvantages described above for prior art or Improvement requirement, the invention provides real-time Communication for Power in a kind of network-on-chip Schedulability Analysis method, it is intended that the disturbance raw to target miscarriage to indirect interference stream by distinguishing upstream and downstream Effect, based on Real-Time Scheduling analysis theories, analysis obtains and actual schedulability result that be consistent, correct, thus solving Determine and may produce the technical problem of error analysis results in existing model.
For achieving the above object, according to one aspect of the present invention, there is provided in a kind of network-on-chip, real-time Communication for Power can Scheduling property analysis method, comprises the following steps:
Step a: the stream of limit priority in the stream do not analyzed in network-on-chip is defined as target stream;
Step b: the high priority flows of shared link resource are found on the routed path of target stream, and as direct Interference stream;
Step c: on the direct interference flow path of target stream, will with direct interference stream shared link resource, but not with mesh The high priority flows of mark stream shared link resource are defined as indirectly disturbing stream, share chain according to indirect interference stream with direct interference stream Indirect interference stream is divided into upstream and indirectly disturbs stream and downstream indirectly to disturb stream by the relative position of road resource;
Step d: stream is indirectly disturbed according to direct interference stream, upstream and downstream indirectly disturb the maximum interference indirectly of stream calculation and Maximum downstream is disturbed indirectly;
Step e: indirectly disturb i according to maximumjiIndirectly disturb with maximum downstreamCalculate the maximum delay of target stream;
Step f: judge whether the maximum delay of target stream is less than or equal to predetermined threshold value, the value of this threshold value is according to clothes Business level protocol determines, if it is repeat step a to f is till all of stream is all disposed in the network-on-chip, no Then represent that the real-time Communication for Power in this network-on-chip can not be scheduled, process terminates.
Preferably, in step b, if there are one or more streams on the routed path of target stream, its priority ratio target The priority of stream is high, then this stream is just considered high priority flows.
Preferably, interference stream includes direct interference stream and indirect interference stream, and direct interference adfluxion is closedWherein, i and j is numbering, λiAnd λjIt is respectively target stream and direct interference Stream,WithIt is respectively λiAnd λjRouted path on link circuit resource set, piAnd pjIt is respectively λiAnd λjPriority.
Preferably, if high priority flows refer to there is one or many on the routed path of direct interference stream in step c Individual stream, the priority of its priority ratio direct interference stream is high, then this stream is just considered high priority flows.
Preferably, in step c, interference adfluxion is closed indirectly Wherein k is numbering, λkFor indirect interference stream, upstream disturbs adfluxion to close indirectlyDownstream disturbs adfluxion to close indirectlyWherein, fjiAnd fjkIt is respectively λiAnd λkWith λjShared Article one, link is in λjRouted path on numbering.
Preferably, maximum interference i indirectlyjiIndirectly disturb with maximum downstreamIt is respectively as follows:
iji=rj-cj
i j i d = σ λ k &element; s i i d j i k j
Wherein, cjFor λjMaximum delay when not being interfered, ikjFor λkTo λjThe interference producing, rjFor λjMaximum Time delay, its computing formula is as follows:
Wherein, tkFor λkMiddle minimum is given out a contract for a project interval, ckFor λkMaximum delay when not being interfered, jkFor λkBetween giving out a contract for a project Every time jitter.
Preferably, in step e, the maximum delay computing formula of target stream is:
In general, by the contemplated above technical scheme of the present invention compared with prior art, can obtain down and show Beneficial effect:
(1) present invention can solve the problem that in existing model, mistake in the calculating due to maximum delay, leads to appearance in system This problem of catastrophic effect: due to employing step c, d and e, indirect interference stream is divided into upstream further and indirectly disturbs Stream is disturbed indirectly in stream and downstream, thus calculate maximum downstream indirectly disturbing, and applies to the calculating of maximum delay, therefore, it is possible to Revise mistake in computation present in existing model, obtain the Schedulability Analysis knot of real-time real-time Communication for Power in correct network-on-chip Really.
(2) present invention ensure that upstream disturbs stream and downstream indirectly to disturb the accuracy of stream differentiation indirectly: in step c In, flow, using indirect interference, first that first link shared with direct interference stream and direct interference stream are shared with target stream Relative position between link, as judgment condition, can quickly and accurately be distinguished upstream and indirectly disturb stream and downstream indirect Interference stream.
(3) present invention can solve correctly maximum downstream and indirectly disturb: in step d, by indirectly doing to downstream The flow-disturbing interference raw to direct interference miscarriage is sued for peace it is ensured that the result being obtained is indirect not less than downstream in any case Interference, i.e. maximum interference indirectly.
(4) calculating speed of the inventive method is fast, efficiency high.
Brief description
Fig. 1 is the flow chart of the Schedulability Analysis method of real-time Communication for Power in network-on-chip of the present invention;
Fig. 2 is the network-on-chip containing 5 real-time Communication for Power streams.
Specific embodiment
In order that the objects, technical solutions and advantages of the present invention become more apparent, below in conjunction with drawings and Examples, right The present invention is further elaborated.It should be appreciated that specific embodiment described herein is only in order to explain the present invention, and It is not used in the restriction present invention.As long as additionally, involved technical characteristic in each embodiment of invention described below The conflict of not constituting each other just can be mutually combined.
As shown in figure 1, the Schedulability Analysis method of real-time Communication for Power comprises the following steps in network-on-chip of the present invention:
Step a: the stream of limit priority in the stream do not analyzed in network-on-chip is defined as target stream;
Step b: the high priority flows of shared link resource are found on the routed path of target stream, and as direct Interference stream;Specifically, if one or more streams are existed on the routed path of target stream, its priority ratio target stream preferential Level is high, then this stream is just considered high priority flows;
Interference flow point is direct interference stream and indirect interference stream.Direct interference adfluxion is closedWherein, i and j is numbering, λiAnd λjIt is respectively target stream and direct interference Stream,WithIt is respectively λiAnd λjRouted path on link circuit resource set, piAnd pjIt is respectively λiAnd λjPriority.
Step c: on the direct interference flow path of target stream, will with direct interference stream shared link resource, but not with mesh The high priority flows of mark stream shared link resource are defined as indirectly disturbing stream, share chain according to indirect interference stream with direct interference stream Indirect interference stream is divided into upstream and indirectly disturbs stream and downstream indirectly to disturb stream by the relative position of road resource;Specifically, originally The high priority flows being previously mentioned in step, if referring to there are one or more streams on the routed path of direct interference stream, its The priority of priority ratio direct interference stream is high, then this stream is just considered high priority flows;
Interference adfluxion is closed indirectlyWherein k is to compile Number, λkFor indirect interference stream.Indirectly interference stream according to the relative position with direct interference stream shared link resource be divided into upstream and Stream is disturbed in downstream indirectly.Upstream disturbs adfluxion to close indirectly Downstream disturbs adfluxion to close indirectlyWherein, fjiAnd fjkRespectively For λiAnd λkWith λjFirst shared link is in λjRouted path on numbering (one stream routed path on link compile Number along stream direction of advance from 1 beginning incremented by successively).Specifically, if indirect disturb stream and direct interference stream to share Article first, first link upstream that link is shared with target stream in direct interference stream, then this indirect interference is flowed and is indirectly done for upstream Flow-disturbing;Conversely, then indirectly disturbing stream for downstream.
Step d: stream is indirectly disturbed according to direct interference stream, upstream and downstream indirectly disturb the maximum interference indirectly of stream calculation and Maximum downstream is disturbed indirectly;
Maximum interference i indirectlyjiIndirectly disturb with maximum downstreamIt is respectively as follows:
iji=rj-cj
i j i d = σ λ k &element; s i i d j i k j
Wherein, cjFor λjMaximum delay when not being interfered, ikjFor λkTo λjThe interference producing, rjFor λjMaximum Time delay, its computing formula is as follows:
Wherein, tkFor λkMiddle minimum is given out a contract for a project interval, ckFor λkMaximum delay when not being interfered, jkFor λkBetween giving out a contract for a project Every time jitter.
Step e: indirectly disturb i according to maximumjiIndirectly disturb with maximum downstreamCalculate the maximum delay of target stream;
The maximum delay computing formula of target stream is
Step f: judge whether the maximum delay of target stream is less than or equal to predetermined threshold value, the value of this threshold value is according to clothes Business level protocol (service level agreement) determines, if it is repeat step a to f, until in network-on-chip Till all of stream is all disposed, otherwise represent that the real-time Communication for Power in this network-on-chip can not be scheduled, process terminates.
First, embodiment:
Taking five real-time Communication for Power streams in Fig. 2 as a example, deriving analysis schedulability calculating process.It is 5 real-time streams in table 1 Parameter, wherein, ci、ti、pi、diAnd jiRespectively flow corresponding noiseless maximum delay, minimum is given out a contract for a project interval, priority, default Threshold value and the shake at interval of giving out a contract for a project.
Table 1
Because the quantity of real-time streams in the present embodiment is 5, therefore the process of the present invention should include 5 cyclic processes, Specific as follows:
(1) circulate for the first time:
Step a: the stream of limit priority in the stream do not analyzed in network-on-chip is defined as target stream.
The stream do not analyzed in network-on-chip has λ1、λ2、λ3、λ4And λ5, wherein λ1Highest priority.Therefore, λ1For target Stream.
Step b: the high priority flows of shared link resource are found on the routed path of target stream, and as direct Interference stream.
For λ1, there is not direct interference stream,
Step c: on the direct interference flow path of target stream, will with direct interference stream shared link resource, but not with mesh The high priority flows of mark stream shared link resource are defined as indirectly disturbing stream, share chain according to indirect interference stream with direct interference stream Indirect interference stream is divided into upstream and indirectly disturbs stream and downstream indirectly to disturb stream by the relative position of road resource.
For λ1, there is not indirect interference stream, also in the absence of trip interference stream indirectly,
Step d: stream is indirectly disturbed according to direct interference stream, upstream and downstream indirectly disturb the maximum interference indirectly of stream calculation and Maximum downstream is disturbed indirectly.
For λ1, interference is 0 indirectly for maximum interference indirectly and downstream.
Step e: indirectly disturb i according to maximumjiIndirectly disturb with maximum downstreamCalculate the maximum delay of target stream.
For λ1, maximum delay is r1=c1=30.
Step f: judge that whether the maximum delay of target stream is less than or equal to predetermined threshold value, if it is repeat step a is extremely F, till all of stream is all disposed in the network-on-chip, otherwise represents that in this network-on-chip, real-time Communication for Power can not be adjusted Degree, process terminates.
For λ1, r1=30 < d1=100, less than predetermined threshold value, also have the stream do not analyzed, therefore repeat step a extremely simultaneously f.
(2) circulate for second:
Step a: the stream of limit priority in the stream do not analyzed in network-on-chip is defined as target stream.
The stream do not analyzed in network-on-chip has λ2、λ3、λ4And λ5, wherein λ2Highest priority.Therefore, λ2For target stream.
Step b: the high priority flows of shared link resource are found on the routed path of target stream, and as direct Interference stream.
For λ2, there is not direct interference stream,
Step c: on the direct interference flow path of target stream, will with direct interference stream shared link resource, but not with mesh The high priority flows of mark stream shared link resource are defined as indirectly disturbing stream, share chain according to indirect interference stream with direct interference stream Indirect interference stream is divided into upstream and indirectly disturbs stream and downstream indirectly to disturb stream by the relative position of road resource.
For λ2, there is not indirect interference stream, also in the absence of trip interference stream indirectly,
Step d: stream is indirectly disturbed according to direct interference stream, upstream and downstream indirectly disturb the maximum interference indirectly of stream calculation and Maximum downstream is disturbed indirectly.
For λ2, interference is 0 indirectly for maximum interference indirectly and downstream.
Step e: indirectly disturb i according to maximumjiIndirectly disturb with maximum downstreamCalculate the maximum delay of target stream.
For λ2, maximum delay is r2=c2=30.
Step f: judge that whether the maximum delay of target stream is less than or equal to predetermined threshold value, if it is repeat step a is extremely F, till all of stream is all disposed in the network-on-chip, otherwise represents that in this network-on-chip, real-time Communication for Power can not be adjusted Degree, process terminates.
For λ2, r2=30 < d2=100, less than predetermined threshold value, also have the stream do not analyzed, therefore repeat step a extremely simultaneously f.
(3) third time circulates:
Step a: the stream of limit priority in the stream do not analyzed in network-on-chip is defined as target stream.
The stream do not analyzed in network-on-chip has λ3、λ4And λ5, wherein λ3Highest priority.Therefore, λ3For target stream.
Step b: the high priority flows of shared link resource are found on the routed path of target stream, and as direct Interference stream.
For λ3, direct interference adfluxion is combined into
Step c: on the direct interference flow path of target stream, will with direct interference stream shared link resource, but not with mesh The high priority flows of mark stream shared link resource are defined as indirectly disturbing stream, share chain according to indirect interference stream with direct interference stream Indirect interference stream is divided into upstream and indirectly disturbs stream and downstream indirectly to disturb stream by the relative position of road resource.
For λ3, there is not indirect interference stream, also in the absence of trip interference stream indirectly,
Step d: stream is indirectly disturbed according to direct interference stream, upstream and downstream indirectly disturb the maximum interference indirectly of stream calculation and Maximum downstream is disturbed indirectly.
For λ3, interference is 0 indirectly for maximum interference indirectly and downstream,
Step e: indirectly disturb i according to maximumjiIndirectly disturb with maximum downstreamCalculate the maximum delay of target stream.
For λ3, maximum delay isSolve r3=270.
Step f: judge that whether the maximum delay of target stream is less than or equal to predetermined threshold value, if it is repeat step a is extremely F, till all of stream is all disposed in the network-on-chip, otherwise represents that in this network-on-chip, real-time Communication for Power can not be adjusted Degree, process terminates.
For λ3, r3=270 < d3=300, less than predetermined threshold value, also have the stream do not analyzed, therefore repeat step a simultaneously To f.
(4) the 4th circulations:
Step a: the stream of limit priority in the stream do not analyzed in network-on-chip is defined as target stream.
The stream do not analyzed in network-on-chip has λ4And λ5, wherein λ4Highest priority.Therefore, λ4For target stream.
Step b: the high priority flows of shared link resource are found on the routed path of target stream, and as direct Interference stream.
For λ4, direct interference adfluxion is combined into
Step c: on the direct interference flow path of target stream, will with direct interference stream shared link resource, but not with mesh The high priority flows of mark stream shared link resource are defined as indirectly disturbing stream, share chain according to indirect interference stream with direct interference stream Indirect interference stream is divided into upstream and indirectly disturbs stream and downstream indirectly to disturb stream by the relative position of road resource.
For λ4, indirectly disturb adfluxion to be combined intoWith λ1The direct interference stream of shared link is λ3, due to f31= 1 < f34=5, therefore λ1Indirectly disturb stream for upstream, in the absence of trip indirectly interference stream,
Step d: stream is indirectly disturbed according to direct interference stream, upstream and downstream indirectly disturb the maximum interference indirectly of stream calculation and Maximum downstream is disturbed indirectly.
For λ4, maximum disturbs indirectly as i24=0 and i34=120, maximum downstream is disturbed as 0 indirectly,
Step e: indirectly disturb i according to maximumjiIndirectly disturb with maximum downstreamCalculate the maximum delay of target stream.
For λ4, maximum delay isSolve r4=340.
Step f: judge that whether the maximum delay of target stream is less than or equal to predetermined threshold value, if it is repeat step a is extremely F, till all of stream is all disposed in the network-on-chip, otherwise represents that in this network-on-chip, real-time Communication for Power can not be adjusted Degree, process terminates.
For λ4, r4=340 < d4=550, less than predetermined threshold value, also have the stream do not analyzed, therefore repeat step a simultaneously To f.
(5) the 5th circulations:
Step a: the stream of limit priority in the stream do not analyzed in network-on-chip is defined as target stream.
The stream do not analyzed in network-on-chip has λ5, wherein λ5Highest priority.Therefore, λ5For target stream.
Step b: the high priority flows of shared link resource are found on the routed path of target stream, and as direct Interference stream.
For λ5, direct interference adfluxion is combined into,
Step c: on the direct interference flow path of target stream, will with direct interference stream shared link resource, but not with mesh The high priority flows of mark stream shared link resource are defined as indirectly disturbing stream, share chain according to indirect interference stream with direct interference stream Indirect interference stream is divided into upstream and indirectly disturbs stream and downstream indirectly to disturb stream by the relative position of road resource.
For λ5, indirectly disturb adfluxion to be combined intoWith λ1And λ2The direct interference stream of shared link is λ3, Due to f31=1 < f35=2 < f32=5, therefore λ1Indirectly disturb stream, λ for upstream2Indirectly disturb stream for downstream, downstream is disturbed indirectly Adfluxion is combined into
Step d: stream is indirectly disturbed according to direct interference stream, upstream and downstream indirectly disturb the maximum interference indirectly of stream calculation and Maximum downstream is disturbed indirectly.
For λ5, maximum disturbs indirectly as i35=120, maximum downstream is indirectly disturbed and is
Step e: indirectly disturb i according to maximumjiIndirectly disturb with maximum downstreamCalculate the maximum delay of target stream.
For λ5, maximum delay isSolve r5=310.
Step f: judge that whether the maximum delay of target stream is less than or equal to predetermined threshold value, if it is repeat step a is extremely F, till all of stream is all disposed in the network-on-chip, otherwise represents that in this network-on-chip, real-time Communication for Power can not be adjusted Degree, process terminates.
For λ5, r2=310 < d5=260, more than predetermined threshold value, analysis terminates, and under this set of circumstances, this piece is surfed the Net In network, real-time Communication for Power can not be scheduled.
2nd, respectively examples detailed above is analyzed using sb model and sla model.
3rd, interpretation of result contrast:
Table 2
The analysis result of sb model, sla model and the inventive method, and the reality obtaining by emulation is listed in table 2 Test data.Simulation result shows, sb model and sla model have all obtained wrong analysis result, and the inventive method is correctly Analyze the schedulability of real-time Communication for Power in this network-on-chip under this set of circumstances.
As it will be easily appreciated by one skilled in the art that the foregoing is only presently preferred embodiments of the present invention, not in order to Limit the present invention, all any modification, equivalent and improvement made within the spirit and principles in the present invention etc., all should comprise Within protection scope of the present invention.

Claims (7)

1. in a kind of network-on-chip the Schedulability Analysis method of real-time Communication for Power it is characterised in that comprising the following steps:
Step a: the stream of limit priority in the stream do not analyzed in network-on-chip is defined as target stream;
Step b: the high priority flows of shared link resource are found on the routed path of target stream, and as direct interference Stream;
Step c: on the direct interference flow path of target stream, will with direct interference stream shared link resource, but not with target stream The high priority flows of shared link resource are defined as indirectly disturbing stream, according to indirect interference stream and direct interference stream shared link money Indirect interference stream is divided into upstream and indirectly disturbs stream and downstream indirectly to disturb stream by the relative position in source;
Step d: indirectly disturb stream and downstream indirectly to disturb the maximum interference indirectly of stream calculation and maximum according to direct interference stream, upstream Downstream is disturbed indirectly;
Step e: indirectly disturb i according to maximumjiIndirectly disturb with maximum downstreamCalculate the maximum delay of target stream;
Step f: judge whether the maximum delay of target stream is less than or equal to predetermined threshold value, the value of this threshold value is according to service etc. Level agreement determines, if it is repeat step a to f, till all of stream is all disposed in the network-on-chip, otherwise table Show that the real-time Communication for Power in this network-on-chip can not be scheduled, process terminates.
2. Schedulability Analysis method according to claim 1 is it is characterised in that in step b, if the route of target stream One or more streams are existed on path, the priority of its priority ratio target stream is high, then this stream is just considered high priority flows.
3. Schedulability Analysis method according to claim 1 it is characterised in that interference stream include direct interference stream and Connect interference stream, direct interference adfluxion is closedWherein, i and j is numbering, λiAnd λj It is respectively target stream and direct interference stream,WithIt is respectively λiAnd λjRouted path on link circuit resource set, piAnd pj It is respectively λiAnd λjPriority.
4. Schedulability Analysis method according to claim 3 is it is characterised in that in step c, be previously mentioned in this step High priority flows, if referring to there are one or more streams on the routed path of direct interference stream, its priority ratio is directly done The priority of flow-disturbing is high, then this stream is just considered high priority flows.
5. Schedulability Analysis method according to claim 4 is it is characterised in that in step c, interference adfluxion is closed indirectlyWherein k is numbering, λkFor indirect interference stream, upstream Interference adfluxion is closed indirectlyDownstream disturbs adfluxion to close indirectlyWherein, fjiAnd fjkIt is respectively λiAnd λkWith λjShared Article one, link is in λjRouted path on numbering.
6. Schedulability Analysis method according to claim 5 is it is characterised in that maximum disturb i indirectlyjiWith maximum downstream Indirectly disturbIt is respectively as follows:
iji=rj-cj
i j i d = σ λ k &element; s i i d j i k j
Wherein, cjFor λjMaximum delay when not being interfered, ikjFor λkTo λjThe interference producing, rjFor λjMaximum prolong When, its computing formula is as follows:
Wherein, tkFor λkMiddle minimum is given out a contract for a project interval, ckFor λkMaximum delay when not being interfered, jkFor λkGive out a contract for a project interval Time jitter.
7. Schedulability Analysis method according to claim 6 it is characterised in that in step e target stream maximum delay Computing formula is:
CN201610802013.XA 2016-09-05 2016-09-05 A kind of Schedulability Analysis method of real time communication in network-on-chip Active CN106375153B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610802013.XA CN106375153B (en) 2016-09-05 2016-09-05 A kind of Schedulability Analysis method of real time communication in network-on-chip

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610802013.XA CN106375153B (en) 2016-09-05 2016-09-05 A kind of Schedulability Analysis method of real time communication in network-on-chip

Publications (2)

Publication Number Publication Date
CN106375153A true CN106375153A (en) 2017-02-01
CN106375153B CN106375153B (en) 2019-02-05

Family

ID=57900372

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610802013.XA Active CN106375153B (en) 2016-09-05 2016-09-05 A kind of Schedulability Analysis method of real time communication in network-on-chip

Country Status (1)

Country Link
CN (1) CN106375153B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108983712A (en) * 2018-06-04 2018-12-11 华东师范大学 A kind of optimization mixes the method for scheduling task of crucial real-time system service life

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101141261A (en) * 2007-10-10 2008-03-12 山东大学 Network-on-chip digital router and its parallel data transmission method
CN101252513A (en) * 2008-04-07 2008-08-27 哈尔滨工业大学 On-chip network band width resource scheduling method for ensuring service quality
CN102546417A (en) * 2012-01-14 2012-07-04 西安电子科技大学 Scheduling method of network-on-chip router based on network information
CN102880762A (en) * 2012-10-18 2013-01-16 电子科技大学 Multi-core processor platform based on Noc (Network operating Center) framework and design method thereof

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101141261A (en) * 2007-10-10 2008-03-12 山东大学 Network-on-chip digital router and its parallel data transmission method
CN101252513A (en) * 2008-04-07 2008-08-27 哈尔滨工业大学 On-chip network band width resource scheduling method for ensuring service quality
CN102546417A (en) * 2012-01-14 2012-07-04 西安电子科技大学 Scheduling method of network-on-chip router based on network information
CN102880762A (en) * 2012-10-18 2013-01-16 电子科技大学 Multi-core processor platform based on Noc (Network operating Center) framework and design method thereof

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
HANY KASHIF,HIREN D.PATEL,SEBASTIAN FISCHMEISTER: "Using link-level latency analysis for path selection for real-time communication on NoCs", 《IN PROCEEDINGS OF THE ASIA SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE》 *
S.BALAKRISHNAN, F.OZGUNER: "A priority-driven flow control mechanism for real-time traffic in multiprocessor networks", 《IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS》 *
ZHENG SHI, ALAN BURNS: "Real-Time Communication Analysis for On-Chip Networks with Wormhole Switching", 《SECOND ACM/IEEE INTERNATIONAL SYMPOSIUM ON NETWORKS-ON-CHIP》 *
李洋: "基于QoS保证的2D_mesh片上网络延时评价与性能优化研究", 《中国博士学位论文全文数据库》 *
沈慧: "片上网络服务质量保障研究", 《中国优秀硕士学位论文全文数据库》 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108983712A (en) * 2018-06-04 2018-12-11 华东师范大学 A kind of optimization mixes the method for scheduling task of crucial real-time system service life

Also Published As

Publication number Publication date
CN106375153B (en) 2019-02-05

Similar Documents

Publication Publication Date Title
Bello et al. Schedulability analysis of Time-Sensitive Networks with scheduled traffic and preemption support
Qian et al. Analysis of worst-case delay bounds for on-chip packet-switching networks
Houtan et al. Synthesising schedules to improve QoS of best-effort traffic in TSN networks
Bondorf et al. Quality and cost of deterministic network calculus: Design and evaluation of an accurate and fast analysis
Lampka et al. Analytic real-time analysis and timed automata: a hybrid method for analyzing embedded real-time systems
Bouillard et al. Exact worst-case delay in FIFO-multiplexing feed-forward networks
Zhou et al. MAYA: integrating hybrid network modeling to the physical world
Zhou et al. A survey on network calculus tools for network infrastructure in real-time systems
Kemayo et al. A forward end-to-end delays analysis for packet switched networks
Mifdaoui et al. Beyond the accuracy-complexity tradeoffs of compositional analyses using network calculus for complex networks
Bouillard et al. Optimal routing for end-to-end guarantees using network calculus
Geyer et al. Graph-based deep learning for fast and tight network calculus analyses
Scheffler et al. Network calculus for bounding delays in feedforward networks of FIFO queueing systems
Liu et al. A dependency-graph based priority assignment algorithm for real-time traffic over NoCs with shared virtual-channels
Bondorf Better bounds by worse assumptions—Improving network calculus accuracy by adding pessimism to the network model
CN106375153A (en) Schedulability analysis method for real-time communication on network-on-chip
Rico et al. Modeling and verification of the multi-connection tactile internet protocol
Liu et al. A tighter recursive calculus to compute the worst case traversal time of real-time traffic over NoCs
Pinyoanuntapong et al. Sim-to-real transfer in multi-agent reinforcement networking for federated edge computing
Jafari et al. Least upper delay bound for vbr flows in networks-on-chip with virtual channels
Lu et al. Towards stochastic delay bound analysis for network-on-chip
Adnan Exact worst-case communication delay analysis of AFDX network
de Lima Jr et al. Synthesis of dependency-aware traffic generators from NoC simulation traces
Siyoum Worst-case temporal analysis of real-time dynamic streaming applications
Jiang et al. Modelling delay propagation within a train communication network

Legal Events

Date Code Title Description
C06 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