Controller Area Network (CAN) Schedulability Analysis with FIFO queues


 Edwin Conley
 1 years ago
 Views:
Transcription
1 Cotroller Area Network (CAN) Schedulability Aalysis with FIFO queues Robert I. Davis RealTie Systes Research Group, Departet of Coputer Sciece, Uiversity of York, YO10 5DD, York, UK Steffe Kolla, Victor Pollex, Frak Sloka Istitute of Ebedded Systes / RealTie Systes Ul Uiversity, AlbertEisteiAllee 11, Ul, Geray {steffe.kolla, victor.pollex, Abstract Cotroller Area Network (CAN) is widely used i autootive applicatios. Existig schedulability aalysis for CAN is based o the assuptio that the highest priority essage ready for trasissio at each ode o the etwork will be etered ito arbitratio o the bus. However, i practice, soe CAN device drivers ipleet FIFO rather tha prioritybased queues ivalidatig this assuptio. I this paper, we itroduce respose tie aalysis ad optial priority assiget policies for CAN essages i etworks where soe odes use FIFO queues while other odes use priority queues. We show, via a case study ad experietal evaluatio, the detrietal ipact that FIFO queues have o the realtie perforace of CAN. Revisio: This techical report was revised i April 2011 to iclude a sectio o experietal evaluatio. 1. Itroductio Cotroller Area Network (CAN) [3], [21] was desiged as a siple, efficiet, ad robust, broadcast couicatios bus for ivehicle etworks. Today, typical aistrea faily cars cotai Electroic Cotrol Uits (ECUs), ay of which couicate usig CAN. As a result of this wholesale adoptio of CAN by the autootive idustry, aual sales of CAN odes (8, 16 ad 32bit icrocotrollers with ochip CAN cotrollers) have grow fro uder 50 illio i 1999 to aroud 750 illio i CAN is a asychroous ultiaster serial data bus that uses Carrier Sese Multiple Access / Collisio Resolutio (CSMA/CR) to deterie access to the bus. The CAN protocol requires that odes wait for a bus idle period before atteptig to trasit. If two or ore odes attept to trasit essages at the sae tie, the the ode with the essage with the lowest ueric CAN Idetifier will wi arbitratio ad cotiue to sed its essage. The other odes will cease trasittig ad ust wait util the bus becoes idle agai before atteptig to retrasit their essages. (Full details of the CAN physical layer protocol are give i [3], with a suary i [11]). I effect CAN essages are set accordig to fixed priority opreeptive schedulig, with the idetifier (ID) of each essage actig as its priority. 1 Figures fro the CAN i Autoatio (CiA) website Related work I 1994, Tidell et al. showed how research ito fixed priority schedulig for sigle processor systes could be adapted ad applied to the schedulig of essages o CAN. The aalysis of Tidell et al. provided a ethod of calculatig the axiu queuig delay ad hece the worstcase respose tie of each essage o the etwork. Tidell et al. [30], [31], [32] also recogised that with fixed priority schedulig, a appropriate priority assiget policy is key to obtaiig effective realtie perforace. Tidell et al. suggested that essages should be assiged priorities i Deadlie ius Jitter ootoic priority order [33]. The seial work of Tidell et al. lead to a large body of research ito schedulig theory for CAN [5], [6], [7], [8], [17], [18], [25], [26], [27], [28], ad was used as the basis for coercial CAN schedulability aalysis tools [9]. I 2007, Davis et al. [11] foud ad corrected sigificat flaws i the schedulability aalysis give by Tidell et al. [30], [31], [32]. These flaws could potetially result i the origial aalysis providig guaratees for essages that could i fact iss their deadlies durig etwork operatio. Further, Davis et al. [11] showed that the Deadlie ius Jitter ootoic priority orderig, claied by Tidell et al. to be optial for CAN, is ot i fact optial; ad that Audsley s Optial Priority Assiget (OPA) algorith [1], [2] is required i this case. Prior to the advet of schedulability aalysis ad appropriate priority assiget policies for CAN, essage IDs were typically assiged siply as a way of idetifyig the data ad the sedig ode. This eat that oly low levels of bus utilisatio, typically aroud 30%, could be obtaied before deadlies were issed. Further, the oly eas of obtaiig cofidece that essage deadlies would ot be issed was via extesive testig. Usig the systeatic approach of schedulability aalysis, cobied with a suitable priority assiget policy, it becae possible to egieer CAN based systes for tiig correctess, providig guaratees that all essages would eet their deadlies, with bus utilisatios of up to about 80% [13], [9] Motivatio Egieers usig schedulability aalysis to aalyse etwork / essage cofiguratios ust esure that all of the assuptios of the specified schedulig odel hold for their particular syste. Specifically, whe usig the aalysis
2 give by Davis et al. i [11], it is iportat that each CAN cotroller ad device driver is capable of esurig that wheever essage arbitratio starts o the bus, the highest priority essage queued at that ode is etered ito arbitratio. This behaviour is essetial if essage trasissio is to take place as if there were a sigle global priority queue ad for the aalysis to be correct. As oted by Di Natale [15], there are a uber of potetial issues that ca lead to behaviour that does ot atch that required by the schedulig odel give i [11]. For exaple, if a CAN ode has fewer trasit essage buffers tha the uber of essages that it trasits, the the followig properties of the CAN cotroller hardware ca prove probleatic: (i) iteral essage arbitratio based o trasit buffer uber rather tha essage ID (Fujitsu MB90385/90387, Fujitsu 90390, Itel 87C196 (82527), Ifieo XC161CJ/167 (82C900)); (ii) oabortable essage trasissio (Philips (iii) 82C200) [16]; less tha 3 trasit buffers [24] (Philips 8xC592 (SJA1000), Philips 82C200). CAN cotrollers which avoid these potetial probles iclude, the Atel AT89C51CC03 / AT90CAN32/64 the Microchip MPC2515, ad the Motorola MSCAN ochip peripheral, all of which have at least 3 trasit buffers, iteral essage arbitratio based o essage ID rather tha trasit buffer uber, ad abortable essage trasissio. The CAN device driver / software protocol layer ipleetatio also has the potetial to result i behaviour which does ot atch that required by the stadard schedulig odel [11]. Issues iclude, delays i refillig a trasit buffer [20], ad FIFO queuig of essages i the device driver or CAN cotroller (The BXCAN ad BECAN for the ST7 ad ST9 Microcotrollers fro STMicroelectroics iclude hardware support for both priorityqueued ad FIFOqueued essage trasissio [29]). Di Natale [15] otes that usig FIFO queues i CAN device drivers / software protocol layers ca see a attractive solutio because of its siplicity ad the illusio that faster queue aageet iproves the perforace of the syste. This is ufortuate, because FIFO essage queues uderie the prioritybased bus arbitratio used by CAN. They ca itroduce sigificat priority iversio ad result i degraded realtie perforace. Nevertheless, FIFO queues are a reality i soe coercial CAN device drivers / software protocol layers. As far as we are aware, there is o published research 2 itegratig FIFO queues ito respose tie aalysis for CAN. This paper focuses o the issue of FIFO queues. We provide respose tie aalysis ad appropriate priority assiget policies for Cotroller Area Networks coprisig soe odes that use FIFO queues ad other 2 The coercial tool NETCARAalyzer (www.realtieatwork.co) clais to address the case of FIFO queues. odes that use priority queues Orgaisatio The reaider of this paper is orgaised as follows: I sectio 2, we itroduce the schedulig odel, otatio, ad teriology used i the rest of the paper. I sectio 3 we recap o the sufficiet schedulability aalysis for CAN give i [11]. Sectio 4 the exteds this aalysis to etworks where soe odes ipleet prioritybased queues while others ipleet FIFO queues. Sectio 5 discusses priority assiget for ixed sets of FIFOqueued ad priorityqueued essages. Sectio 6 presets the results of a case study explorig the ipact of FIFO queues o essage respose ties ad etwork schedulability. Sectio 7 further evaluates the effect of priority assiget ad FIFO queues o the axiu achievable etwork utilisatio. Fially, sectio 8 cocludes with a suary ad recoedatios. 2. Syste odel, otatio ad teriology I this sectio we describe a syste odel ad otatio that ca be used to aalyse the worstcase respose ties of essages o CAN. This odel is based o that used i [11] with extesios to describe FIFO queues. The syste is assued to coprise a uber of odes (icroprocessors) coected to a sigle CAN bus. Nodes are classified accordig to the type of essage queue used i their device driver. Thus FQodes ipleet a FIFO essage queue, whereas PQodes ipleet a priority queue. PQodes are assued to be capable of esurig that, at ay give tie whe bus arbitratio starts, the highest priority essage queued at the ode is etered ito arbitratio. FQodes are assued to be capable of esurig that, at ay give tie whe bus arbitratio starts, the oldest essage i the FIFO queue is etered ito arbitratio. The syste is assued to cotai a static set of hard realtie essages, each statically assiged to a sigle ode o the etwork. Each essage has a fixed Idetifier (ID) ad hece a uique priority. As priority uiquely idetifies each essage, i the reaider of the paper we will overload to ea either essage or priority as appropriate. We use hp () to deote the set of essages with priorities higher tha, ad siilarly, lp () to deote the set of essages with priorities lower tha. Each essage has a axiu trasissio tie of C (see [11] for details of how to copute the axiu trasissio tie of essages o CAN, takig ito accout the uber of data bytes ad bitstuffig). The evet that triggers queuig of essage is assued to occur with a iiu iterarrival tie of T, referred to as the essage period. Each essage has a hard deadlie D, correspodig to the axiu peritted tie fro occurrece of the iitiatig evet to the ed of successful trasissio of the essage, at which tie the essage data is assued to be available o the receivig odes that require it. Tasks o the receivig odes ay place differet tiig requireets o the data, however i such cases we assue that D is the shortest such tie
3 costrait. We assue that the deadlie of each essage is less tha or equal to its period ( D T ). Each essage is assued to be queued by a software task, process or iterrupt hadler executig o the sedig ode. This task is either ivoked by, or polls for, the evet that iitiates the essage, ad takes a bouded aout of tie, betwee 0 ad J, before the essage is i the device driver queue available for trasissio. J is referred to as the queuig jitter of the essage ad is iherited fro the overall respose tie of the task, icludig ay pollig delay 3. The trasissio deadlie E of essage is give by E = D J, ad represets the axiu peritted tie fro the essage beig queued at the sedig ode to it beig received at other odes o the bus. The axiu queuig delay w, correspods to the logest tie that essage ca reai i the device driver queue or CAN cotroller trasit buffers, before coecig successful trasissio o the bus. I this paper 4, we defie the worstcase respose tie R of a essage as the axiu possible trasissio delay fro the essage beig queued util it is received at the receivig odes. Hece: R = + C (1) As oted by Broster [7], receivig odes ca access essage followig the ed of (essage) frae arker ad before the 3bit iterfrae space. The aalysis give i the reaider of this paper is therefore slightly pessiistic i that it icludes the 3bit iterfrae space i the coputed worstcase respose ties. To reove this sall degree of pessiis, it is valid to siply subtract 3τ bit fro the coputed respose tie values, where τ bit is the trasissio tie for a sigle bit o the bus. A essage is said to be schedulable if its worstcase respose tie is less tha or equal to its trasissio deadlie ( R E ). A syste is said to be schedulable if all of the essages i the syste are schedulable. The followig additioal otatio is used to describe the properties of a set of essages that are trasitted by the sae FQode ad so share a FIFO queue. The FIFO group M () is the set of essages that are trasitted by the FQode that trasits essage. The lowest priority of ay essage i the FIFO group M () is deoted by L. MAX MIN C ad C are the trasissio ties of the logest SUM ad shortest essages i the FIFO group, while C is the su of the trasissio ties of all of the essages i MIN the group. E is the shortest trasissio deadlie of ay essage i the group. We use f to deote the axiu bufferig tie fro essage beig queued util it is able to take part i 3 I the best case, the task could arrive the istat the evet occurs ad queue the essage iediately, whereas i the worstcase, there could be a delay of up to the task s period before it arrives ad the a further delay of up to the task s worstcase respose tie before it queues the essage. 4 Note this is a differet way of defiig respose tie to that used i [11] which icludes queuig jitter. To copesate for ot icludig queuig jitter i the respose tie, i this paper we copare respose ties with trasissio deadlies to deterie schedulability. prioritybased arbitratio. For a FIFOqueued essage f equates to the tie fro the essage beig etered ito the FIFO queue to it becoig the oldest essage i that queue. For a priorityqueued essage f = 0. As well as deteriig essage schedulability give a particular priority orderig, we are also iterested i effective priority assiget policies. Defiitio 1: Optial priority assiget policy: A priority assiget policy P is referred to as optial with respect to a schedulability test S ad a give etwork odel, if ad oly if there is o set of essages that are copliat with the odel that are deeed schedulable by test S usig aother priority assiget policy, that are ot also deeed schedulable accordig to test S usig policy P. We ote that the above defiitio is applicable to both sufficiet schedulability tests such as those give i sectios 3 ad 4, as well as exact schedulability tests. 3. Schedulability Aalysis with Priority Queues I this sectio, we recapitulate the siple sufficiet schedulability aalysis give i [11]. For etworks of PQodes, coplyig with the schedulig odel give i sectio 2, CAN effectively ipleets fixed priority opreeptive schedulig. I this case, Davis et al. [11] showed that a upper boud o the respose tie R of each essage ca be foud by coputig the axiu queuig delay w usig the followig fixed poit iteratio: J k + τ bit = ax( B, C ) + C k (2) T k hp( ) k where τ bit is the trasissio tie for a sigle bit, ad B is the blockig factor described below. Iteratio starts with a suitable iitial value such as w 0 = C, ad cotiues util +1 either w + C > E i which case the essage is ot +1 schedulable, or w = i which case the essage is schedulable ad its worstcase respose tie is give by: +1 R = + C (3) As CAN essage trasissio is opreeptable, the trasissio of a sigle lower priority essage ca cause a delay of up to B (referred to as direct blockig) betwee essage beig queued ad the first tie that essage could be etered ito arbitratio o the bus. B represets the axiu blockig tie due to lower priority essages: B = ax ( C ) (4) k lp( ) Alteratively, i soe cases, the trasissio of the previous istace of essage could delay trasissio of a higher priority essage causig a siilar delay (referred to as pushthrough blockig 5 ) of up to C. Both direct ad pushthrough blockig are accouted for by the 1 st ter o the RHS of (2). The 2 d ter represets iterferece fro higher priority essages that ca wi arbitratio over essage ad so delay its trasissio. Note that oce essage starts successful trasissio it caot be pre 5 See [11] for a explaatio of why pushthrough blockig is iportat. k
4 epted, so the essage s overall respose tie is siply the queuig delay plus its trasissio tie (give by (3)). Usig (2) ad (3), egieers ca deterie upper bouds 6 o worstcase respose ties ad hece the schedulability of all essages o a etwork coprisig solely PQodes. Although the aalysis ebodied i (2) ad (3) is pseudopolyoial i coplexity i practice it is tractable o a desktop PC for coplex systes with hudreds of essages. (A uber of techiques are also available for icreasig the efficiecy of such fixed poit iteratios [12]). 4. Schedulability Aalysis with FIFO Queues I this sectio, we derive sufficiet schedulability aalysis for essages o etworks with both PQodes ad FQodes. The aalysis we itroduce is FIFOsyetric, by this we ea that the sae worstcase respose tie is attributed to all of the essages i a FIFO group. We ote that FIFOsyetric aalysis icurs soe pessiis i ters of the worstcase respose tie attributed to the higher priority essages i a FIFO group; however, i practice this pessiis is likely to be sall. This is because the order i which essages are placed i a FIFO queue is udefied, ad so i the worst case, the highest priority essage i a FIFO group has to wait for a istace of each lower priority essage i the group to be trasitted Priorityqueued essages We ow derive a upper boud o the worstcase queuig delay for a priorityqueued essage, i a syste with both PQodes ad FQodes. I the case of systes with oly PQodes, Davis et al. [11] showed that the worstcase queuig delay for a priorityqueued essage occurs for a istace of that essage queued at the begiig of a priority level busy period 7 that starts iediately after the logest lower priority essage begis trasissio. Further, this axial busy period begis with a socalled critical istat where essage is queued siultaeously with all higher priority essages ad the each of these higher priority essages is subsequetly queued agai after the shortest possible tie iterval. Equatio (2) provides a sufficiet upper boud o this worstcase queuig delay. The aalysis ebodied i (2) assues that higher priority essages are able to copete for access to the bus (i.e. eter bus arbitratio) as soo as they are queued; however, this assuptio does ot hold for FIFOqueued essages. Istead a FIFOqueued essage k ay have to wait for up to a axiu tie f k before it becoes the oldest essage i its FIFO queue, ad ca eter prioritybased arbitratio. A FIFOqueued essage k ca therefore be thought of as becoig priority queued after a additioal delay of f k. Stated otherwise, i ters of its 6 Equatio (2) is sufficiet rather tha exact due to the fact that push through blockig ay ot ecessarily be possible. 7 A priority level busy period is a cotiguous iterval of tie durig which there is always at least oe essage of priority that has ot yet copleted trasissio. iterferece o lower priority essages, a FIFOqueued essage k ca be viewed as if it were a priorityqueued essage with its jitter icreased by f k. (Note, we will retur to how f k is calculated for FIFOqueued essages later). A upper boud o the queuig delay for a priorityqueued essage ca therefore be calculated via the fixed poit iteratio give by (5). J k f k + τ bit = ax( B, C ) + C k (5) k hp( ) Tk As with (3), iteratio starts with a suitable iitial value such 0 +1 as w = C, ad cotiues util either w + C > E i +1 which case the essage is ot schedulable, or w = i which case its respose tie is give by: +1 R = + C (6) Note that the queuig delay ad respose tie are oly valid with respect to the values of f k used. We retur to this poit later FIFOqueued essages We ow derive a upper boud o the worstcase queuig delay for a FIFOqueued essage, i a syste with both PQodes ad FQodes. As our aalysis is FIFOsyetric, we will attribute the sae upper boud respose tie to all of the essages set by the sae FQode. Our aalysis derives this sufficiet respose tie by cosiderig a arbitrary essage fro the FIFO group M (). For the sake of siplicity, we will still refer to this essage as essage ; however our aalysis will be idepedet of the exact choice of essage fro the FIFO group. At each stage i our aalysis we will ake worstcase assuptios, esurig that the derived respose tie is a correct upper boud. For exaple, we will frae our calculatio of the queuig delay w by assuig the lowest priority L of ay essage i the FIFO group. As every essage j i M () has D j T j the i a schedulable syste, whe ay arbitrary essage fro M () is queued, there ca be at ost oe istace of each of the other essages i M () ahead of it i the FIFO queue. The axiu trasissio tie of these essages, ad hece the axiu iterferece o a arbitrary essage, due to essages set by the sae FQode, is therefore upper bouded by: SUM MIN C C (7) Idirect blockig could also occur due to the opreeptive trasissio of a previous istace of ay oe of the essages i M (). This idirect blockig is upper MAX bouded by C. As a alterative, direct blockig could occur due to trasissio of ay of the essages of lower priority tha L set by other odes. Fially, i ters of iterferece fro higher priority essages set by other FQodes ad PQodes, the arguet about icreased jitter ade i the previous sectio applies, ad so the iterferece ter fro (5) ca agai be used. Cosiderig all of the above, a upper boud o the queuig delay for a arbitrary essage belogig to the FIFO group M () is give by the solutio to the followig
5 fixed poit iteratio: w + 1 MAX SUM = ax( B, ) + ( MIN L C C C ) + + J k + f k + τ bit Ck k hp L k M T k (8) ( ) ( ) Iteratio starts with a value of 0 = ax( B, MAX L C ) SUM MIN + ( C C ) ad cotiues util either +1 MIN MIN w + C > E i which case the set of essages +1 M () is declared uschedulable, or w = i which case all of the essages i M () are deeed to have a respose tie of: +1 MIN R = + C (9) Equatios (8) ad (9) ake the worstcase assuptio that iterferece fro higher priority essages ca occur up MIN to a tie C before trasissio of essage copletes. We ote that this is a pessiistic assuptio with respect to those essages belogig to the FIFO group that have trasissio ties 8 loger tha C. MIN 4.3. Schedulability test with arbitrary priorities We ow derive a schedulability test fro (5) & (6) ad (8) & (9). The basic idea is to avoid havig to cosider the potetially coplex iteractios betwee the FIFO queues of differet odes. This is achieved by abstractig the FIFO behaviour of essages set by other odes as siply additioal jitter f k before each essage k ca eter priority based arbitratio o the bus. Whe calculatig the respose tie of a give essage, we therefore eed oly cosider the behaviour of the ode that seds that essage (PQode or FQode) ad the bufferig delays of essages set by other odes 9. A upper boud o the bufferig tie f of a FIFOqueued essage is: MIN f = R C (10) Whe the priorities of essages i differet FIFO groups are iterleaved, this leads to a apparetly circular depedecy i the respose tie calculatios. For exaple, let ad k be the priorities of essages i two differet FIFO groups with iterleaved priorities (i.e. k hp( L ) ad hp( L k ) ). The respose tie R k of essage k, ad hece its bufferig tie f k, deped o the bufferig tie f of essage as hp( L k ) ; however, the bufferig tie f of essage depeds o its respose tie R which i tur depeds o f k as k hp( L ). This apparet proble ca be solved by otig that the respose ties calculated via (5) & (6) ad (8) & (9) are ootoically odecreasig with respect to the bufferig ties, ad that the bufferig ties give by (10) are ootoically o 8 I practice all essages set o CAN ofte have the axiu legth (8 data bytes) so as to iiise the relative overheads of the other fields i the essage (ID, CRC etc). I this case, o additioal pessiis is itroduced by this assuptio. 9 If the essage belogs to a PQode, the the other essages set by the sae ode have bufferig delays of zero, if it belogs to a FQode, the the bufferig delays for other essages set by the sae ode are ot eeded i the calculatios (8) &(9). decreasig with respect to the respose ties calculated via (8) & (9). Hece by usig a outer loop iteratio, ad repeatig respose tie calculatios util the bufferig ties o loger chage, we ca copute correct upper boud respose ties ad hece schedulability for all essages, as show i Algorith 1. (Note, to speed up the schedulability test, for each essage, the value of w coputed o oe iteratio of the while loop (lies 3 to 23) ca be used as a iitial value o the ext iteratio). 1 repeat = true 2 iitialise all f k = 0 3 while(repeat){ 4 repeat = false 5 for each priority, highest first{ 6 if ( is FIFOqueued){ 7 calc R accordig to Eqs (8) & (9) 8 if( R > E MIN ) { 9 retur uschedulable 10 } 11 if( f! = ){ 12 f = 13 repeat = true; 14 } 15 } 16 else { 17 calc R accordig to Eqs (5) & (6) 18 if( R > E MIN ) { 19 retur uschedulable 20 } 21 } 22 } 23 } 24 retur schedulable Algorith 1: FIFO Syetric Schedulability Test Algorith 1 provides a sufficiet schedulability test for FIFOqueued ad priorityqueued essages i ay arbitrary priority orderig Partial priority orderig withi a FIFO group I this sectio, we cosider a appropriate priority orderig for essages withi a FIFO group. Defiitio 2: A FIFOadjacet priority orderig is ay priority orderig whereby all of the essages sharig a FIFO queue are assiged adjacet priorities. Theore 1: If a priority orderig Q exists that is schedulable accordig to the FIFOsyetric schedulability aalysis of Algorith 1 the a schedulable FIFOadjacet priority orderig P also exists. Proof: Let be a FIFOqueued essage that is ot the lowest priority essage i its FIFO group. Now cosider a priority trasforatio whereby essage is shifted dow i priority so that it is at a priority level iediately above that of the lowest priority essage i its FIFO group. We will refer to the old priority orderig as Q ad the ew priority orderig as Q. We observe fro (5) ad (8), that give the sae fixed
6 set of bufferig ties f k, the (i) the respose tie coputed for essage is the sae for both priority orderigs, ad (ii) the respose ties coputed for all other essages are o larger i priority orderig Q tha they are i priority orderig Q. Due to the utual ootoically odecreasig relatioship betwee essage bufferig ties ad respose ties, ad the fact that Algorith 1 starts with all the bufferig ties set to zero, this eas that o every iteratio of Algorith 1, the respose ties ad bufferig ties coputed for each essage uder priority orderig Q are o larger tha those coputed o the sae iteratio for priority orderig Q. Hece if priority orderig Q is schedulable, the so is priority orderig Q. Applyig the priority trasforatio described above to every FIFOqueued essage that is ot the lowest priority essage i its FIFO group trasfors ay schedulable priority orderig Q ito a FIFOadjacet priority orderig P, without ay loss of schedulability Theore 1 tells us that regardless of the priority assiget applied to priorityqueued essages, we should esure that all of the essages that share a sigle FIFO queue have adjacet priorities. I ters of CAN essage IDs we ote that this does ot require that cosecutive values are used for the IDs, oly that there is o iterleavig with respect to the priorities of other essages. I practice essage IDs ca be chose to eet these requireets, while also providig appropriate bit patters for essage filterig Schedulability test for FIFOadjacet priorities I this sectio, we derive a iproved schedulability test that is oly valid for FIFOadjacet priority orderigs. Recall that Davis et al. [11] showed that the worstcase queuig delay for a priorityqueued essage occurs withi the priority level busy period that starts with a critical istat. Provided that a FIFOadjacet priority orderig is used, the the sae situatio also represets the worstcase sceario whe higher priority essages are set by either PQodes or FQodes. This ca be see by cosiderig the iterferece o a priorityqueued essage fro a higher priority FIFOqueued essage k. As essage k is of higher priority tha essage, the so are all of the other essages i the sae FIFO group (i.e. M (k) ). Thus ay essage i M (k) that is queued prior to the start of trasissio of essage will be set o the bus before essage, irrespective of the order i which the essages i M (k) are placed i the FIFO queue. I effect all of the additioal jitter o essage k is already accouted for by iterferece o essage fro other essages i the sae FIFO group ( M (k) ). I this case, there is o additioal jitter o essage k caused by essages of lower priority tha. Hece for each FIFO essage k, we ca set f k = 0, ad use (5) & (6) to calculate the queuig delay ad worstcase respose tie of each essage. The sae arguet applies whe we cosider the schedulability of a FIFOqueued essage. I this case we ca use (8) & (9) to calculate the queuig delay ad worstcase respose tie, with all bufferig ties f k = 0. Further, as the bufferig ties are all fixed at zero, a sigle pass over the priority levels is all that is eeded to deterie schedulability. I other words, lies of Algorith 1 ca be oitted whe cosiderig FIFOadjacet priority orderigs. This revised schedulability test therefore doiates the test give i sectio 4.3 (i.e. Algorith 1 with lies preset). The siplified aalysis give i this sectio is siilar to that provided for FP/FIFO schedulig of flows i [23] ad for OSEK/VDX tasks i [4], [19]. 5. Priority Assiget Policies The schedulability test preseted i sectio 4.5 is applicable irrespective of the overall priority orderig, provided that essages sharig the sae FIFO queue are assiged adjacet priorities. Choosig a appropriate priority orderig aog the priorityqueued essages ad the FIFO groups is however a iportat aspect of achievig overall schedulability ad hece effective realtie perforace. I this sectio, we cosider the assiget of essages to priority bads, where a priority bad coprises either a sigle priority level cotaiig oe priorityqueued essage, or a uber of adjacet priority levels cotaiig a FIFO group of essages. We derive priority assiget policies that are optial with respect to the schedulability aalysis give i sectio Optial priority assiget Davis et al. [11], showed that, assuig solely priority queuig, Audsley s Optial Priority Assiget (OPA) algorith [1], [2] provides the optial priority assiget for CAN essages. We ow show that with a appropriate odificatio to hadle FIFO groups, Audsley s algorith is also optial with respect to the schedulability test give i sectio 4.5. The pseudo code for this OPAFP/FIFO algorith is give i Algorith 2. Note that oly oe essage fro each FIFO group is cosidered i the iitial list, as oce this essage is assiged to a priority bad, the so are the other essages i the sae FIFO group. for each priority bad k, lowest first { for each essage sg i the iitial list { if sg is schedulable i priority bad k accordig to schedulability test S with all uassiged priorityqueued essages / other FIFO groups assued to be i higher priority bads { assig sg to priority bad k if sg is part of a FIFO group { assig all other essages i the FIFO group to adjacet priorities withi priority bad k } break (cotiue outer loop) } } retur uschedulable } retur schedulable Algorith 2: Optial Priority Assiget (OPAFP/FIFO) I [14] Davis ad Burs showed that Audsley s OPA
7 algorith is optial with respect to ay schedulability test that eets three specific coditios. Accordig to Theore 1, we eed oly cosider the priority bads assiged to each priorityqueued essage, ad each FIFO group (as all essages i a FIFO group have adjacet priorities i a optial priority orderig). We therefore restate these three coditios i the cotext of priorityqueued essages ad FIFO groups. The three coditios refer to properties or attributes of the essages. Message properties are referred to as idepedet if they have o depedecy o the priority assiged to the essage. For exaple the logest trasissio tie, deadlie, ad iiu iterarrival tie of a essage are all idepedet properties, while the worstcase respose tie typically depeds o the essage s priority ad so is a depedet property. Coditio 1: The schedulability of a essage / FIFO group idetified by, ay, accordig to test S, deped o ay idepedet properties of other essages / FIFO groups i higher priority bads tha, but ot o ay properties of those essages / FIFO groups that deped o their relative priority orderig. Coditio 2: The schedulability of a essage / FIFO group idetified by ay, accordig to test S, deped o ay idepedet properties of the essages / FIFO groups i lower priority bads tha, but ot o ay properties of those essages / FIFO groups that deped o their relative priority orderig. Coditio 3: Whe the priorities of ay two adjacet priority bads are swapped, the the essage / FIFO group beig assiged the higher priority bad caot becoe uschedulable accordig to test S, if it was previously schedulable i the lower priority bad. (As a corollary, the essage / FIFO group beig assiged the lower priority bad caot becoe schedulable accordig to test S, if it was previously uschedulable i the higher priority bad). Theore 2: The OPAFP/FIFO algorith is a optial priority assiget algorith with respect to the FIFOsyetric schedulability test of sectio 4.5 (Algorith 1 with lies oitted). Proof: It suffices to show that coditios 13 hold with respect to the schedulability test give by Algorith 1 with lies oitted. Coditio 1: Ispectio of (5) & (6) ad (8) & (9), assuig all f k are fixed at zero, shows that the respose tie of each essage is depedet o the set of essages i higher priority bads, but ot o their relative priority orderig. Coditio 2: Ispectio of (5) & (6) ad (8) & (9), shows that the respose tie of each essage is depedet o the set of essages i lower priority bads via the direct blockig ter, but ot o their relative priority orderig. Coditio 3: Ispectio of (5) & (6) ad (8) & (9), assuig all f k are fixed at zero, shows that icreasig the priority bad of essage caot result i a loger respose tie. This is because although the direct blockig ter ca get larger with icreasig priority this is always couteracted by a decrease i iterferece that is at least as large; hece the legth of the queuig delay caot icrease with icreasig priority, ad so either ca the respose tie For N priorityqueued essages / FIFO groups, the OPAFP/FIFO algorith perfors at ost N(N1)/2 schedulability tests ad is guarateed to fid a schedulable priority assiget if oe exists. It does ot however specify a order i which essages should be tried i each priority bad. This order heavily iflueces the priority assiget chose if there is ore tha oe orderig that is schedulable. I fact, a poor choice of iitial orderig ca result i a priority assiget that leaves the syste oly just schedulable. We suggest that, as a useful heuristic, priorityqueued essages ad FIFO groups are tried at each priority level i order of trasissio deadlie (i.e. E or MIN E ), largest value first. This will result i a priority orderig reflectig trasissio deadlies if such a orderig is schedulable. Alteratively, approaches which result i a robust priority assiget ca be developed fro the techiques described i [13] TDMOFP/FIFO priority assiget I idustrial practice, CAN cofiguratios are ofte desiged such that all of the essages are of the sae axiu legth (8 data bytes). This is doe to aeliorate the effects of the large overhead of the other fields (arbitratio, CRC etc) i each essage. Defiitio 3: Trasissio deadlie ootoic priority orderig for FP/FIFO (TDMPOFP/FIFO) is a priority assiget policy that assigs priority bads to priority queued essages ad FIFO groups accordig to their trasissio deadlies; with a shorter trasissio deadlie iplyig a higher priority. (Recall that the trasissio deadlie of a FIFO group is give by the shortest trasissio deadlie of ay essage i that group). Figure 1 illustrates the TDMPOFP/FIFO priority assiget policy. Theore 3: TDMPOFP/FIFO is a optial policy for assigig priorityqueued essages ad FIFO groups to priority bads, with respect to the sufficiet schedulability test give i sectio 4.5 (Algorith 1 with lies oitted), provided that all essages have the sae worstcase trasissio tie. Proof: See Appedix A. Corollary 1: For the case where all odes use priority queues ad all essages have the sae worstcase trasissio tie, TDMPOFPFIFO reduces to trasissio deadlie ootoic priority orderig, which is therefore a optial priority assiget policy with respect to the sufficiet schedulability test give by Davis et al. i [11] (recapitulated i sectio 3). Note that trasissio deadlie (i.e. Deadlie ius Jitter) ootoic priority orderig has also bee show to be a effective heuristic policy i the geeral case with ixed legth essages [13].
8 5.3. Priority iversio All of the essages i a FIFO group eed to have sufficietly high priorities that the essage with the shortest trasissio deadlie i the group ca still eet its deadlie. We have show that with the FIFOsyetric schedulability aalysis itroduced i this paper, the ost effective way to achieve this is to assig adjacet priorities to all of the essages i a FIFO group. Despite this, we ote that the use of FIFO queues still typically results i priority iversio with respect to the priority assiget that would be used if all odes ipleeted priority queues. The proble of priority iversio ca be see by cosiderig priority assiget accordig to the TDMPO FP/FIFO policy, see Figure 1 below. With oly PQodes, the priority assiged to each essage would deped oly o its trasissio deadlie, with a loger deadlie iplyig lower priority. With FIFO queues, there are two fors of priority iversio: iteral ad exteral. Iteral priority iversio takes place withi a FIFO queue whe essages with loger trasissio deadlies eter the queue before, ad so are trasitted ahead of, essages with shorter trasissio deadlies. Exteral priority iversio occurs because all of the essages i a FIFO group effectively obtai priorities based o the shortest trasissio deadlie of ay essage i that group. This has the effect of creatig priority iversio with respect to essages set by other odes that have trasissio deadlies betwee the axiu ad iiu trasissio deadlies of essages i the FIFO group. This is illustrated i Figure 1, where essages causig exteral priority iversio are shaded i grey. FIFO group1 FQsg1: E = 10 FQsg2: E = 25 FQsg3: E = 100 FIFO group2 FQsg4: E = 50 FQsg5: E = 100 FQsg6: E = 1000 FQsg7: E = 1000 FQsg8: E = 1000 PQsg1: E = 5 PQsg2: E = 10 FQgroup1: E MIN = 10 PQsg3: E = 20 PQsg4: E = 50 FQgroup2: E MIN = 50 PQsg5: E = 100 PQsg6: E = 250 PQsg7: E = 250 PQsg8: E = 500 Higher priority Lower priority Figure 1: TDMPOFP/FIFO priority orderig I Figure 1, observe that the essages withi each FIFO group have their priorities assiged accordig to trasissio deadlie ootoic priority assiget. We recoed this approach as although it does ot alter the sufficiet worstcase respose ties of the essages as calculated by our aalysis, i practice it could result i lower actual worstcase respose ties for those essages i the group that have shorter trasissio deadlies. 6. Case Study: Autootive To show that our priority assiget policies ad schedulability aalysis work with a real applicatio we aalysed a CAN bus architecture fro the autootive doai, first preseted i [22]. Figure 2 shows this architecture. The syste cosists of a 500 kbit/s CAN bus coectig 10 ECUs. There are a total of 85 essages set o the bus. The uber of essages set by each ECU is give by the aotatios i Figure 2. All essages are set strictly periodically ad have o offsets with respect to each other. We assued that the queuig jitter for each essage was 1% of its period. Figure 2: CAN bus architecture We copared five differet cofiguratios of the syste: Expt. 1: All ECUs used priority queues. Expt. 2: ECU3 ad ECU6 used FIFO queues ad the reaiig ECUs used priority queues. Expt. 3: All ECUs used FIFO queues. Expt. 4: All ECUs used priority queues, but the priority orderig was that established by Expt 3. Expt. 5: All ECUs used priority queues, but the priority orderig used was rado. I each experiet we deteried the lowest bus speed coesurate with a schedulable syste. The iiu bus speed was foud by a biary search with the essage priorities assiged accordig to the OPAFP/FIFO algorith (Algorith 2) usig trasissio deadlie ootoic priority orderig as the reverse orderig for the iitial list. (For each FIFO group, oly the essage with the shortest trasissio deadlie was icluded i the iitial list). Based o the priority orderig obtaied, we aalysed ad siulated the syste assuig a 500 kbit/s bus. The siulated etwork operatig tie was 1 hour. We used the coercial siulator chrosim fro Ichro [10] to produce the siulatio results. There are four lies plotted o each of the graphs. The lies give the followig iforatio for each essage: (i) trasissio deadlie; (ii) worstcase respose tie coputed usig the aalysis give i sectio 4.5, assuig a 500 Kbit/s bus; (iii) axiu observed respose tie foud by siulatio, assuig a 500 Kbit/s bus, ad (iv) worstcase respose tie coputed usig the aalysis give i sectio 4.5, assuig the iiu schedulable bus speed for the cofiguratio. All of this data is plotted i s o the yaxis usig a logarithic scale. The xaxis o the graphs represets the priority order of the essages. Hece data for the essage assiged the highest priority i a particular cofiguratio appears o the LHS of the graph, while data for the lowest
9 priority essage appears o the RHS. Note the priority order is differet i each experiet. Figure 3 depicts the results of Expt. 1, where all ECUs used priority queues. I this case, the iiu bus speed was 277 kbit/s, ad the correspodig bus utilisatio 84.5%. We observe that with this bus speed, the 26 th highest priority essage oly just eets its deadlie. Further, the results of aalysis ad siulatio for a 500 kbit/s bus are close together. This is because the essages have o offsets, ad all of the ECUs used prioritybased queues, hece there is very little pessiis i the aalysis, ad the siulatio captures the worstcase sceario well. Figure 4 depicts the results of Expt. 2, where ECU3 ad ECU6 used FIFO queues ad the other ECUs used priority queues. I this case, the iiu bus speed was 389 kbit/s, ad the correspodig bus utilisatio 60.1%. Our aalysis attributes the sae worstcase respose tie to all of the essages i a FIFO queue; this results i the horizotal segets of the aalysis lies i Figure 4. The first FIFO queue is the 12 essages set by ECU3, ad the secod, the 6 essages set by ECU6. The iiu trasissio deadlie for both FIFO queues was 13.8 s. Observe that i Figure 4 the results of aalysis ad siulatio are close together for the essages set via priority queues, whereas for the essages set via FIFO queue there are larger gaps. These gaps are predoiatly due to the siulatio ot capturig the worstcase sceario for all of the FIFOqueued essages. This is evidet fro the variability of the axiu respose ties obtaied via siulatio for essages i the sae FIFO group. Figure 4: Respose Ties (FQ ad PQ) Figure 5: Respose Ties (FQ oly) Figure 3: Respose Ties (PQ oly) Figure 6: Respose Ties (PQ oly, FQ priorities)
10 Figure 7: Respose Ties (PQ oly, rado priorities) Figure 5 depicts the results of Expt. 3, where all ECUs used FIFO queues. I this case, the iiu bus speed was 654 kbit/s, ad the correspodig bus utilisatio oly 35.8%. I cotrast to the Expt. 1 & 2, this cofiguratio was ot schedulable at a bus speed of 500 kbit/s. At 500 kbit/s, the 54 highest priority essages were foud to be schedulable by the aalysis. For the reaiig lower priority essages, soe appear to have worstcase respose ties that are less tha their deadlies; however, this does ot iply that such essages are schedulable. Oce a sigle higher priority essage is uschedulable, the the assuptios ade by the aalysis ay be broke ad the coputed worstcase respose ties o loger valid. For exaple, the aalysis assues that due to costraied deadlies at ost oe istace of each of the other essages i the sae FIFO group ay be ahead of a particular essage i the queue. If oe of the essages i a FIFO group caot eet its deadlie the this assuptio ay o loger hold. I Expt. 3, soe of the axiu respose ties observed i the siulatio are very low copared to the worstcase respose ties coputed by the aalysis. This is caused by differeces i the order i which essages eter the FIFO queues i the siulatio, copared to the assuptios ade by the aalysis. Figure 6 depicts the results of Expt. 4 which used the priority orderig obtaied i Expt. 3, but assued priority queues rather tha FIFO queues. I this case, the iiu bus speed required was 608 kbit/s, ad the correspodig bus utilisatio 38.5%. Copariso of these results with those fro Expt. 1 ad Expt. 3 shows that the ajority of the perforace degradatio caused by usig FIFO queues occurs as a result of uavoidable exteral priority iversio i the for of a disrupted priority orderig, rather tha as a cosequece of iteral priority iversio or pessiistic schedulability aalysis for FIFO queues. Fially, Expt. 5 exaied 1000 rado priority orderigs with o correlatio betwee essage priority ad trasissio deadlie. This experiet siulates assigig priorities to essages o the basis of the type of data or ECU, or ideed ay other etric that has little or o correlatio with essage trasissio deadlies. I this case, the ea value for the iiu bus speed required was 731 kbit/s (i. 618 kbit/s, ax. 750 kbit/s), ad the correspodig bus utilisatio 32.0% (ax. 37.8%, i. 31.2%). Figure 7 depicts the results of Expt. 5 for the worst of the rado priority orderigs, which required a iiu bus speed of 750 kbit/s to be schedulable. It is clear fro the graph, that it is the assiget of a low priority (80 th highest priority) to a essage with a short trasissio deadlie that results i the eed for such a high bus speed. Expt. 5 is directly coparable with Expt. 1 ad shows the iportace of appropriate priority assiget. I this case, arbitrary priority assiget icreased the iiu bus speed required by 163% while reducig the axiu schedulable bus utilisatio fro 84.5% to 32.0% (figures for the average case). The results of the experiets are suarised i Table 1 below. Table 1: Case Study: Suary of results Expt. Node type Priority order Mi bus speed Max bus util. 1 All PQ OPA 277 Kbit/s 84.5% 2 2 FQ, OPAFP/FIFO 389 Kbit/s 60.1% 8 PQ 3 All FQ OPAFP/FIFO 654 Kbit/s 35.8% 4 All PQ Priority orderig 608 Kbit/s 38.5% fro Expt. 3 5 All PQ Rado Kbit/s 32.0% 7. Experietal evaluatio I this sectio we explore further the effects that FIFO queues ad priority assiget policies have o the axiu bus utilisatio. Our experietal evaluatio exaied a syste with 8 odes ad 80 essages coected via a sigle CAN bus. We cosidered five differet cofiguratios of this etwork. I cofiguratio #1, all of the odes used priority queues. Cofiguratios #2, #3, ad #4 icreased the uber of odes usig FIFO queues fro 2, to 4 to 8 respectively. I cofiguratios #1 #4, essage priorities were assiged accordig to the TDMPOFP/FIFO policy as depicted i Figure 1. (As all the essages were of the sae legth, this priority orderig was optial). I cotrast, i cofiguratio #5, essage priorities were assiged at rado, ad all odes used priority queues. To exaie the perforace of these five cofiguratios, we radoly geerated 10,000 sets of essages as follows: o The period of each essage was chose accordig to a loguifor distributio fro the rage s; thus geeratig a equal uber of essages i each tie bad (e.g s, s etc.). o o The deadlie of each essage was equal to its period. The jitter of each essage was chose accordig to a uifor rado distributio i the rage 2.5s to 5s. 10 Values are the average for 1000 rado orderigs.
11 o Each essage cotaied 8 data bytes. o Each essage was radoly allocated to oe of the 8 odes o the etwork, thus o average, each ode trasitted 10 essages. o All essages were assued to have 11bit idetifiers. For each cofiguratio, we coputed the axiu bus utilisatio for each essage set. This was doe via a biary search cobied with the schedulability aalysis give i sectios 3 ad 4. The solid lies i Figure 8 illustrate the frequecy distributio of the axiu bus utilisatio across the 10,000 essage sets for each of the five cofiguratios. Fro Figure 8, it is clear that the use of FIFO queues sigificatly degrades the realtie perforace of the etwork. With all eight odes usig priority queues (#1), the ea value of the axiu bus utilisatio was 89.5%. With two odes usig FIFO queues (#2), this reduced to 62.7%, ad with four odes usig FIFO queues (#3) it further reduced to 44.9%. Fially, with all eight odes usig FIFO queues (#4) the ea value of the axiu bus utilisatio degraded to just 28.4%. Worse still was rado priority assiget (# 5) with a ea value of just 18.4%; despite usig priority queues. Figure 8 also shows results for the priority orderigs obtaied fro cofiguratios #2, #3, ad #4, but assuig that all odes use priority queues. These results are labelled #2a, #3a, ad #4a respectively (dashed lies). The differece betwee cofiguratios #1, #2a, #3a, ad #4a is idicative of the perforace degradatio caused by the FIFO queues due to exteral priority iversio (i.e. priority iversio with respect to essages set by other odes). By cotrast, the differece betwee the pairs of cofiguratios #2 #2a, #3 #3a, ad #4 #4a is idicative of the perforace degradatio caused by the FIFO queues due to iteral priority iversio (i.e. priority iversio with respect to essages set by the sae ode), ad also potetial pessiis i the schedulability aalysis for FIFO queues. As expected, the degradatio i perforace due to exteral priority iversio is uch larger tha that due to iteral priority iversio, which affects oly a liited uber of essages. We repeated our experietal evaluatio of a 8 ode syste for essage sets of size 20 ad 40. The for of the results ad the broad coclusios that ca be draw fro the reaied the sae as with essage sets of size 80. However, with fewer essages to radoly allocate to each ode, the perforace degradatio due to each FIFO queue becae soewhat saller. (This is expected as i the liit, with just oe essage per ode, FIFO ad priority queues are equivalet). Results for essage sets of sizes 20, 40 ad 80 are suarised i Table 2 ad depicted i Figure 8, Figure 9, ad Figure 10 respectively. Table 2: Evaluatio: Message sets of size 20 Cofig Node Priority Mea of Max. bus util. type order =20 =40 =80 1 All PQ TDMPO 86.8% 88.4% 89.5% 2 2 FQ, TDMPO 72.7% 68.1% 62.7% 8 PQ FP/FIFO 3 4 FQ, 4 TDMPO 61.6% 53.6% 44.9% PQ FP/FIFO 4 All FQ TDMPO 46.5% 36.9% 28.4% FP/FIFO 5 All PQ Rado 26.1% 21.5% 18.4% Frequecy PQ  Rado Priorities 4. FQ (All FIFO odes) 3. FQ ad PQ (Four FIFO odes) 5. PQ  Rado Priorities 4. FQ (All FIFO odes) 4a. PQ (Priorities fro 4.) 3. FQ ad PQ (Four FIFO odes) 3a. PQ (Priorities fro 3.) 2. FQ ad PQ (Two FIFO odes) 2a. PQ (Priorities fro 2.) 1. PQ (No FIFO odes) 2. FQ ad PQ (Two FIFO odes) 1. PQ (No FIFO odes) Breakdow Utilisatio Figure 8: Frequecy distributio of ax. bus utilisatio (8 odes, 80 essages, 10,000 essage sets)
12 Frequecy PQ  Rado Priorities 4. FQ (All FIFO odes) 5. PQ  Rado Priorities 4. FQ (All FIFO odes) 4a. PQ (Priorities fro 4.) 3. FQ ad PQ (Four FIFO odes) 3a. PQ (Priorities fro 3.) 2. FQ ad PQ (Two FIFO odes) 2a. PQ (Priorities fro 2.) 1. PQ (No FIFO odes) 1. PQ (No FIFO odes) FQ ad PQ (Four FIFO odes) 2. FQ ad PQ (Two FIFO odes) Breakdow Utilisatio Figure 9: Frequecy distributio of ax. bus utilisatio (8 odes, 40 essages, 10,000 essage sets) Frequecy PQ  Rado Priorities 5. PQ  Rado Priorities 4. FQ (All FIFO odes) 4a. PQ (Priorities fro 4.) 3. FQ ad PQ (Four FIFO odes) 3a. PQ (Priorities fro 3.) 2. FQ ad PQ (Two FIFO odes) 2a. PQ (Priorities fro 2.) 1. PQ (No FIFO odes) 1. PQ (No FIFO odes) 4. FQ (All FIFO odes) 2. FQ ad PQ (Two FIFO odes) 3. FQ ad PQ (Four FIFO odes) Breakdow Utilisatio Figure 10: Frequecy distributio of ax. bus utilisatio (8 odes, 20 essages, 10,000 essage sets) 8. Suary ad Coclusios The ajor cotributio of this paper is the derivatio of sufficiet respose tie aalysis for CAN where soe of the odes o the etwork ipleet FIFO queues, while others ipleet priority queues. This aalysis is FIFOsyetric i that it attributes the sae worstcase respose tie (easured fro the tie a essage is queued i the sedig ode util it is received by other odes o the bus) to all of the essages that share the sae FIFO. For this schedulability aalysis, we proved that it is optial to assig adjacet priorities to essages that share the sae FIFO. We odified Audsley s Optial Priority Assiget algorith to provide a overall priority assiget policy (OPAFP/FIFO) that is optial with respect to our aalysis for both priorityqueued essages ad groups of essages
13 that share a FIFO. Further, we showed that a siple policy based o trasissio deadlies (TDMPOFP/FIFO), depicted i Figure 1, is optial with respect to our aalysis for the specific case whe all essages are of the sae legth. Although this paper provides schedulability aalysis for CAN assuig FIFO queues, we caot recoed the use of such queues. By copariso with priority queues, FIFO queues ievitably cause priority iversio which is detrietal to realtie perforace. The use of FIFO queues icreases the iiu bus speed ecessary to esure that all deadlies are et. This was illustrated i our case study where allowig just two ECUs (sedig 18 out of the 85 essages) to use FIFO queues icreased the iiu bus speed required fro 277 kbit/s with priority queues to 389 kbit/s, a 40% icrease. With all ECUs usig FIFO queues, the iiu bus speed required icreased to 654 kbit/s; a icrease of over 130%. Usig FIFO queues reduces the axiu bus utilisatio achievable before ay deadlies are issed, thus liitig the scope for extedig a syste by addig further essages without havig to icrease bus speed. I our case study, the axiu bus utilisatio with priority queues was 84.5%, this reduced to 60.1% whe two ECUs used FIFO queues, ad to just 35.8% whe all of the ECUs used FIFO queues. These figures were backedup by our experietal evaluatio of a eight ode syste with 80 essages. This evaluatio of 10,000 radoly geerated essage sets showed a degradatio i the ea value of the axiu bus utilisatio fro 89.5% with all odes usig priority queues, to 62.7% with two odes usig FIFO queues, to 44.9% with four odes usig FIFO queues, to just 28.4% with all eight odes usig FIFO queues. Such reductios i achievable utilisatio ot oly icrease the iiu bus speed required to obtai a schedulable etwork, but also decrease the robustess of the etwork to errors that result i essage retrasissio. We recoed that CAN device drivers / software protocol layers ipleet prioritybased queues, rather tha FIFO queues wheever possible. FIFO queues are appealig because they are sipler to ipleet ad ake the device driver appear ore efficiet; however, this perceived local gai typically coes at the expese of uderiig the prioritybased essage arbitratio schee used by CAN, ad sigificatly degradig the overall realtie perforace capability of the etwork. We ote that the degree of priority iversio caused ad hece the degradatio i perforace due to usig FIFO queues is lower whe oly a few essages use each FIFO queue or alteratively whe the essages that use each FIFO queue have siilar trasissio deadlies. Uder these circustaces, the use of FIFO queues alog with appropriate priority assiget ay result i a satisfactory solutio. If o the other had, FIFO queues are used for large ubers of essages with a wide rage of trasissio deadlies, the this ca be expected to have a sigificat detrietal ipact o etwork perforace. For ECUs that act as a gateway fro oe CAN bus to aother ad thus have a large uber of essages to trasit, if a priority queue ipleetatio is ot possible, the syste desigers ay wish to cosider usig ultiple FIFO queues each utilisig a separate hardware trasit buffer. A allocatio of essages to these ultiple FIFO queues ca the ai to avoid assigig essages with widely differig trasissio deadlies to the sae FIFO queue, while also keepig the uber of essages i each FIFO queue relatively sall. This approach ca result i sigificatly higher etwork perforace tha the alterative of usig a sigle FIFO queue. The schedulability aalysis ad priority assiget policies give i this paper provide the tools ecessary to ivestigate such tradeoffs. Fially, both our case study ad experietal evaluatio cofired that appropriate priority assiget is vital to obtaiig effective realtie perforace fro Cotroller Area Networks. Usig a rado priority assiget policy, represetative of priority assiget based o the type of data ad ECU, or ideed ay other etric that has little or o correlatio with trasissio deadlies, icreased the iiu bus speed required fro 277 kbit/s to 731 kbit/s, ad reduced the axiu bus utilisatio fro 84.5% to just 32.0% i the case study, as copared to a optial priority assiget policy. This data was backed up by our experietal evaluatio of a eight ode syste with 80 essages. Here, for essage sets of size 80, such a priority assiget policy resulted i values for the axiu bus utilisatio, for 10,000 radoly geerated essage sets, i the rage 8% to 45% with a ea of just 18.4%, copared to a rage of 69% to 96% ad a ea of 89.5% whe a optial priority assiget policy was used. We therefore strogly recoed that i Cotroller Area Networks, essage IDs are assiged usig a optial or ear optial priority orderig reflectig essage trasissio deadlies. Ackowledgeets The authors would like to thak Ala Burs for his coets o a previous draft of this paper. This work was partially fuded by the UK EPSRC fuded Tepo project (EP/G055548/1), the EU fuded ArtistDesig Network of Excellece, the Gera Research Foudatio, ad the Carl Zeiss Foudatio. 9. Refereces [1] N.C. Audsley, "Optial priority assiget ad feasibility of static priority tasks with arbitrary start ties", Techical Report YCS 164, Dept. Coputer Sciece, Uiversity of York, UK, Dec [2] N.C. Audsley, O priority assiget i fixed priority schedulig, Iforatio Processig Letters, 79(1): 3944, May [3] Bosch. CAN Specificatio versio 2.0. Robert Bosch GbH, Postfach , D Stuttgart, [4] F. Bibard ad L. George. FP/FIFO feasibility coditios with kerel overheads for periodic tasks o a evet drive OSEK syste. I Proceedig of ISORC, [5] I. Broster, A. Burs, G. RodríguezNavas, Probabilistic Aalysis of CAN with Faults, I Proceedigs of the 23rd IEEE RealTie Systes Syposiu (RTSS'02), pp , Deceber, 2002.
14 [6] I. Broster ad A. Burs. A Aalysable BusGuardia for Evet Triggered Couicatio. I Proceedigs of the 24th Realtie Systes Syposiu, pp , IEEE Coputer Society Press, Deceber [7] I. Broster. Flexibility i depedable couicatio. PhD Thesis, Departet of Coputer Sciece, Uiversity of York, UK, August [8] I. Broster, A. Burs ad G. RodriguezNavas, Tiig aalysis of realtie couicatio uder electroagetic iterferece, RealTie Systes, 30(12) pp , May [9] L. Casparsso, A. Rajak, K. Tidell, ad P. Malberg. Volcao  a revolutio i oboard couicatios. Volvo Techology Report, 1998/1. [10] chrosim. [11] R.I. Davis, A. Burs, R.J. Bril, ad J.J. Lukkie. Cotroller Area Network (CAN) Schedulability Aalysis: Refuted, Revisited ad Revised. RealTie Systes, Volue 35, Nuber 3, pp , April [12] R.I. Davis, A. Zabos, A. Burs, "Efficiet Exact Schedulability Tests for Fixed Priority RealTie Systes. IEEE Trasactios o Coputers IEEE Coputer Society Digital Library. IEEE Coputer Society, Septeber 2008 (Vol. 57, No. 9) pp [13] R.I. Davis, A. Burs "Robust priority assiget for essages o Cotroller Area Network (CAN). RealTie Systes, Volue 41, Issue 2, pages , February [14] R.I. Davis ad A. Burs, "Iproved Priority Assiget for Global Fixed Priority Preeptive Schedulig i Multiprocessor RealTie Systes. RealTie Systes, Volue 47, Issue 1, pages 140, [15] M. Di Natale, Uderstadig ad usig the Cotroller Area etwork ist.eecs.berkeley.edu/~ee249/fa08/lectures/ hadout_cabus2.pdf. [16] M. Di Natale, Evaluatig essage trasissio ties i Cotroller Area Networks without buffer preeptio, I 8th Brazilia Workshop o RealTie Systes, [17] J. Ferreira, A. Oliveira, P. Foseca, J. A. Foseca. A Experiet to Assess Bit Error Rate i CAN. I Proceedigs of 3rd Iteratioal Workshop of RealTie Networks (RTN2004), pp , Cataia, Italy. Jue [18] H. Hasso, T. Nolte, C. Norstro, ad S. Puekkat. Itegratig Reliability ad Tiig Aalysis of CANbased Systes. IEEE Trasactio o Idustrial Electroics, 49(6): , Deceber [19] P. Hladik, A. Deplache, S. Faucou, ad Y. Triquet, Schedulability aalysis of OSEKNVDX applicatios. I Proceedigs RTNS, [20] D.A. Kha, R.J. Bril, N. Navet, "Itegratig hardware liitatios i CAN schedulability aalysis," IEEE Iteratioal Workshop o Factory Couicatio Systes (WFCS) pp , May doi: /WFCS [21] ISO Road Vehicles iterchage of digital iforatio cotroller area etwork (CAN) for highspeed couicatio, ISO Stadard11898, Iteratioal Stadards Orgaisatio (ISO), Nov [22] S. Kolla, V. Pollex, K. Kepf, F. Sloka, M. Traub, T. Boe, J. Becker (2010). "Coparative Applicatio of RealTie Verificatio Methods to a Autootive Architecture, " I Proceedigs of the 18th Iteratioal Coferece o RealTie ad Network Systes, Nov [23] S. Marti, P. Miet, L. George, No preeptive Fixed Priority schedulig with FIFO arbitratio: uiprocessor ad distributed cases, Techical Report No. 5051, INRIA Rocquecourt, Dec [24] A. Meschi, M. DiNatale, ad M. Spuri, Priority iversio at the etwork adapter whe schedulig essages with earliest deadlie techiques, i Proceedigs of Euroicro Coferece o RealTie Systes, Jue [25] T. Nolte. Sharedrive schedulig of ebedded etworks, PhD Thesis, Malardale Uiversity Press, May [26] T. Nolte, H. Hasso, ad C. Norstro. Miiizig CAN resposetie aalysis jitter by essage aipulatio. I Proceedigs 8 th IEEE RealTie ad Ebedded Techology ad Applicatios Syposiu (RTAS'02), pp , Septeber [27] T. Nolte, H. Hasso, ad C. Norstro, "Probabilistic worstcase resposetie aalysis for the Cotroller Area Network." I Proceedigs of the 9th IEEE RealTie ad Ebedded Techology ad Applicatios Syposiu (RTAS'03), pp , May [28] J. Rufio, P. Verissio, G. Arroz, C. Aleida, ad L. Rodrigues. Faulttolerat broadcasts i CAN. I Digest of Papers, The 28th IEEE Iteratioal Syposiu o FaultTolerat Coputig (FTCS 98). pp , Jue [29] STMicroelectroics, AN1077 Applicatio ote. Overview of ehaced CAN cotrollers for the ST7 ad ST9 MCUS 2001 (available fro [30] K.W. Tidell ad A. Burs. Guarateeig essage latecies o Cotroller Area Network (CAN), I Proceedigs of 1st Iteratioal CAN Coferece, pp. 111, Septeber [31] K.W. Tidell, A. Burs, ad A. J. Welligs. Calculatig Cotroller Area Network (CAN) essage respose ties. Cotrol Egieerig Practice, 3(8): , August [32] K.W. Tidell, H. Hasso, ad A.J. Welligs. Aalysig realtie couicatios: Cotroller Area Network (CAN). I Proceedigs 15th RealTie Systes Syposiu (RTSS 94), pp IEEE Coputer Society Press, Deceber [33] A. Zuhily ad A. Burs, Optiality of (DJ)Mootoic Priority Assiget. Iforatio Processig Letters, o. 103, pp , Apr Appedix A: Trasissio deadlie ootoic priority assiget I this appedix, we show that the TDMPOFP/FIFO priority assiget policy is optial, with respect to the sufficiet schedulability test give i sectio 4.5 (i.e. Algorith 1 with lies oitted) whe all essages have the sae worstcase trasissio tie (C). Corollary A.1: For etworks where all of the essage trasissio ties are the sae, the the blockig factor, used i both the sufficiet schedulability test give by Davis et al. i [11] (recapitulated i sectio 3) ad the sufficiet schedulability tests give i sectio 4 of this paper, is the sae for every essage, ad is equal to the worstcase essage trasissio tie (C). Lea A.1: For a set of essages that all have the sae worstcase trasissio tie (C). Let i ad j be the idices of two adjacet priority bads i a priority orderig that is schedulable accordig to the sufficiet schedulability test give i sectio 4.5 (i.e. Algorith 1 with lies oitted). Assue that i is of higher priority tha j, ad that the trasissio deadlie E X of the priorityqueued essage / FIFO group (X) iitially i priority bad i is loger tha the trasissio deadlie E Y of priorityqueued essage / FIFO group (Y) iitially i priority bad j. If the priorities of X ad Y are swapped, so that X is i the lower priority bad j, ad Y is i the higher priority bad i, the X reais schedulable. Proof: Let R Y, j be the respose tie of Y i priority bad j, (with X i the higher priority bad i). Siilarly, let R X, j be the respose tie of X i priority bad j, (with Y i the higher priority bad i). As Y is schedulable whe it is i the lower priority bad, the, RY, j EY, thus as E Y < E X, it follows that to prove the Lea, we eed oly show that R X, j RY, j. Further, as all essages have the sae worstcase trasissio tie (C), ad so the respose ties are equal to the queuig delays plus C, we eed oly copare the two queuig delays, referred to for coveiece as w X, j ad w Y, j. Below we give forulae for w X, j ad w Y, j based o (5) & (6) ad (8) & (9). We have separated out the iterferece ters for X ad Y. Further, we use B ( j) to represet the blockig factor, ad I ( i, w) to represet the
15 iterferece fro essages i higher priority bads. B( j) = ax( B j, C) = C w + J k + τ bit I i w C k hp i Tk (, ) = ( ) (i) Queuig delay w X, j (siplified by cacellig out the blockig factor C ad the C fro ( C X SUM C )) is give by: w 1 X, j + J k + τ + SUM bit wx, j = C X + C + I( i, w) (A.1) k Y T k Note, i (A.1), if X is a priorityqueued essage, the C X SUM = C, also, if Y is a priorityqueued essage, the there is oly oe essage k Y preset i the suatio ter; siilarly for (A.2) below. (ii) Queuig delay w Y, j : w 1 Y, j + J k + τ + SUM bit wy, j = CY + C + I( i, w) (A.2) k X T k We ca siplify (A.2) by otig that as Y is schedulable accordig to the assuptio give i the Lea, the w + C E < E = i( D J ) i( T J ) Y, j Y X k k X k k k X Hece, at ost oe istace of each essage i X ca cotribute to the iterferece ter ad so we have: + 1 SUM SUM w Y, j = CY + C X + I( i, w) (A.3) Now let us cosider the iterative solutio to (A.1), for all values of w E C < i( T J ) τ X, j Y k k bit, k X oly oe istace of each essage i Y ca cotribute to the iterferece ter. Hece for wx, j EY C, (A.1) reduces to: + 1 SUM SUM w X, j = C X + CY + I( i, w) (A.4) Equatios (A.3) ad (A.4) are the sae, hece as we kow that (A.3) coverges o a value wy, j EY C, the (A.4) ust also coverge o the sae value, hece w X, j = wy, j, ad so R X, j = RY, j Theore 3: TDMPOFP/FIFO is a optial policy for assigig priorityqueued essages ad FIFO groups to priority bads, with respect to the sufficiet schedulability test give i sectio 4.5 (Algorith 1 with lies oitted), provided that all essages have the sae worstcase trasissio tie. Proof: We prove the theore by showig that ay orderig Q of priority bads that is schedulable accordig to the sufficiet schedulability test give i sectio 4.5 ca be trasfored ito a TDMPOFP/FIFO priority orderig without ay loss of schedulability. Let i ad j be the idices of two adjacet priority bads i a orderig that is schedulable accordig to the sufficiet schedulability test give i sectio 4.5. Assue that i is of higher priority tha j, ad that the trasissio deadlie E of the priorityqueued essage / FIFO group (X) i X k priority bad i is loger tha the trasissio deadlie E Y of the priorityqueued essage / FIFO group (Y) i priority bad j. We ow cosider what happes to the schedulability of all of the essages i the syste whe we swap the priorities of X ad Y (i.e. whe we place X i the lower priority bad j, ad Y i the higher priority bad i) to create priority orderig Q. There are four cases to cosider: 1. Priority bads with higher priority tha i ( h hp(i) ): Ispectio of (5) & (6) ad (8) & (9) shows that the respose ties of each of the essages i these bads is the sae i priority orderig Q as it is i priority orderig Q. This is because the priority orderig of the essages with higher priorities tha h is uchaged ad the direct blockig factor due to the set of essages with lower priority tha h depeds oly o the set of essages lp (h) ad ot o their relative priority orderig, ad is i ay case equal to C for all priority bads. All of the essages i bads with priorities higher tha j are therefore schedulable i priority orderig Q. 2. Priority bad i: Y was previously schedulable i the lower priority bad j. Shiftig Y up i priority above X results i o chage to the blockig factor, but reoves iterferece due to X, hece the worstcase respose tie for Y ca be o greater tha it was i priority orderig Q, Y is therefore schedulable i priority orderig Q. 3. Priority bad j: Lea A.1 proves that X is schedulable i priority bad j. 4. Priority bads with lower priority tha j ( l hp( j) ): Ispectio of (5) & (6) ad (8) & (9) shows that the respose ties of each of these essages is the sae i priority orderig Q as it is i priority orderig Q. This is because the set of essages i higher priority bads is the sae i both orderigs, ad the iterferece due to higher priority essages does ot deped o their relative priority orderig. Further, the blockig factor due to the set of essages with lower priority tha l depeds oly o the set of essages lp (l) ad ot o their relative priority orderig, ad is i ay case equal to C for all priority bads. All of the essages i bads with priorities lower tha j are therefore schedulable i priority orderig Q. By repeatedly swappig the priorities of ay two adjacet priority bads that are ot i TDMPOFP/FIFO priority order, ay arbitrary schedulable priority orderig Q ca be trasfored ito a TDMPOFP/FIFO priority orderig without ay loss of schedulability.
Controller Area Network (CAN) Schedulability Analysis: Refuted, Revisited and Revised
Cotroller Area Networ (CAN) Schedulability Aalysis: Refuted, Revisited ad Revised Robert. Davis ad Ala Burs Realie Systes Research Group, Departet of Coputer Sciece, Uiversity of Yor, YO1 5DD, Yor (UK)
More informationThe Binomial Multi Section Transformer
4/15/21 The Bioial Multisectio Matchig Trasforer.doc 1/17 The Bioial Multi Sectio Trasforer Recall that a ultisectio atchig etwork ca be described usig the theory of sall reflectios as: where: Γ ( ω
More informationAnt Colony Algorithm Based Scheduling for Handling Software Project Delay
At Coloy Algorith Based Schedulig for Hadlig Software Project Delay Wei Zhag 1,2, Yu Yag 3, Juchao Xiao 4, Xiao Liu 5, Muhaad Ali Babar 6 1 School of Coputer Sciece ad Techology, Ahui Uiversity, Hefei,
More informationDistributed Storage Allocations for Optimal Delay
Distributed Storage Allocatios for Optial Delay Derek Leog Departet of Electrical Egieerig Califoria Istitute of echology Pasadea, Califoria 925, USA derekleog@caltechedu Alexadros G Diakis Departet of
More informationCHAPTER 4: NET PRESENT VALUE
EMBA 807 Corporate Fiace Dr. Rodey Boehe CHAPTER 4: NET PRESENT VALUE (Assiged probles are, 2, 7, 8,, 6, 23, 25, 28, 29, 3, 33, 36, 4, 42, 46, 50, ad 52) The title of this chapter ay be Net Preset Value,
More informationECONOMICS. Calculating loan interest no. 3.758
F A M & A N H S E E S EONOMS alculatig loa iterest o. 3.758 y Nora L. Dalsted ad Paul H. Gutierrez Quick Facts... The aual percetage rate provides a coo basis to copare iterest charges associated with
More informationTaking DCOP to the Real World: Efficient Complete Solutions for Distributed MultiEvent Scheduling
Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed MultiEvet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria
More informationUsing a Packet Sniffer to Analyze the Efficiency and Power of Encryption Techniques Used to Protect Data Over a Computer Network
sig a Packet Siffer to Aalyze the Efficiecy ad Power of Ecryptio Techiques sed to Protect Data Over a Coputer Network Seyo Litviov Statistics Departet/MCS Progra St. Cloud State iversity slitviov@stcloudstate.edu
More informationThroughput and Delay Analysis of Hybrid Wireless Networks with MultiHop Uplinks
This paper was preseted as part of the ai techical progra at IEEE INFOCOM 0 Throughput ad Delay Aalysis of Hybrid Wireless Networks with MultiHop Upliks Devu Maikata Shila, Yu Cheg ad Tricha Ajali Dept.
More informationStretch Factor of Curveball Routing in Wireless Network: Cost of Load Balancing
Stretch Factor of urveball outig i Wireless Network: ost of Load Balacig Fa Li Yu Wag The Uiversity of North arolia at harlotte, USA Eail: {fli, yu.wag}@ucc.edu Abstract outig i wireless etworks has bee
More informationIn nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008
I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces
More informationA Comparison of Hypothesis Testing Methods for the Mean of a LogNormal Distribution
World Applied Scieces Joural (6): 845849 ISS 88495 IDOSI Publicatios A Copariso of Hypothesis Testig ethods for the ea of a ogoral Distributio 3 F. egahdari K. Abdollahezhad ad A.A. Jafari Islaic Azad
More informationInteger programming solution methods. Exactly where on this line this optimal solution lies we do not know, but it must be somewhere!
Iteger prograig solutio ethods J E Beasley Itroductio Suppose that we have soe proble istace of a cobiatorial optiisatio proble ad further suppose that it is a iiisatio proble. If, as i Figure 1, we draw
More informationDepartment of Computer Science, University of Otago
Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS200609 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly
More informationDomain 1: Designing a SQL Server Instance and a Database Solution
Maual SQL Server 2008 Desig, Optimize ad Maitai (70450) 18004186789 Domai 1: Desigig a SQL Server Istace ad a Database Solutio Desigig for CPU, Memory ad Storage Capacity Requiremets Whe desigig a
More informationCCell: An Efficient and Scalable Network Structure for Data Centers
2612 JOURNAL OF SOFTWARE, VOL 8, NO 1, OCTOBER 213 CCell: A Efficiet ad Scalable Network Structure for Data Ceters Hui Cai Logistical Egieerig Uiversity of PLA, Chogqig, Chia Eail: caihui_cool@126co ShegLi
More informationGSR: A Global Stripebased Redistribution Approach to Accelerate RAID5 Scaling
: A Global based Redistributio Approach to Accelerate RAID5 Scalig Chetao Wu ad Xubi He Departet of Electrical & Coputer Egieerig Virgiia Coowealth Uiversity {wuc4,xhe2}@vcu.edu Abstract Uder the severe
More information.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth
Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,
More informationIncremental calculation of weighted mean and variance
Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationA Cyclical Nurse Schedule Using Goal Programming
ITB J. Sci., Vol. 43 A, No. 3, 2011, 151164 151 A Cyclical Nurse Schedule Usig Goal Prograig Ruzzaiah Jeal 1,*, Wa Rosaira Isail 2, Liog Choog Yeu 3 & Ahed Oughalie 4 1 School of Iforatio Techology, Faculty
More information4.1 Sigma Notation and Riemann Sums
0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas
More informationVladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT
Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee
More informationarxiv:0903.5136v2 [math.pr] 13 Oct 2009
First passage percolatio o rado graphs with fiite ea degrees Shakar Bhaidi Reco va der Hofstad Gerard Hooghiestra October 3, 2009 arxiv:0903.536v2 [ath.pr 3 Oct 2009 Abstract We study first passage percolatio
More information1 Correlation and Regression Analysis
1 Correlatio ad Regressio Aalysis I this sectio we will be ivestigatig the relatioship betwee two cotiuous variable, such as height ad weight, the cocetratio of a ijected drug ad heart rate, or the cosumptio
More informationINTEGRATED TRANSFORMER FLEET MANAGEMENT (ITFM) SYSTEM
INTEGRATED TRANSFORMER FLEET MANAGEMENT (ITFM SYSTEM Audrius ILGEVICIUS Maschiefabrik Reihause GbH, a.ilgevicius@reihause.co Alexei BABIZKI Maschiefabrik Reihause GbH a.babizki@reihause.co ABSTRACT The
More informationSpot Market Competition in the UK Electricity Industry
Spot Market Copetitio i the UK Electricity Idustry NilsHerik M. vo der Fehr Uiversity of Oslo David Harbord Market Aalysis Ltd 2 February 992 Abstract With particular referece to the structure of the
More informationCDAS: A Crowdsourcing Data Analytics System
CDAS: A Crowdsourcig Data Aalytics Syste Xua Liu,MeiyuLu, Beg Chi Ooi, Yaya She,SaiWu, Meihui Zhag School of Coputig, Natioal Uiversity of Sigapore, Sigapore College of Coputer Sciece, Zhejiag Uiversity,
More informationCHAPTER 3 THE TIME VALUE OF MONEY
CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all
More informationSupply Chain Network Design with Preferential Tariff under Economic Partnership Agreement
roceedigs of the 2014 Iteratioal oferece o Idustrial Egieerig ad Oeratios Maageet Bali, Idoesia, Jauary 7 9, 2014 Suly hai Network Desig with referetial ariff uder Ecooic artershi greeet eichi Fuaki Yokohaa
More informationSequences II. Chapter 3. 3.1 Convergent Sequences
Chapter 3 Sequeces II 3. Coverget Sequeces Plot a graph of the sequece a ) = 2, 3 2, 4 3, 5 + 4,...,,... To what limit do you thik this sequece teds? What ca you say about the sequece a )? For ǫ = 0.,
More informationCharacterizing EndtoEnd Packet Delay and Loss in the Internet
Characterizig EdtoEd Packet Delay ad Loss i the Iteret JeaChrysostome Bolot Xiyu Sog Preseted by Swaroop Sigh Layout Itroductio Data Collectio Data Aalysis Strategy Aalysis of packet delay Aalysis of
More informationChapter 5 Unit 1. IET 350 Engineering Economics. Learning Objectives Chapter 5. Learning Objectives Unit 1. Annual Amount and Gradient Functions
Chapter 5 Uit Aual Amout ad Gradiet Fuctios IET 350 Egieerig Ecoomics Learig Objectives Chapter 5 Upo completio of this chapter you should uderstad: Calculatig future values from aual amouts. Calculatig
More informationConfidence Intervals for One Mean
Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a
More informationOutput Analysis (2, Chapters 10 &11 Law)
B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should
More informationThe Computational Rise and Fall of Fairness
Proceedigs of the TwetyEighth AAAI Coferece o Artificial Itelligece The Coputatioal Rise ad Fall of Fairess Joh P Dickerso Caregie Mello Uiversity dickerso@cscuedu Joatha Golda Caregie Mello Uiversity
More informationEstimating Probability Distributions by Observing Betting Practices
5th Iteratioal Symposium o Imprecise Probability: Theories ad Applicatios, Prague, Czech Republic, 007 Estimatig Probability Distributios by Observig Bettig Practices Dr C Lych Natioal Uiversity of Irelad,
More informationCHAPTER 3 DIGITAL CODING OF SIGNALS
CHAPTER 3 DIGITAL CODING OF SIGNALS Computers are ofte used to automate the recordig of measuremets. The trasducers ad sigal coditioig circuits produce a voltage sigal that is proportioal to a quatity
More informationOptimizing Result Prefetching in Web Search Engines. with Segmented Indices. Extended Abstract. Department of Computer Science.
Optiizig Result Prefetchig i Web Search Egies with Segeted Idices Exteded Abstract Roy Lepel Shloo Mora Departet of Coputer Sciece The Techio, Haifa 32000, Israel eail: frlepel,orag@cs.techio.ac.il Abstract
More information5 Boolean Decision Trees (February 11)
5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected
More informationI. Chisquared Distributions
1 M 358K Supplemet to Chapter 23: CHISQUARED DISTRIBUTIONS, TDISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad tdistributios, we first eed to look at aother family of distributios, the chisquared distributios.
More informationAsymptotic Growth of Functions
CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll
More informationRecursion and Recurrences
Chapter 5 Recursio ad Recurreces 5.1 Growth Rates of Solutios to Recurreces Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer. Cosider, for example,
More informationHypothesis testing. Null and alternative hypotheses
Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate
More informationC.Yaashuwanth Department of Electrical and Electronics Engineering, Anna University Chennai, Chennai 600 025, India..
(IJCSIS) Iteratioal Joural of Computer Sciece ad Iformatio Security, A New Schedulig Algorithms for Real Time Tasks C.Yaashuwath Departmet of Electrical ad Electroics Egieerig, Aa Uiversity Cheai, Cheai
More informationImpacts of the Collocation Window on the Accuracy of Altimeter/Buoy Wind Speed Comparison A Simulation Study. Ge Chen 1,2
Ge Che Ipacts of the Collocatio Widow o the ccuracy of ltieter/uoy Wid Speed Copariso Siulatio Study Ge Che, Ocea Reote Sesig Istitute, Ocea Uiversity of Qigdao 5 Yusha Road, Qigdao 66003, Chia Eail:
More informationModified Line Search Method for Global Optimization
Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o
More informationSOLAR POWER PROFILE PREDICTION FOR LOW EARTH ORBIT SATELLITES
Jural Mekaikal Jue 2009, No. 28, 115 SOLAR POWER PROFILE PREDICTION FOR LOW EARTH ORBIT SATELLITES Chow Ki Paw, Reugath Varatharajoo* Departet of Aerospace Egieerig Uiversiti Putra Malaysia 43400 Serdag,
More informationHow to read A Mutual Fund shareholder report
Ivestor BulletI How to read A Mutual Fud shareholder report The SEC s Office of Ivestor Educatio ad Advocacy is issuig this Ivestor Bulleti to educate idividual ivestors about mutual fud shareholder reports.
More informationAn Electronic Tool for Measuring Learning and Teaching Performance of an Engineering Class
A Electroic Tool for Measurig Learig ad Teachig Perforace of a Egieerig Class T.H. Nguye, Ph.D., P.E. Abstract Creatig a egieerig course to eet the predefied learig objectives requires a appropriate ad
More informationUnit 20 Hypotheses Testing
Uit 2 Hypotheses Testig Objectives: To uderstad how to formulate a ull hypothesis ad a alterative hypothesis about a populatio proportio, ad how to choose a sigificace level To uderstad how to collect
More information9.8: THE POWER OF A TEST
9.8: The Power of a Test CD91 9.8: THE POWER OF A TEST I the iitial discussio of statistical hypothesis testig, the two types of risks that are take whe decisios are made about populatio parameters based
More informationINVESTMENT PERFORMANCE COUNCIL (IPC) Guidance Statement on Calculation Methodology
Adoptio Date: 4 March 2004 Effective Date: 1 Jue 2004 Retroactive Applicatio: No Public Commet Period: Aug Nov 2002 INVESTMENT PERFORMANCE COUNCIL (IPC) Preface Guidace Statemet o Calculatio Methodology
More informationTrading the randomness  Designing an optimal trading strategy under a drifted random walk price model
Tradig the radomess  Desigig a optimal tradig strategy uder a drifted radom walk price model Yuao Wu Math 20 Project Paper Professor Zachary Hamaker Abstract: I this paper the author iteds to explore
More informationAnnuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.
Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio  Israel Istitute of Techology, 3000, Haifa, Israel I memory
More informationMARTINGALES AND A BASIC APPLICATION
MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measuretheoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this
More informationA probabilistic proof of a binomial identity
A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two
More informationThrough its open standards, the Internet set the foundation for
F E A T U R E Secure itraets are fouded o the protectio of logical resources accessible i corporate eterprises. A ROLE BASED ACCESS CONTROL FOR INTRANET SECURITY The proposed IRBAC, ZAHIR TARI AND SHUNWU
More informationGOAL PROGRAMMING BASED MASTER PLAN FOR CYCLICAL NURSE SCHEDULING
Joural of Theoretical ad Applied Iforatio Techology 5 th Deceber 202. Vol. 46 No. 2005202 JATIT & LLS. All rights reserved. ISSN: 9928645 www.jatit.org EISSN: 87395 GOAL PROGRAMMING BASED MASTER PLAN
More informationYour organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:
Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network
More informationLearning outcomes. Algorithms and Data Structures. Time Complexity Analysis. Time Complexity Analysis How fast is the algorithm? Prof. Dr.
Algorithms ad Data Structures Algorithm efficiecy Learig outcomes Able to carry out simple asymptotic aalysisof algorithms Prof. Dr. Qi Xi 2 Time Complexity Aalysis How fast is the algorithm? Code the
More informationTransient Vibration of the single degree of freedom systems.
Trasiet Vibratio of the sigle degree of freedo systes. 1. INTRODUCTION. Trasiet vibratio is defied as a teporarily sustaied vibratio of a echaical syste. It ay cosist of forced or free vibratios, or both
More informationINVESTMENT PERFORMANCE COUNCIL (IPC)
INVESTMENT PEFOMANCE COUNCIL (IPC) INVITATION TO COMMENT: Global Ivestmet Performace Stadards (GIPS ) Guidace Statemet o Calculatio Methodology The Associatio for Ivestmet Maagemet ad esearch (AIM) seeks
More informationKey Ideas Section 81: Overview hypothesis testing Hypothesis Hypothesis Test Section 82: Basics of Hypothesis Testing Null Hypothesis
Chapter 8 Key Ideas Hypothesis (Null ad Alterative), Hypothesis Test, Test Statistic, Pvalue Type I Error, Type II Error, Sigificace Level, Power Sectio 81: Overview Cofidece Itervals (Chapter 7) are
More informationODBC. Getting Started With Sage Timberline Office ODBC
ODBC Gettig Started With Sage Timberlie Office ODBC NOTICE This documet ad the Sage Timberlie Office software may be used oly i accordace with the accompayig Sage Timberlie Office Ed User Licese Agreemet.
More informationAnalyzing Longitudinal Data from Complex Surveys Using SUDAAN
Aalyzig Logitudial Data from Complex Surveys Usig SUDAAN Darryl Creel Statistics ad Epidemiology, RTI Iteratioal, 312 Trotter Farm Drive, Rockville, MD, 20850 Abstract SUDAAN: Software for the Statistical
More informationA zero one programming model for RNA structures with arc length 4
Iraia Joural of Matheatical Cheistry, Vol. 3, No.2, Septeber 22, pp. 85 93 IJMC A zero oe prograig odel for RNA structures with arc legth 4 G. H. SHIRDEL AND N. KAHKESHANI Departet of Matheatics, Faculty
More informationLesson 17 Pearson s Correlation Coefficient
Outlie Measures of Relatioships Pearso s Correlatio Coefficiet (r) types of data scatter plots measure of directio measure of stregth Computatio covariatio of X ad Y uique variatio i X ad Y measurig
More informationwhere: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return
EVALUATING ALTERNATIVE CAPITAL INVESTMENT PROGRAMS By Ke D. Duft, Extesio Ecoomist I the March 98 issue of this publicatio we reviewed the procedure by which a capital ivestmet project was assessed. The
More informationDigital Interactive Kanban Advertisement System Using Face Recognition Methodology
Coputatioal Water, Eergy, ad Eviroetal Egieerig, 2013, 2, 2630 doi:10.4236/cweee.2013.23b005 Published Olie July 2013 (http://www.scirp.org/joural/cweee) Digital Iteractive Kaba Advertiseet Syste Usig
More informationMeasuring Magneto Energy Output and Inductance Revision 1
Measurig Mageto Eergy Output ad Iductace evisio Itroductio A mageto is fudametally a iductor that is mechaically charged with a iitial curret value. That iitial curret is produced by movemet of the rotor
More informationDefinition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean
1 Social Studies 201 October 13, 2004 Note: The examples i these otes may be differet tha used i class. However, the examples are similar ad the methods used are idetical to what was preseted i class.
More informationPerformance evaluation of largescale dynamic systems
Perforace ealuatio of largescale dyaic systes Eauelle ceaue, Roaric Ludiard, Bruo ericola To cite this ersio: Eauelle ceaue, Roaric Ludiard, Bruo ericola. Perforace ealuatio of largescale dyaic systes.
More informationOn the Capacity of Hybrid Wireless Networks
O the Capacity of Hybrid ireless Networks Beyua Liu,ZheLiu +,DoTowsley Departmet of Computer Sciece Uiversity of Massachusetts Amherst, MA 0002 + IBM T.J. atso Research Ceter P.O. Box 704 Yorktow Heights,
More informationMathematical goals. Starting points. Materials required. Time needed
Level A1 of challege: C A1 Mathematical goals Startig poits Materials required Time eeded Iterpretig algebraic expressios To help learers to: traslate betwee words, symbols, tables, ad area represetatios
More informationLecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)
18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the BruMikowski iequality for boxes. Today we ll go over the
More informationChatpun Khamyat Department of Industrial Engineering, Kasetsart University, Bangkok, Thailand ocpky@hotmail.com
SOLVING THE OIL DELIVERY TRUCKS ROUTING PROBLEM WITH MODIFY MULTITRAVELING SALESMAN PROBLEM APPROACH CASE STUDY: THE SME'S OIL LOGISTIC COMPANY IN BANGKOK THAILAND Chatpu Khamyat Departmet of Idustrial
More informationEngineering 323 Beautiful Homework Set 3 1 of 7 Kuszmar Problem 2.51
Egieerig 33 eautiful Homewor et 3 of 7 Kuszmar roblem.5.5 large departmet store sells sport shirts i three sizes small, medium, ad large, three patters plaid, prit, ad stripe, ad two sleeve legths log
More informationSubject CT5 Contingencies Core Technical Syllabus
Subject CT5 Cotigecies Core Techical Syllabus for the 2015 exams 1 Jue 2014 Aim The aim of the Cotigecies subject is to provide a groudig i the mathematical techiques which ca be used to model ad value
More informationProject Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments
Project Deliverables CS 361, Lecture 28 Jared Saia Uiversity of New Mexico Each Group should tur i oe group project cosistig of: About 612 pages of text (ca be loger with appedix) 612 figures (please
More informationThe Fundamental CapacityDelay Tradeoff in Large Mobile Ad Hoc Networks
The Fudametal CapacityDelay Tradeoff i Large Mobile Ad Hoc Networks Xiaoju Li ad Ness B. Shroff School of Electrical ad Computer Egieerig, Purdue Uiversity West Lafayette, IN 47907, U.S.A. {lix, shroff}@ec.purdue.edu
More informationConfiguring Additional Active Directory Server Roles
Maual Upgradig your MCSE o Server 2003 to Server 2008 (70649) 18004186789 Cofigurig Additioal Active Directory Server Roles Active Directory Lightweight Directory Services Backgroud ad Cofiguratio
More informationGCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number.
GCSE STATISTICS You should kow: 1) How to draw a frequecy diagram: e.g. NUMBER TALLY FREQUENCY 1 3 5 ) How to draw a bar chart, a pictogram, ad a pie chart. 3) How to use averages: a) Mea  add up all
More information5: Introduction to Estimation
5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample
More information*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature.
Itegrated Productio ad Ivetory Cotrol System MRP ad MRP II Framework of Maufacturig System Ivetory cotrol, productio schedulig, capacity plaig ad fiacial ad busiess decisios i a productio system are iterrelated.
More informationLecture 2: Karger s Min Cut Algorithm
priceto uiv. F 3 cos 5: Advaced Algorithm Desig Lecture : Karger s Mi Cut Algorithm Lecturer: Sajeev Arora Scribe:Sajeev Today s topic is simple but gorgeous: Karger s mi cut algorithm ad its extesio.
More informationDomain 1  Describe Cisco VoIP Implementations
Maual ONT (6428) 18004186789 Domai 1  Describe Cisco VoIP Implemetatios Advatages of VoIP Over Traditioal Switches Voice over IP etworks have may advatages over traditioal circuit switched voice etworks.
More informationInformation about Bankruptcy
Iformatio about Bakruptcy Isolvecy Service of Irelad Seirbhís Dócmhaieachta a héirea Isolvecy Service of Irelad Seirbhís Dócmhaieachta a héirea What is the? The Isolvecy Service of Irelad () is a idepedet
More information5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized?
5.4 Amortizatio Questio 1: How do you fid the preset value of a auity? Questio 2: How is a loa amortized? Questio 3: How do you make a amortizatio table? Oe of the most commo fiacial istrumets a perso
More informationSequences and Series
CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their
More informationQueuing Systems: Lecture 1. Amedeo R. Odoni October 10, 2001
Queuig Systems: Lecture Amedeo R. Odoi October, 2 Topics i Queuig Theory 9. Itroductio to Queues; Little s Law; M/M/. Markovia BirthadDeath Queues. The M/G/ Queue ad Extesios 2. riority Queues; State
More informationChapter 6: Variance, the law of large numbers and the MonteCarlo method
Chapter 6: Variace, the law of large umbers ad the MoteCarlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value
More information7. Sample Covariance and Correlation
1 of 8 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 7. Sample Covariace ad Correlatio The Bivariate Model Suppose agai that we have a basic radom experimet, ad that X ad Y
More informationRecovery time guaranteed heuristic routing for improving computation complexity in survivable WDM networks
Computer Commuicatios 30 (2007) 1331 1336 wwwelseviercom/locate/comcom Recovery time guarateed heuristic routig for improvig computatio complexity i survivable WDM etworks Lei Guo * College of Iformatio
More information(VCP310) 18004186789
Maual VMware Lesso 1: Uderstadig the VMware Product Lie I this lesso, you will first lear what virtualizatio is. Next, you ll explore the products offered by VMware that provide virtualizatio services.
More informationNonlife insurance mathematics. Nils F. Haavardsson, University of Oslo and DNB Skadeforsikring
Nolife isurace mathematics Nils F. Haavardsso, Uiversity of Oslo ad DNB Skadeforsikrig Mai issues so far Why does isurace work? How is risk premium defied ad why is it importat? How ca claim frequecy
More informationInfinite Sequences and Series
CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...
More informationFrance caters to innovative companies and offers the best research tax credit in Europe
1/5 The Frech Govermet has three objectives : > improve Frace s fiscal competitiveess > cosolidate R&D activities > make Frace a attractive coutry for iovatio Tax icetives have become a key elemet of public
More informationA Supply Chain Game Theory Framework for Cybersecurity Investments Under Network Vulnerability
A Supply Chai Gae Theory Fraework for Cybersecurity Ivestets Uder Network Vulerability Aa Nagurey, Ladier S. Nagurey, ad Shivai Shukla I Coputatio, Cryptography, ad Network Security, N.J. Daras ad M.T.
More information