A Framework for Scheduling Real-Time Systems
|
|
- Henry Berry
- 6 years ago
- Views:
Transcription
1 182 Int'l Conf. Pr. nd Dist. Proc. Tech. nd Appl. PDPTA'16 A Frmework for Scheduling Rel-Time Systems Zhuo Cheng, Hito Zhng, Ysuo Tn, nd Yuto Lim School of Informtion Science, Jpn Advnced Institute of Science nd Technology, Jpn {chengzhuo, ytn, ylim}@jist.c.jp School of Informtion Science nd Engineering, Lnzhou University, Chin htzhng@lzu.edu.cn Abstrct Rel-time system is plying n importnt role in our society. For such system, sensitivity to timing is the centrl feture of system behviors, which mens tsks in the systems re required to be completed before their dedlines. To gurntee this requirement, the design of scheduling is crucil. In this pper, bsed on stisfibility modulo theories (SMT), we provide frmework to design scheduling for rel-time systems. In the frmework, the problem of scheduling is treted s stisfibility problem. The key work is to formlize the stisfibility problem using first-order lnguge. After the formliztion, SMT solver (e.g., Z3, Yices) is employed to solver such stisfibility problem. An optiml schedule cn be generted bsed on solution model returned by the SMT solver. To demonstrte the prcticlity of the frmework, we give design guidelines for rel-time systems with multiprocessor. Through the demonstrtion, the frmework is found flexible nd sufficiently generl to pply to different kinds of rel-time systems. To the best of our knowledge, it is the first time tht systemticlly introducing SMT to solve series problems covering wide rnge in rel-time scheduling domin. Keywords rel-time scheduling, SMT, multiprocessor, stisfibility problem I. INTRODUCTION Rel-time system is plying n importnt role in our society. For exmple, chemicl nd nucler plnt control, spce missions, flight control, telecommunictions, nd multimedi systems re ll rel-time systems [1]. In such system, sensitivity to timing is the centrl feture of system behviors, which mens, tsks in the system re required to be completed before their dedlines. To provide such gurntee, the design of scheduling is crucil. The reserch on rel-time scheduling hs lsted for decdes, but still lots of chllenges remin [5]. For exmple, limited tsk models for multiprocessor systems, limited policies for ccess to shred resources, ineffective schedulbility tests, limited scheduling methods. In this pper, we try to ddress the chllenge limited scheduling methods. For designing scheduling method, mny reserch hs contributed to this re [8, 9, 10, 11]. But one importnt problem is tht ll the proposed methods re specified on either specific system rchitecture (e.g., uniprocessor) or specific scheduling trget (e.g., mke ll tsk meet dedline). Usully, it is quite difficult, even impossible, to dpt one scheduling method to nother ppliction scenrio. This becomes min obstcle for designing scheduling for new ppliction system nd results in high design cost. In this pper, we try to solve the problem Hito Zhng is the corresponding uthor. by proposing frmework to design scheduling for rel-time systems. The min contributions of this pper re s follows. i) We propose scheduling frmework bsed on stisfibility modulo theories (SMT). In this frmework, the problem of scheduling is treted s stisfibility problem. The key work is to formlize the stisfibility problem using first-order lnguge. We use st model to represent the formlized problem. This st model is set of first-order logic formuls (within liner rithmetic in the formuls) which express ll the scheduling constrints tht desired optimum schedule should stisfy. After the st model is constructed, SMT solver (e.g., Z3 [6], Yices [7]) is employed to solve the formlized problem. An optiml schedule cn be generted bsed on solution model returned by the SMT solver. The correctness of this method nd the optimlity of the generted schedule re strightforwrd. ii) The proposed scheduling frmework is flexible. In the SMT-bsed scheduling method, we define the scheduling constrints s system constrints nd trget constrints. It mens if we wnt to design scheduling to chieve other objectives, only the trget constrint needs to be modified. Or, if we wnt to chieve the sme scheduling objective for nother reltime system with different system rchitecture, only the system constrints need to be modified. iii) We give prcticl design guidelines for scheduling multiprocessor systems. These design guidelines re for systems with multiprocessor, nd of course, they re lso pplicble for system with uniprocessor, s scheduling uniprocessor systems is sub problem of scheduling multiprocessor systems. The model for the multiprocessor system is defined in very generl wy, nd in the design guidelines, we hve considered systems with mixed-criticlity (contining both firm nd soft) rel-time functions, tsk dependency reltion, tsk migrtion cost, heterogeneous processors (processors with different processing speed nd rchitectures), heterogeneous network chnnels (network chnnels with different dt trnsfer speed nd supporting different network protocols). All these efforts mke the frmework prcticble nd sufficiently generl to pply to different kinds of rel-time systems nd different scheduling trgets, which cn benefit system designers to efficiently design scheduling. The reminder of this pper is orgnized s follows. In Section II, we present scheduling frmework which is bsed on stisfibility modulo theories. The system model is denoted in Section III. We give the design guidelines for system constrints in Section IV, while Section V gives the design guidelines for trget constrints. Relted work re summrized in Section VI. Section VII concludes the pper.
2 Int'l Conf. Pr. nd Dist. Proc. Tech. nd Appl. PDPTA' Symbol TABLE I. Definition SYMBOLS AND DEFINITIONS t system time instnt δ network precision F set of functions of rel-time system FH F set of functions with firm dedlines FS F set of functions with soft dedlines F i F function of rel-time system, i is the index of the function r i triggered time instnt of function F i d i dedline of function F i v i obtined vlue by completing function F i before dedline T set of ll the tsks in the rel-time systems T i T set of tsks corresponding to function F i τ j T tsk, j is index of the tsk c j computtion cost of τ j m j migrtion cost of τ j from processor to nother one τs i strt tsk of tsk poset (T i, ) τe i end tsk of tsk poset (T i, ) P set of processors p P processor, where is the index of the processor ps speed of processor p TS T tsk set tht cn be completed by processor p TS b T tsk set tht cn migrte on network chnnel n b N P P set of network chnnels n b N network chnnel from processor p to p b ns b speed of n b II. THE SMT-BASED SCHEDULING FRAMEWORK A. Stisfibility Modulo Theories (SMT) Stisfibility modulo theories checks the stisfibility of logic formuls in first-order formultion with regrd to certin bckground theories like liner integer rithmetic or bit-vectors [2]. A first-order logic formul uses vribles s well s quntifiers, functionl nd predicte symbols, nd logic opertors [3]. A formul F is stisfible, if there is n interprettion tht mkes F true. For exmple, formul, b R, (b > +1.0) (b < +1.1), where R is rel number set, is stisfible, s there is n interprettion, 1.05,b 0, tht mkes F true. On the contrst, formul F is unstisfible, if there does not exist n interprettion tht mkes F true. For exmple, if we define, b Z, where Z is integer set, the formul (b >+1.0) (b <+1.1) will be unstisfible. For stisfibility problem tht hs been formlized by first-order logic formuls, SMT solver (e.g., Z3, Yices) cn be employed to solver such problem. If ll the logic formuls re stisfible, SMT solver returns the results st nd solution model which contins n interprettion for ll the vribles defined in the formuls tht mkes the formuls true. For the cse, b R, the model is: 1.05,b 0. If there is n unstisfible logic formul, SMT solver returns the results unst with n empty model, for the cse, b Z. B. The Scheduling Frmework The frmework of the SMT-bsed scheduling is illustrted in Fig. 1. In rel-time system, schedule (execution order of tsks) is generted by scheduler. The problem of scheduling cn be treted s stisfibility problem. In order to use SMT to solve this stisfibility problem, the key work is to formlize the problem using first-order Fig. 1. system Tsk schedule Scheduler Trget SAT Model System Trget Constrints /\ Constrints SMT Solver (e.g., Z3) The frmework for scheduling rel-time system bsed on SMT lnguge. We use st model to represent the formlized problem. This st model is the set of first-order logic formuls (within liner rithmetic in the formuls) which expresses ll the constrints tht the desired schedule should stisfy. There re two kinds of constrints: system constrints nd trget constrints. System constrints re bsed on the specific system. For exmple, if two tsks run on processor, schedule should mke sure tht the execution of these two tsks cnnot hve overlp in time domin. Trget constrint is bsed on the scheduling trget. For exmple, under norml worklod condition, the desired schedule should mke ll the functions meet their dedlines (completed before dedlines). After the st model is constructed, it cn be inputted into SMT solver (e.g., Z3). A solution model will be returned by the SMT solver. This solution model gives n interprettion for ll the vribles defined in the st model, nd under the interprettion, ll the logic formuls in the st model re evluted s true. It mens the stisfibility problem represented by the st model is solved, nd bsed on this interprettion, the desired schedule cn be generted. III. SYSTEM MODEL A. Function Set Function set define the functions tht cn be chieved by rel-time system. Let F = {F 1,F 2,...,F n } denote the function set. Ech function F i F is chieved by corresponding series tsks, represent s poset (T i, ), T i denotes the set of the corresponding tsk, nd denotes the dependency reltion of tsks in T i (the detil of the poset will be explined in the next subsection). For rel-time systems, when functions re triggered t system time instnt r, they re required to be completed before specific time, which is clled dedline, represented by d i. Moreover, different functions hve different degrees of importnce to the system, we use v i to denote the vlues obtined by the system through completing functions F i before its dedline d i. Bsed on bove explntion, we define the function F i =((T i, ),r i,d i,v i ). Note tht, unlike mny reserch on rel-time scheduling tht set dedlines to tsks, we set dedline to the function level rther thn tsk level. This setting cn better reflect the relity tht the dedline requirement is for the functions of rel-time systems, while function is chieved by series tsks cooperted together. This function definition denotes the functions which hve firm dedlines. Tht is, for such function, if it misses its
3 184 Int'l Conf. Pr. nd Dist. Proc. Tech. nd Appl. PDPTA'16 dedline, system will not obtin ny vlue through completing it. Usully, in complex rel-time system, not ll functions re firm rel-time functions. Some functions re soft reltime functions. For such function, if it misses dedline, it will still be useful for the system, but the vlue obtined by completing such function will be less thn completing it before its dedline. To denote the function with soft dedlines, without losing generlity, we define such functions s: F i = ((T i, ),r i,d i,f i (t)), where f i (t) is the coefficient function to indicte the vlue tht the system cn obtin by completing function F i t system time instnt t. The resonble vlue of the coefficient function is in intervl [0 1]. For convenience, we use FH F to denote the set of functions with firm dedlines, nd use FS F to denote the set of functions with soft dedlines. B. Tsk Poset A multiprocessor rel-time system comprises set of tsks, denoted by T. For ech function, it is chieve by series tsks cooperted together. Poset (T i, ) is used to denote such series tsks, where T i T is the tsk set corresponding to F i, nd T i = {τ 1,τ 2,...,τ m }, where τ j T i is tsk, nd m is the number of tsks. We use τ i,j to indicte tsk τ j T i.we ssume tht, if F > 1, then T i,t j T,i j = T i T j =. Tht is, no tsks re shred by different functions 1. The symbol indictes the dependency reltion between two tsks. Tht is, τ k,τ j T i,τ k τ j indicte tht tsk τ j cn strt to run only fter tsk τ k hs been completed. The dependency reltion is trnsitive. Tht is, τ k τ j,τ j τ l = τ k τ l. Definition (strt tsk). A strt tsk of (T i, ) is such tsk τ i T i tht strts erliest of ll the tsks in T i, tht is, τ j T i,i j = τ i τ j. Definition (end tsk). A end tsk of (T i, ) is such tsk τ i T i tht strts ltest of ll the tsks in T i, tht is, τ j T i,i j = τ j τ i. Without losing generlity, we ssume tht there is one strt tsk nd one end tsk of (T i, ), nd use τs i nd τe i to indicte the strt tsk nd end tsk of tsk poset (T i, ), respectively 2. Ech tsk hs two prmeters, τ j =(c j,m j ), where j is the index of the tsk. c j is the required computtion cost, which mens the number of time slots (ticks of processor) needed by unit speed processor to complete tsk τ j ; nd m j is the required migrtion cost for tsk τ j migrting from processor to nother one. We use the prmeter m j combined with prmeters of network (the detils will be explined lter) to clculted the overheds of migrting tsks. C. Processor Set In multiprocessor rel-time systems, different processors re used to execute tsks. We use P = {p 1,p 2,...,p l } to denote the set of processors, where l is the number of processors. Ech processor p is 2-tuple, p =(ps,ts ), where is the index of the processor. ps is the speed of the 1 Note tht, this ssumption is for concise expression. In rel systems, if tsk τ k T is used by function F i nd F j, we cn use two tsks τ ik nd τ jk, to represent τ k used in function F i nd F j, respectively. 2 To express function with mny strts (end) tsks, we cn set virtul tsk, with empty opertion, strt before ll the strts tsks (strt fter ll the end tsk) to be the strt (end) tsk. Fig. 2. () (b) (c) Different types of network topologies:. ring, b. mesh, c. tree processor. When tsk τ i running on processor p, the number of time slots needed for processor p to complete tsk τ i, represented by tsk completion tc i : tc i = c i ps (1) TS is the tsk set tht cn be completed by processor p. This prmeter is for heterogeneous systems, s in such systems, processors hve different rchitectures, some tsks cn only be executed on some specific processors. If TS =, it mens processor p cnnot be used to execute ny tsk in the system. Processors hve independent locl clocks, they re synchronized with ech other in the time domin through synchroniztion protocol. The mximum difference between the locl clocks of ny two processors in the networked systems is clled network precision (lso clled synchroniztion jitter) which is globl constnt. We denote the network precision with δ. D. Network Chnnel Set In multiprocessor rel-time systems, processors re connected through network chnnels. We use N P Pto denote the set of network chnnel. n n N denotes the network chnnel from processor p to p b, where p,p b P, b. Since we consider bi-directionl network chnnel, we hve n b N = n b N. We use ns b to represent the speed of n b. Note tht, define the network chnnel set s N P P mkes the system model become very generl which includes ny types of network topologies. For exmple, s shown in Fig. 2, the network chnnel set for mesh topology (b in the Fig. 2) equls to P P, while the ring nd tree topologies is the subset of P P. Moreover, this definition is lso suitble for processor with multi-cores. For exmple, for processor A with four cores, in this definition, cn be represented s four processors connect with network chnnels in mesh topology, nd the speed of networks is set bsed on the dt trnsfer speed inside the processor A. When the dt of the computed results of tsk τ i migrtes from processor p to p 3 b, the time slots spent on network chnnel, represented by tm i b, cn be clculted s: tm i b = m i (2) ns b Bsed on tm i b, we cn get the time instnt tht processor p b receives the dt of tsk τ i migrting from processor p 3 For conciseness, we sy tsk τ i migrtes from processor p to p b to men the dt of the computed results of tsk τ i migrtes from processor p to p b in the reset of the pper.
4 Int'l Conf. Pr. nd Dist. Proc. Tech. nd Appl. PDPTA' Fig. 3. T T P N An exmple for scheduling multiprocessor rel-time systems through network chnnel n b, represented by r i b,s r b i = s i b + tm i b + δ (3) where, s i b is the strt time of τ i migrting through network chnnel n b, nd δ is the network precision. For distributed rel-time system, different processors re connected through network chnnels which re built by routers. As different routers support different network protocols, some tsks my not be migrted through some network chnnels. To cpture this chrcteristics, similr s the heterogeneous processors, we lso cn define the heterogeneous network chnnels. We use TS b to denote tht tsk set tht cn be trnsferred through network chnnel n b. E. Assumptions Applied to this system model, we require tht ll the prmeters of the functions nd tsks re known prior. This requirement mkes the model become generliztion of the widely studied period tsk model, in which ll the tsks in the system re relesed periodiclly. This mens our method pplies more brodly thn other methods which re specified on period tsk model. To gurntee certin level of determincy, in this pper, tsk preemption is not llowed. To illustrte the defined system model, n exmple of scheduling for multiprocessor rel-time systems is shown in Fig. 3. In this exmple, there re three processors p 1,p 2,p 3 in the system. These processors re connected with ech other through six network chnnels n 1 2,n 2 1,n 1 3,n 3 1,n 2 3,n 3 2, nd these network chnnels support ll the migrtion of ll the tsks in T. The network precision δ is 1. In the system, firm rel-time function F =((T, ), 1, 11) is witing to be executed on the processors. The tsk poset of the function is (T, ) which consists of six tsks. Tsk dependency reltions re described in directed cyclic grph. An edge strting from tsk τ i to tsk τ j represented by dotted line denotes dependency reltion τ i τ j. IV. SYSTEM CONSTRAINTS This subsection describes ll the system constrints expressed in the st model for the defined multiprocessor systems. A. Constrint on strt execution time of functions Tsk set T i corresponding to function F i cn strt to run only fter the function is triggered. Tht is, the strt execution time of the strt tsk of the poset (T i, ) should be lrger thn the triggered time of function F i. F i F, p P s τs i r i (4) where symbol s τsi denotes the strt execution time of tsk τs i on processor p. B. Constrint on strt time of tsk migrtion If tsk τ i migrtes from processor p to processor p b through network chnnel n b, it mens i): tsk τ i hs been completed by processor p ;orii): τ i hs migrted to processor p from nother processor. For the first cse, tsk τ i cn strt to migrte fter it hs been completed, nd for the second cse, tsk τ i cn strt to migrte fter it hs lredy migrted to processor p. τ i T, n b N, n c N (s i b s i + tc i ) (s i b rc ) i where symbol s i b denotes the strt time of tsk τ i migrting through network chnnel n b, s i denotes the strt execution time of tsk τ i on processor p. C. Constrint on tsk dependency For processor p,ifτ i τ j, tsk τ j cn strt to run only fter τ i hs been completed. Similr to the constrints on strt time of tsk migrtion, there re two cses. i): tsk τ i hs been completed by processor p ; ii): tsk τ i hs migrted to processor p from nother processor. For the first cse, τ j cn strt to run fter τ i hs been completed, nd for the second cse, τ j cn strt to run fter τ i hs lredy migrted to processor p. τ i,τ j T, p P, n b N τ i τ j = (s j s i + tc i ) (s j rb ) i D. Constrint on execution of processors A processor cn execute only one tsk t time. This is interpreted s: there is no overlp of the execution time of ny two tsks. τ i,τ j T,i j, p P (s i s j + tc j ) (s j s i + tc i ) E. Constrint on network chnnels A network chnnel cn trnsfer dt of only one tsk t time. Tht is, there is no overlp of the migrtion time of ny two tsks on network chnnel. τ i,τ j T,i j, n b N (s i b s j b + tmj b ) (sj b si b + tm i b) (5) (6) (7) (8)
5 186 Int'l Conf. Pr. nd Dist. Proc. Tech. nd Appl. PDPTA'16 Fig. 4. The scheduling result for exmple shown in Fig. 3 by using the proposed SMT-bsed scheduling F. Constrint on heterogeneous processors In heterogeneous systems, processors hve different rchitectures, some tsks cn only be executed on some specific processors. For tsks tht cnnot be executed on some processors, the strt execution time of the tsks in such processors re set to +, which mens the tsks will never strt to run on these specific processors. p P, τ i T TS s i (9) =+ G. Constrint on heterogeneous network chnnels For distributed rel-time system, different processors re connected through network chnnels which re built by routers. As different routers support different network protocols, some tsks my not be migrted through some network chnnels. Similr s the constrint on heterogeneous processors, for tsks tht cnnot migrte on some network chnnels, the strt migrtion time of the tsks in such network chnnels re set to +, which mens the tsks will never strt to migrte on these specific network chnnels. n b N, τ i T TS b s i (10) b =+ V. TARGET CONSTRAINTS There re mny trgets cn be considered when we design scheduling for rel-time systems. Which objectives re pproprite in given sitution depends, of course, upon the ppliction. In this section, we give design guidelines for different scheduling trgets. A. Mking ll the functions meet their dedlines Under norml worklod conditions, the desired schedule should mke sure tht every triggered function cn be completed before its dedline. F i F, p P s τe i + tc τe i d i (11) where symbol s τei is the strt execution time of tsk τe i on processor p, nd tc τei is the number of time slots needed for processor p to complete tsk τe i. Bsed on this scheduling trget, recll the exmple shown in Fig. 3, we cn get the solution model M which defines the vlues of the strt time of tsk execution on processor, s j, nd the strt time of tsk migrtion through network, s j b c, for f i F, τ j T i, p P, n b c N. Bsed on the model M, we cn get the scheduling results s shown in Fig. 4. This scheduling sequence cn mke the function F in Fig. 3 meet its dedline. Some chrcteristics of this scheduling sequence should be noticed: Tsk τ 1 hs been executed on processor p 1 from system time t = 1 to t = 3, nd it hs lso been executed on processor p 3 from system time t = 2 to t = 3. This mens, the SMT-bsed scheduling frmework cn hndle the prllel execution of tsks, nd cn mke tsk repetedly run on different processors when such repeted execution is necessry. Tsk τ 2 runs on processor p 2 from t = 6 to t = 7. Although tsk τ 2 needs the computed results from completing tsk τ 1, such computed results cn not only be obtined by completing tsk τ 1 on processor p 2 itself, but lso cn be obtined by trnsferring the computed results from other processor tht hs completed tsk τ 1. Specified to this exmple, t system time t =6, processor p 2 gets the computed results of tsk τ 1 from processor p 1. B. Mximizing obtined vlues of completed functions Under norml worklod conditions, there exist schedule cn mke ll the triggered functions meet their dedlines. However, in prcticl environment, system worklod my vry widely becuse of dynmic chnges of work environment. Once system worklod becomes too hevy so tht there does not exist fesible schedule cn mke ll the functions meet their dedlines, we sy the system is overloded. When system is overlod, one resonble scheduling trget is to mximize the obtined vlues of the completed functions. Let symbol v be the obtined vlues of the completed functions, nd its initil vlue is set to be 0. For functions with firm dedlines, system cn obtin their vlues only when such functions hve been completed before their dedlines. F i FH if p P,s τei v := v + v i end d i (12) For completing functions F i with soft dedlines, the vlue tht the system cn obtin is ccording to the coefficient functions f i (t), where t is the time when the system completes the function, nd it cn be clculted s follows. F i FS if p P,s τei end v := v + f i (s τei d i ) (13) Let symbol sv denote the mximum obtined vlues of the completed functions, nd obviously, sv is no less thn 0 nd no lrger thn the sum of the vlues of the firm dedline functions ( v i for F i FH) nd the vlues of the soft dedline functions when ll the soft dedline tsks re completed before dedlines ( f i (t i ), for F i FS, where t i is the completed
6 Int'l Conf. Pr. nd Dist. Proc. Tech. nd Appl. PDPTA' time instnt of tsk τ i, nd t i <d i ), represented s mx. The constrints on the scheduling trget cn be expressed s: v = sv (14) C. Mking firm dedline functions meet dedlines while mximizing obtined vlues of the completed soft dedline functions Since firm dedline functions usully ply importnt roles in rel-time system, when system is under overlod condition, resonble scheduling trget is to first mke sure tht ll the firm dedline functions meet their dedlines, menwhile, mximizing obtined vlues of the completed soft dedline functions. To mke firm dedline functions meet dedlines, we cn get F i FH, p P s τei d i (15) To mximize the obtined vlue of the completed soft dedline functions, the formul is similr s it for the previous scheduling trget. Let symbol v be the obtined vlues of the completed functions, nd its initil vlue is set to be 0. The vlues system cn obtin by completing the soft dedline functions cn be clculted s follows. F i FS if p P,s τei end v := v + f i (s τei d i ) (16) Let symbol sv denote the mximum obtined vlues of the completed soft dedline functions, nd obviously, sv is no less thn 0 nd no lrger thn the vlues of the soft dedline functions when ll the soft dedline tsks re completed before dedlines ( f i (t i ), for F i FS, where t i is the completed time instnt of tsk τ i, nd t i < d i ). The constrints on scheduling trget cn be expressed s: v = sv (17) VI. RELATED WORK The reserch on rel-time scheduling hs lsted for decdes, mny reserch hve been conducted on this re. For reserch on designing scheduling for multiprocessor systems, comprehensive survey cn be found in [5]. In [8], the Proportionte Fir (Pfir) lgorithm ws introduced. Pfir is schedule genertion lgorithm which is pplicble to periodic tsksets with implicit dedlines. It is bsed on the ide of fluid scheduling, where ech tsk mkes progress proportionte to its utiliztion. Pfir scheduling divides the timeline into equl length qunt or slots. Authors in [8] showed tht the Pfir lgorithm is optiml for periodic tsksets with implicit dedlines. In [9], uthors extended the PFir pproch to spordic tsksets, showing tht the EPDF (erliest pseudodedline first) lgorithm, vrint of Pfir, is optiml for spordic tsksets with implicit dedlines executing on two processors, but is not optiml for more thn two processors. Some pproches focus on studying tsk nd messges schedule co-synthesis in switched time-triggered networks. In [10], uthors studied time-triggered distributed systems where periodic ppliction tsks re mpped onto different end sttions (processing units) communicting over switched Ethernet network. They try to solve the scheduling problem using MIP multi-objective optimiztion formultion. In [11], uthors studied the system consisting of communicting eventnd time-triggered tsks running on distributed nodes. These tsks re scheduled in conjunction with the ssocited bus messges by using dynmic nd sttic scheduling methods, respectively. Hitherto, most of the presented methods re either limited to specific tsk model (e.g., [8, 10] limited to periodic tsksets) or simple system rchitecture (e.g., [9] limited to two processors, [11] simple bus network topologies). Compred with these works, our proposed frmework is flexible nd sufficiently generl to pply to vrious kinds of rel-time systems nd vrious scheduling trgets, which mkes tht our frmework pplies much more widely. VII. CONCLUSION In this pper, bsed on stisfibility modulo theories (SMT), we provide frmework to design scheduling for reltime systems. In the frmework, the problem of scheduling is treted s stisfibility problem. After using first-order lnguge to formlize the stisfibility problem, SMT solver is employed to solver such problem. An optiml schedule cn be generted bsed on solution model returned by the SMT solver. To demonstrte the prcticlity of the frmework, we give design guidelines for rel-time systems with multiprocessor. Through the demonstrtion, the frmework is found flexible nd sufficiently generl to pply to different kinds of rel-time systems. By giving the prcticl design guidelines, we believe tht our frmework cn benefit system designers to efficiently design scheduling. REFERENCES [1] F. Zhng nd A. Burns, Schedulbility nlysis for rel-time systems with EDF scheduling, IEEE Trns. Comput., vol. 58, no. 9, pp , Apr [2] C. Brrett, et l., Stisfibility modulo theories, Hndbook of Stisfibility, vol IOS Press, [3] L.d. Mour nd N. Bjorner, Stisfibility Modulo Theories: An Appetizer, Forml Methods: Foundtions nd Applictions, vol. 5902, pp , [4] S.S. Crciuns nd R.S. Oliver, SMT-bsed Tsk- nd Network-level Sttic Schedule Genertion for Time-Triggered Networked Systems, Proc. 22th Int. Conf. on Rel-Time Networks nd Systems, NY, USA, pp , October, [5] R.I. Dvis nd A. Burns, A survey of hrd rel-time scheduling for multiprocessor systems, ACM Comput. Surv., vol. 43, no. 5, pp. 35:1 35:44, Oct [6] L. Mour nd N. Bjrner, Z3: n efficient SMT solver, Proc. 14th Int. Conf. on Tools nd Algorithms for the Construction nd Anl. of Syst., Budpest, Hungry, LNCS 4963, pp , Springer-Verlg, [7] B. Dutertre, Yices 2.2, Proc. 26th Int. Conf. on Comput. Aided Verifiction, Vienn, Austri, LNCS 8559, pp , Springer Interntionl Publishing, [8] S.K. Bruh, et l., A notion of firness in resource lloction, Algorithmic, vol. 15, no. 6, pp , [9] J. Anderson nd A. Srinivsn, Erly-relese fir scheduling, Proc. of the Euromicro Conference on Rel-Time Systems, [10] L. Zhng, et l., Tsk- nd network-level schedule co-synthesis of Ethernet-bsed time-triggered systems, Proc. of ASP-DAC, [11] T. Pop, P. Eles, nd Z. Peng, Holistic scheduling nd nlysis of mixed time/event-triggered distributed embedded systems, Proc. of CODES, 2002.
SMT-based Scheduling for Multiprocessor Real-Time Systems
SMT-based Scheduling for Multiprocessor Real-Time Systems Zhuo Cheng, Haitao Zhang, Yasuo Tan, and Yuto Lim School of Information Science, Japan Advanced Institute of Science and Technology, Japan {chengzhuo,
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More informationNew Expansion and Infinite Series
Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University
More informationNew data structures to reduce data size and search time
New dt structures to reduce dt size nd serch time Tsuneo Kuwbr Deprtment of Informtion Sciences, Fculty of Science, Kngw University, Hirtsuk-shi, Jpn FIT2018 1D-1, No2, pp1-4 Copyright (c)2018 by The Institute
More information7.2 The Definite Integral
7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where
More informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationImproper Integrals, and Differential Equations
Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted
More informationGoals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite
Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite
More information5.7 Improper Integrals
458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the
More information19 Optimal behavior: Game theory
Intro. to Artificil Intelligence: Dle Schuurmns, Relu Ptrscu 1 19 Optiml behvior: Gme theory Adversril stte dynmics hve to ccount for worst cse Compute policy π : S A tht mximizes minimum rewrd Let S (,
More informationRiemann is the Mann! (But Lebesgue may besgue to differ.)
Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More informationExam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1
Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationAcceptance Sampling by Attributes
Introduction Acceptnce Smpling by Attributes Acceptnce smpling is concerned with inspection nd decision mking regrding products. Three spects of smpling re importnt: o Involves rndom smpling of n entire
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationCMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature
CMDA 4604: Intermedite Topics in Mthemticl Modeling Lecture 19: Interpoltion nd Qudrture In this lecture we mke brief diversion into the res of interpoltion nd qudrture. Given function f C[, b], we sy
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More information1 Online Learning and Regret Minimization
2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in
More informationCredibility Hypothesis Testing of Fuzzy Triangular Distributions
666663 Journl of Uncertin Systems Vol.9, No., pp.6-74, 5 Online t: www.jus.org.uk Credibility Hypothesis Testing of Fuzzy Tringulr Distributions S. Smpth, B. Rmy Received April 3; Revised 4 April 4 Abstrct
More information1.4 Nonregular Languages
74 1.4 Nonregulr Lnguges The number of forml lnguges over ny lphbet (= decision/recognition problems) is uncountble On the other hnd, the number of regulr expressions (= strings) is countble Hence, ll
More informationReinforcement learning II
CS 1675 Introduction to Mchine Lerning Lecture 26 Reinforcement lerning II Milos Huskrecht milos@cs.pitt.edu 5329 Sennott Squre Reinforcement lerning Bsics: Input x Lerner Output Reinforcement r Critic
More informationDuality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.
Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we
More informationNUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.
NUMERICAL INTEGRATION 1 Introduction The inverse process to differentition in clculus is integrtion. Mthemticlly, integrtion is represented by f(x) dx which stnds for the integrl of the function f(x) with
More informationMath Lecture 23
Mth 8 - Lecture 3 Dyln Zwick Fll 3 In our lst lecture we delt with solutions to the system: x = Ax where A is n n n mtrix with n distinct eigenvlues. As promised, tody we will del with the question of
More information1.9 C 2 inner variations
46 CHAPTER 1. INDIRECT METHODS 1.9 C 2 inner vritions So fr, we hve restricted ttention to liner vritions. These re vritions of the form vx; ǫ = ux + ǫφx where φ is in some liner perturbtion clss P, for
More informationEstimation of Binomial Distribution in the Light of Future Data
British Journl of Mthemtics & Computer Science 102: 1-7, 2015, Article no.bjmcs.19191 ISSN: 2231-0851 SCIENCEDOMAIN interntionl www.sciencedomin.org Estimtion of Binomil Distribution in the Light of Future
More informationReview of basic calculus
Review of bsic clculus This brief review reclls some of the most importnt concepts, definitions, nd theorems from bsic clculus. It is not intended to tech bsic clculus from scrtch. If ny of the items below
More informationPhysics 116C Solution of inhomogeneous ordinary differential equations using Green s functions
Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner
More informationStudent Activity 3: Single Factor ANOVA
MATH 40 Student Activity 3: Single Fctor ANOVA Some Bsic Concepts In designed experiment, two or more tretments, or combintions of tretments, is pplied to experimentl units The number of tretments, whether
More informationTHE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.
THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem
More informationChapter 0. What is the Lebesgue integral about?
Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous
More informationCS5371 Theory of Computation. Lecture 20: Complexity V (Polynomial-Time Reducibility)
CS5371 Theory of Computtion Lecture 20: Complexity V (Polynomil-Time Reducibility) Objectives Polynomil Time Reducibility Prove Cook-Levin Theorem Polynomil Time Reducibility Previously, we lernt tht if
More information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
More information1 1D heat and wave equations on a finite interval
1 1D het nd wve equtions on finite intervl In this section we consider generl method of seprtion of vribles nd its pplictions to solving het eqution nd wve eqution on finite intervl ( 1, 2. Since by trnsltion
More informationGeneralized Fano and non-fano networks
Generlized Fno nd non-fno networks Nildri Ds nd Brijesh Kumr Ri Deprtment of Electronics nd Electricl Engineering Indin Institute of Technology Guwhti, Guwhti, Assm, Indi Emil: {d.nildri, bkri}@iitg.ernet.in
More informationFrobenius numbers of generalized Fibonacci semigroups
Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 29634-0975, USA gmtthe@clemson.edu Received:, Accepted:, Published:
More informationOverview of Calculus I
Overview of Clculus I Prof. Jim Swift Northern Arizon University There re three key concepts in clculus: The limit, the derivtive, nd the integrl. You need to understnd the definitions of these three things,
More informationA REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007
A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus
More informationConservation Law. Chapter Goal. 5.2 Theory
Chpter 5 Conservtion Lw 5.1 Gol Our long term gol is to understnd how mny mthemticl models re derived. We study how certin quntity chnges with time in given region (sptil domin). We first derive the very
More informationAdvanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004
Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when
More informationMIXED MODELS (Sections ) I) In the unrestricted model, interactions are treated as in the random effects model:
1 2 MIXED MODELS (Sections 17.7 17.8) Exmple: Suppose tht in the fiber breking strength exmple, the four mchines used were the only ones of interest, but the interest ws over wide rnge of opertors, nd
More informationUNIT 1 FUNCTIONS AND THEIR INVERSES Lesson 1.4: Logarithmic Functions as Inverses Instruction
Lesson : Logrithmic Functions s Inverses Prerequisite Skills This lesson requires the use of the following skills: determining the dependent nd independent vribles in n exponentil function bsed on dt from
More informationNumerical Integration
Chpter 1 Numericl Integrtion Numericl differentition methods compute pproximtions to the derivtive of function from known vlues of the function. Numericl integrtion uses the sme informtion to compute numericl
More informationCS 275 Automata and Formal Language Theory
CS 275 Automt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Problem (II) Chpter II.5.: Properties of Context Free Grmmrs (14) Anton Setzer (Bsed on book drft by J. V. Tucker nd K. Stephenson)
More informationChapter 14. Matrix Representations of Linear Transformations
Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn
More information( dg. ) 2 dt. + dt. dt j + dh. + dt. r(t) dt. Comparing this equation with the one listed above for the length of see that
Arc Length of Curves in Three Dimensionl Spce If the vector function r(t) f(t) i + g(t) j + h(t) k trces out the curve C s t vries, we cn mesure distnces long C using formul nerly identicl to one tht we
More information1 The Lagrange interpolation formula
Notes on Qudrture 1 The Lgrnge interpoltion formul We briefly recll the Lgrnge interpoltion formul. The strting point is collection of N + 1 rel points (x 0, y 0 ), (x 1, y 1 ),..., (x N, y N ), with x
More informationHandout: Natural deduction for first order logic
MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationWeek 10: Line Integrals
Week 10: Line Integrls Introduction In this finl week we return to prmetrised curves nd consider integrtion long such curves. We lredy sw this in Week 2 when we integrted long curve to find its length.
More informationParse trees, ambiguity, and Chomsky normal form
Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs
More informationJim Lambers MAT 169 Fall Semester Lecture 4 Notes
Jim Lmbers MAT 169 Fll Semester 2009-10 Lecture 4 Notes These notes correspond to Section 8.2 in the text. Series Wht is Series? An infinte series, usully referred to simply s series, is n sum of ll of
More informationA New Grey-rough Set Model Based on Interval-Valued Grey Sets
Proceedings of the 009 IEEE Interntionl Conference on Systems Mn nd Cybernetics Sn ntonio TX US - October 009 New Grey-rough Set Model sed on Intervl-Vlued Grey Sets Wu Shunxing Deprtment of utomtion Ximen
More informationDIRECT CURRENT CIRCUITS
DRECT CURRENT CUTS ELECTRC POWER Consider the circuit shown in the Figure where bttery is connected to resistor R. A positive chrge dq will gin potentil energy s it moves from point to point b through
More informationChapters 4 & 5 Integrals & Applications
Contents Chpters 4 & 5 Integrls & Applictions Motivtion to Chpters 4 & 5 2 Chpter 4 3 Ares nd Distnces 3. VIDEO - Ares Under Functions............................................ 3.2 VIDEO - Applictions
More informationLecture 14: Quadrature
Lecture 14: Qudrture This lecture is concerned with the evlution of integrls fx)dx 1) over finite intervl [, b] The integrnd fx) is ssumed to be rel-vlues nd smooth The pproximtion of n integrl by numericl
More informationFor convenience, we rewrite m2 s m2 = m m m ; where m is repeted m times. Since xyz = m m m nd jxyj»m, we hve tht the string y is substring of the fir
CSCI 2400 Models of Computtion, Section 3 Solutions to Homework 4 Problem 1. ll the solutions below refer to the Pumping Lemm of Theorem 4.8, pge 119. () L = f n b l k : k n + lg Let's ssume for contrdiction
More informationRealistic Method for Solving Fully Intuitionistic Fuzzy. Transportation Problems
Applied Mthemticl Sciences, Vol 8, 201, no 11, 6-69 HKAR Ltd, wwwm-hikricom http://dxdoiorg/10988/ms20176 Relistic Method for Solving Fully ntuitionistic Fuzzy Trnsporttion Problems P Pndin Deprtment of
More informationP 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)
1 Tylor polynomils In Section 3.5, we discussed how to pproximte function f(x) round point in terms of its first derivtive f (x) evluted t, tht is using the liner pproximtion f() + f ()(x ). We clled this
More informationSCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics
SCHOOL OF ENGINEERING & BUIL ENVIRONMEN Mthemtics An Introduction to Mtrices Definition of Mtri Size of Mtri Rows nd Columns of Mtri Mtri Addition Sclr Multipliction of Mtri Mtri Multipliction 7 rnspose
More informationChapter 1. Basic Concepts
Socrtes Dilecticl Process: The Þrst step is the seprtion of subject into its elements. After this, by deþning nd discovering more bout its prts, one better comprehends the entire subject Socrtes (469-399)
More informationChapter 4 Contravariance, Covariance, and Spacetime Diagrams
Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz
More informationGlobal Types for Dynamic Checking of Protocol Conformance of Multi-Agent Systems
Globl Types for Dynmic Checking of Protocol Conformnce of Multi-Agent Systems (Extended Abstrct) Dvide Ancon, Mtteo Brbieri, nd Vivin Mscrdi DIBRIS, University of Genov, Itly emil: dvide@disi.unige.it,
More informationReinforcement Learning
Reinforcement Lerning Tom Mitchell, Mchine Lerning, chpter 13 Outline Introduction Comprison with inductive lerning Mrkov Decision Processes: the model Optiml policy: The tsk Q Lerning: Q function Algorithm
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationBernoulli Numbers Jeff Morton
Bernoulli Numbers Jeff Morton. We re interested in the opertor e t k d k t k, which is to sy k tk. Applying this to some function f E to get e t f d k k tk d k f f + d k k tk dk f, we note tht since f
More informationA BRIEF INTRODUCTION TO UNIFORM CONVERGENCE. In the study of Fourier series, several questions arise naturally, such as: c n e int
A BRIEF INTRODUCTION TO UNIFORM CONVERGENCE HANS RINGSTRÖM. Questions nd exmples In the study of Fourier series, severl questions rise nturlly, such s: () (2) re there conditions on c n, n Z, which ensure
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationI1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
More informationNFAs and Regular Expressions. NFA-ε, continued. Recall. Last class: Today: Fun:
CMPU 240 Lnguge Theory nd Computtion Spring 2019 NFAs nd Regulr Expressions Lst clss: Introduced nondeterministic finite utomt with -trnsitions Tody: Prove n NFA- is no more powerful thn n NFA Introduce
More informationUniversitaireWiskundeCompetitie. Problem 2005/4-A We have k=1. Show that for every q Q satisfying 0 < q < 1, there exists a finite subset K N so that
Problemen/UWC NAW 5/7 nr juni 006 47 Problemen/UWC UniversitireWiskundeCompetitie Edition 005/4 For Session 005/4 we received submissions from Peter Vndendriessche, Vldislv Frnk, Arne Smeets, Jn vn de
More informationStrong Bisimulation. Overview. References. Actions Labeled transition system Transition semantics Simulation Bisimulation
Strong Bisimultion Overview Actions Lbeled trnsition system Trnsition semntics Simultion Bisimultion References Robin Milner, Communiction nd Concurrency Robin Milner, Communicting nd Mobil Systems 32
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationSection 14.3 Arc Length and Curvature
Section 4.3 Arc Length nd Curvture Clculus on Curves in Spce In this section, we ly the foundtions for describing the movement of n object in spce.. Vector Function Bsics In Clc, formul for rc length in
More informationN 0 completions on partial matrices
N 0 completions on prtil mtrices C. Jordán C. Mendes Arújo Jun R. Torregros Instituto de Mtemátic Multidisciplinr / Centro de Mtemátic Universidd Politécnic de Vlenci / Universidde do Minho Cmino de Ver
More informationWe will see what is meant by standard form very shortly
THEOREM: For fesible liner progrm in its stndrd form, the optimum vlue of the objective over its nonempty fesible region is () either unbounded or (b) is chievble t lest t one extreme point of the fesible
More informationNumerical Integration
Chpter 5 Numericl Integrtion Numericl integrtion is the study of how the numericl vlue of n integrl cn be found. Methods of function pproximtion discussed in Chpter??, i.e., function pproximtion vi the
More informationDefinition of Continuity: The function f(x) is continuous at x = a if f(a) exists and lim
Mth 9 Course Summry/Study Guide Fll, 2005 [1] Limits Definition of Limit: We sy tht L is the limit of f(x) s x pproches if f(x) gets closer nd closer to L s x gets closer nd closer to. We write lim f(x)
More informationGenetic Programming. Outline. Evolutionary Strategies. Evolutionary strategies Genetic programming Summary
Outline Genetic Progrmming Evolutionry strtegies Genetic progrmming Summry Bsed on the mteril provided y Professor Michel Negnevitsky Evolutionry Strtegies An pproch simulting nturl evolution ws proposed
More informationMORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)
MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give
More informationSolution for Assignment 1 : Intro to Probability and Statistics, PAC learning
Solution for Assignment 1 : Intro to Probbility nd Sttistics, PAC lerning 10-701/15-781: Mchine Lerning (Fll 004) Due: Sept. 30th 004, Thursdy, Strt of clss Question 1. Bsic Probbility ( 18 pts) 1.1 (
More informationWe partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b.
Mth 255 - Vector lculus II Notes 4.2 Pth nd Line Integrls We begin with discussion of pth integrls (the book clls them sclr line integrls). We will do this for function of two vribles, but these ides cn
More informationPartial Derivatives. Limits. For a single variable function f (x), the limit lim
Limits Prtil Derivtives For single vrible function f (x), the limit lim x f (x) exists only if the right-hnd side limit equls to the left-hnd side limit, i.e., lim f (x) = lim f (x). x x + For two vribles
More informationGeneration of Lyapunov Functions by Neural Networks
WCE 28, July 2-4, 28, London, U.K. Genertion of Lypunov Functions by Neurl Networks Nvid Noroozi, Pknoosh Krimghee, Ftemeh Sfei, nd Hmed Jvdi Abstrct Lypunov function is generlly obtined bsed on tril nd
More informationAdministrivia CSE 190: Reinforcement Learning: An Introduction
Administrivi CSE 190: Reinforcement Lerning: An Introduction Any emil sent to me bout the course should hve CSE 190 in the subject line! Chpter 4: Dynmic Progrmming Acknowledgment: A good number of these
More informationAQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system
Complex Numbers Section 1: Introduction to Complex Numbers Notes nd Exmples These notes contin subsections on The number system Adding nd subtrcting complex numbers Multiplying complex numbers Complex
More informationAbstract inner product spaces
WEEK 4 Abstrct inner product spces Definition An inner product spce is vector spce V over the rel field R equipped with rule for multiplying vectors, such tht the product of two vectors is sclr, nd the
More informationExtended nonlocal games from quantum-classical games
Extended nonlocl gmes from quntum-clssicl gmes Theory Seminr incent Russo niversity of Wterloo October 17, 2016 Outline Extended nonlocl gmes nd quntum-clssicl gmes Entngled vlues nd the dimension of entnglement
More informationJin-Fu Li. Department of Electrical Engineering National Central University Jhongli, Taiwan
Trnsprent BIST for RAMs Jin-Fu Li Advnced d Relible Systems (ARES) Lb. Deprtment of Electricl Engineering Ntionl Centrl University Jhongli, Tiwn Outline Introduction Concept of Trnsprent Test Trnsprent
More informationCS 188: Artificial Intelligence Spring 2007
CS 188: Artificil Intelligence Spring 2007 Lecture 3: Queue-Bsed Serch 1/23/2007 Srini Nrynn UC Berkeley Mny slides over the course dpted from Dn Klein, Sturt Russell or Andrew Moore Announcements Assignment
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automt Theory nd Forml Lnguges TMV027/DIT321 LP4 2018 Lecture 10 An Bove April 23rd 2018 Recp: Regulr Lnguges We cn convert between FA nd RE; Hence both FA nd RE ccept/generte regulr lnguges; More
More informationMATH 115 FINAL EXAM. April 25, 2005
MATH 115 FINAL EXAM April 25, 2005 NAME: Solution Key INSTRUCTOR: SECTION NO: 1. Do not open this exm until you re told to begin. 2. This exm hs 9 pges including this cover. There re 9 questions. 3. Do
More informationMATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1
MATH34032: Green s Functions, Integrl Equtions nd the Clculus of Vritions 1 Section 1 Function spces nd opertors Here we gives some brief detils nd definitions, prticulrly relting to opertors. For further
More informationMath 8 Winter 2015 Applications of Integration
Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl
More informationContinuous Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht
More informationCS 188 Introduction to Artificial Intelligence Fall 2018 Note 7
CS 188 Introduction to Artificil Intelligence Fll 2018 Note 7 These lecture notes re hevily bsed on notes originlly written by Nikhil Shrm. Decision Networks In the third note, we lerned bout gme trees
More information