Maintaining temporal validity of real-time data on non-continuously executing resources
|
|
- Georgiana Atkins
- 5 years ago
- Views:
Transcription
1 Mantanng temporal valdty of real-tme data on non-contnuously executng resources Tan Ba, Hong Lu and Juan Yang Hunan Insttute of Scence and Technology, College of Computer Scence, 44, Yueyang, Chna Wuhan Martme Communcaton Research Insttute, 4379, Wuhan, Chna Abstract. Ths paper studes the problem of temporal valdty mantenance on non-contnuously-executng resources. Response tme bounds for sensor transacton schedulng are derved n the context of the hybrd exted multprocessor perodc resource model. Then two deadlne and perod assgnment schemes are proposed to mantan the temporal valdty of real-tme data. The calculaton based scheme (DPA-C) uses the response tme bounds to compute deadlnes and perods. The chec based scheme (DPA-A) assgns deadlnes and perods drectly. It then checs the feasblty of the assgnment based on the response tme bounds. Experments are conducted to evaluate the performance of the proposed schemes. The results show that DPA-C performs better than DPA-A n terms of the schedulng success rato and the mposed update worload. Introducton Cyber-physcal systems (CPS) are wdely used n many applcaton areas to montor the envronmental status and mae response to crtcal events. Typcal applcaton areas nclude flght control, health montorng and ndustral process control. In CPS, the real-tme data objects are defned to model the current status of external enttes. Each data object s assocated wth a valdty nterval whch specfy the lfetme of the object s values. A realtme data object s temporally vald f ts current value s valdty nterval doesn t expre []. It s very mportant to guarantee the real-tme data valdty, snce otherwse CPS would mae wrong control decsons based on the nvald data objects. In recent years, there has been a number of wors on temporal valdty mantenance. The More-Less (ML) scheme uses sensor transactons to update the values of real-tme data objects perodcally [, ]. The deferrable schedulng algorthm for fxed prorty transactons (DS- FP) adopts the sporadc tas model [3, 4]. It defers the release tmes of transacton nstances as much as possble by explotng the semantcs of valdty constrants. The earlest deadlne frst (EDF) scheme was adopted n [5, 6] for schedulng sensor transactons. Han et al. proposed two schemes to mantan valdty constrants durng mode swtches [7]. The problem of co-schedulng sensor transactons and applcaton transactons was studed n [8]. L et al. studed the temporal valdty mantenance problem on parttoned multprocessors [9]. Current studes for mantanng the temporal valdty of real-tme data assume the processng resource s contnuous avalable for transacton executon. Ths assumpton, however, s not true n many cases. For example, a complex real-tme system usually conssts of several subsystems. Some subsystems may run on one physcal platform. Each of them can only get a fracton of the resource. As another example, n order to acheve thermal reslency, real-tme systems wll change between dfferent power modes dynamcally. Runnng n a low power mode can be vewed as runnng on a platform wth dscontnuous resource supply. In ths paper, we study how to mantan temporal valdty of real-tme data on platforms where the resource supply s not contnuous. We derves the response tme bounds of sensor transactons under global fxed prorty schedulng scheme n the context of the hybrd exted multprocessor perodc resource model. Based on the response tme bounds, we then present two schemes to assgn relatve deadlnes and perods to transactons so that the real-tme data valdty s properly mantaned. The calculaton based scheme (DPA-C) uses the bounds to compute deadlnes and perods. The chec based scheme (DPA-A) maes the assgnment drectly. It then checs whether the transacton set s feasble under the assgnment. Experments are conducted to evaluate the performance of these two schemes. The results show that compared wth DPA-A, DPA-C can acheve hgher schedulng success rato whle mpose lower update worload. The rest of the paper s organzed as follows. Secton presents real-tme data model and resource model. Secton 3 presents the response tme bounds of sensor transactons and two schemes for deadlne and perod assgnment. The expermental results are gven n secton 4 and n secton 5 we gve the concluson. The Authors, publshed by EDP Scences. Ths s an open access artcle dstrbuted under the terms of the Creatve Commons Attrbuton Lcense 4. (
2 MATEC Web of Conferences System model Consder a set of real-tme data objects X { X } n and a set of sensor transacton { } n. The valdty nterval of data object X s V. Sensor transacton update the value of X. The worst-case executon tme of s C. Defnton X s temporally vald at tme t, f the samplng tme of X s current value ts( X ) plus V s not less than t, that s ts( X ) V t []. The transacton set s executed on a non-contnuouslyexecutng resource. In ths paper we ntroduce the hybrd exted multprocessor perodc resource model (HEMPR). The model s characterzed by Ω= (П, Δ, Θ, m, m). It specfes that for a resource that conssts of m processors, m processors of t collectvely provde Θ unt of resource n every perod П wthn the deadlne Δ (Δ П). The rest of the processors each can guarantee full resource supply. The HEMPR model can be vewed as a combnaton of the MPR model [] and the dedcated recourse model (DR). If we set m = m and Δ = П, then we get MPR. If m s set to be zero, then we get DR. Thus our model s more flexble than MPR and DR. Notce that the processors n HEMPR can be ether physcal or vrtual processors. The vrtual processors themselves should be allocated to proper physcal processors. There are two approaches to schedule the sensor transactons on multprocessors: parttoned approach and global approach. In the parttoned approach, a transacton wll be allocated to a processor and can be executed only on ths processor. In the global approach, transactons are allowed to mgrate between dfferent processors durng ther executon. In ths paper the global fxed prorty schedulng approach (GFP) s consdered. We assume the transactons are sorted accordng to nondecreasng order of ther valdty ntervals. Hgher prortes are assgned to transactons wth lower valdty ntervals. A transacton nstance s allowed to be executed on one processor at any tme. 3 Temporal valdty mantenance on noncontnuously executng resources 3. Response tme bounds The worst-case resource supply pattern for the HEMPR model can be obtaned by mang some modfcatons to the reasonng for MPR model n []. In our pattern, the resources provded by m processors n the frst perod are allocated from tme zero. For subsequent perods, the resources are allocated as late as possble wthout volatng the deadlne constrant. Then the supply bound functon of HEMPR s gven by: N( mm ) t ( L) t a sbf () t () ( m m ) t otherwse In (), a / m, N ( ta)/, Lmn{, ta N }. ( L) s calculated as follows: La ( L) max{, ( L ) m} b otherwse In (), b / m. () In order to derve the upper bound of a sensor transacton s response tme, we ext Nan s dea of busy perod extenson that s desgned for dedcated resources [].Consder a transacton nstance l, wth release tme rl, and fnsh tme f l,. Let t o denote the earlest tme nstant before r l, such that all resource supply of HEMPR n tme nterval [ to, rl, ) are consumed by hgher prorty nstances. There are at most m sensor transactons wth carry-n nstance. Let t denote the length of the nterval, then the upper bound of total worload of hgher prorty transactons n the nterval s: n NC CI NC m largest CI NC I t and I (,) t (3) W () t I (,) t ( I (,) t I (,)) t The calculaton of (,) s gven by equatons (5)-(8) n [] and s omtted here for brevty. The next problem s to obtan an upper bound for nterference that l, suffers n [ to, f l, ). Let I () t denote the bound. For a dedcated resource, t s W ( t)/ m. But for HEMPR, t s not the case snce the resource supply may not be contnuous. In order to obtan I () t, we compute the parallel supply functons for HEMPR and then use these functons to calculate the bound. A level- supply functon Y () t s the mnmum resource supply n every tme nterval of length t wth parallelsm at most []. Based on the worst-case resource supply pattern, we then have: Y () t t mm (4) sbf ( t, ) otherwse In (4), sbf (,) t s obtaned by replacng m n sbf () t wth and wth ( m)( a) max{ b,}. Let Dt (, j) denote the duraton over an nterval of length t durng whch the tme s provded by j processors n parallel, then : Ymm b() t Ymm () bt j m Ymm() t Ymm() t Dtm (, ) jmm b Dt (, j) (5) t Dtm (, ) Dtm (, m b) j m m otherwse Then accordng to [], I () t s gven by: I() t Dtm (, m) I ( m) { m} S mn{ Dts (, ( )), max{( W ( t) Dts (, ( j)) s( j)),} / s ( ) } j (6) In (6), I{ m} ( m) s an ndcator functon to tae the case m m nto consderaton. S { mm, mm b, m} / {}. s () s -th element of S. Let R denote the mnmal value that satsfes the equaton below: I() t C t (7) Then R rl, tomust be an upper bound of the response tme of for ths partcular t o. The reason s that I () t s an upper bound of nterference on l, n [ to, f l, ), and there are no unused resource unts n [ to, r l, ), so t s not possble to obtan a larger response tme than R rl, to. Snce rl, s not earler than t o, we can see that R s a response tme bound of for arbtrary t o.
3 3. Deadlne and perod assgnment schemes In order to mantan the temporal valdty constrants, the sum of the relatve deadlne D and the perod T of must be no larger than the valdty nterval V. In addton, the transacton set must be schedulable by GFP on HEMPR. In ths secton two schemes are proposed for perod and deadlne assgnment. Calculaton based scheme (DPA-C) uses the response tme bounds derved n subsecton 3. to calculate deadlnes and perods drectly. Ths calculaton s carred out from to n. For, f R s larger than V /, s consdered as unschedulable. Snce I () t and W () t are both non-deceasng functons of t, R can be obtaned n an teratve way. That s: R I( R) C (8) In (8), R denotes the value of R n -th teraton. R s set to zero. DPA-C s presented n Algorthm. Notce that when m =m, R s set to a C whch s the length of the nterval wthout resource supply. For, the tme to compute W () t s On ( ), then I () t can be calculated n constant tme based on W () t snce there are at most three dfferent parallel levels to be consdered. There are at most V / C teratons to get R. Let V max max{ V n}, then the tme complexty of DPA-C s OnV ( ). max Algorthm Calculaton based Assgnment Input: and Ω Output: deadlnes and perods of f s schedulable, otherwse report falure for = to n = f m < m R C else R a C whle true f R V / Г s unschedulable, return falure else f R R brea compute R usng (8) D R T V D The teratve computaton of DPA-C could be tmeconsumng for transactons wth large valdty ntervals. Dfferent from DPA-C, the chec based scheme (DPA-A) adopts a very smple method to assgn deadlnes and perods. For, the scheme sets D V / ( F ) and T V D. F s the scalng factor of DPA-A. Its value should be not less than and s chosen by system desgners. A schedulablty condton for s obtaned from (7): I( D) C D (9) CI Here W( D) s computed usng only I (, D) to guarantee a safe bound snce the teraton s not used. For each transacton, DPA-A checs whether (9) s satsfed. If not, the transacton set s consdered as nfeasble. Otherwse DPA-A contnues to test subsequent transactons. For each transacton, t s not hard to see that the tme to chec (9) s On ( ). So the tme complexty of DPA-A s On ( ). It s lower than that of DPA-C. However, as one can see from the expermental results, ths reducton comes wth the cost of lower schedulng success rato and hgher mposed worload. 4 Performance evaluaton In ths secton the results of the expermental evaluaton on DPA-C and DPA-A are presented. There are two performance metrcs. The frst metrc s the schedulng success rato. It s defned as the rato of the schedulable transacton sets under the partcular scheme to the total number of transacton sets. The second metrc s the update worload mposed by sensor transactons defned as u / (( ( m m ) ) / ( m )). Ths defnton taes n the dscontnuty of the resource supply nto account. The parameters and ther default settngs are gven n table. The resource deadlne of HEMPR s set to be the same as the resource perod. The rato between Θ and m П s chosen randomly n [.7, ]. The rato between m and m s chosen randomly n [.5, ]. The value of Θ and m can then be obtaned based on the ratos. Table. Parameters and settngs. Parameters Meanng Value V C Valdty nterval Computaton tme N Number of p processors Resource perod [,3] [5,] [,8] Fg. shows the schedulng success rato of DPA-C and DPA-A when the densty of the transacton set s vared from.5 to.5. The densty s defned as the sum of the rato of a transacton s computaton tme and ts valdty nterval. In the experment, N p s set to 4 and the number of dedcated processors s set to be half of N p. The rato between Θ and m П s fxed at.8. The scalng factor for DPA-A s set to. It can be seen that the schedulng success rato of DPA-C s constantly no lower than that of DPA-A. For example, when the densty s about.9, almost all transacton sets can t be accepted by DPA-A whle DPA-C stll can accept any transacton set. The reason s DPA-A uses looser bounds for feasblty test whch wll lead to hgher reject rate of transactons. Fg. shows the update worload generated from two 3
4 MATEC Web of Conferences Fgure. Schedulng success rato comparson. schemes. The parameter settngs are the same as those descrbed for fg.. It can be seen that the update worload produced by DPA-C s lower than that of DPA- A. Both schemes update worload becomes hgher when the densty ncreases. For temporal valdty mantenance schemes, the update worload s an mport metrc. Reducng the worload of sensor transactons wll leave more resources to other types of transactons, thus the overall system performance s mproved. Fgure 3. Schedulng success rato comparson (densty=.75). named calculaton based scheme (DPA-C) and chec based scheme (DPA-A), are proposed to mantan the valdty constrants. DPA-C calculates deadlnes and perods by usng the response tme bounds. DPA-A maes the assgnment drectly and then checs whether the assgnment s feasble based on the derved bounds. The expermental results show that DPA-C acheves hgher schedulng success rato and mposes lower update worload than DPA-A does. Ths paper only consders the sensor transacton schedulng problem. In the furfure we wll study how to smultaneously schedule sensor transactons and user transactons on non-contnuouslyexecutng resources. References Fgure. Update worload comparson. Fg.3 shows the schedulng success rato of two schemes under dfferent ratos between Θ and m П, whle the densty s fxed at.75. Other parameter settngs reman unchanged. It s observed that the success rato of DPA-C s constantly hgher than that of DPA-A. In addton, both schemes success rato wll ncrease when the recourse capacty ncreases. More experments are carred out by varyng parameter settngs. The results are smlar to what we have presented here and are omtted. 5 Concluson In ths paper, we study the problem of mantanng temporal valdty on platforms where the resource supply s not contnuous. The response tme bounds of sensor transactons scheduled by GFP for HEMPR model are derved. Two deadlne and perod assgnment schemes,. M. Xong, K. Ramamrtham, Dervng deadlnes and perods for real-tme update transactons, IEEE Trans Comput,53(5), (4). J. Wang, S. Han, K. Y. Lam, et al., Mantanng data temporal consstency n dstrbuted real-tme systems, Real-Tme Syst, 48(4), () 3. S. Han, D. Chen, M. Xong, et al., Schedulablty Analyss of Deferrable Schedulng Algorthm for Mantanng Real-Tme Data Freshness, IEEE Trans Comput, 63(4), (4) 4. M. Xong, S. Han, D. Chen, et al., Desh: overhead reducton algorthms for deferrable schedulng, Real- Tme Syst, 44(), 5() 5. M. Xong, Q. Wang, K. Ramamrtham, On earlest deadlne frst schedulng for temporal consstency mantenance, Real-Tme Syst, 4(), 8 37(8) 6. J. L, M. Xong, V. C. S. Lee, et al., Worload- Effcent Deadlne and Perod Assgnment for Mantanng Temporal Consstency under EDF, IEEE Trans Comput,6(6), 55 68(3) 7. S. Han, D. Chen, M. Xong, et al., Onlne schedulng swtch for mantanng data freshness n flexble realtme systems, Proceedng of Real-Tme Systems Symposum, IEEE, Washngton D.C., 5 4(9) 8. S. Han, K. Y. Lam, J. Wang, et al., On Co- Schedulng of Update and Control Transactons n Real-Tme Sensng and Control Systems: Algorthms, 4
5 Analyss, and Performance, IEEE Trans on Knowl Data En, 5(), 35 34(3) 9. J. L, D. Chen, M. Xong, et al., Worload-Aware Parttonng for Mantanng Temporal Consstency upon Multprocessor Platforms, Proceedngs of the IEEE 3nd Real-Tme Systems Symposum, IEEE, Venna, 6 35 (). I. Shn, A. Easwaran, I. Lee, Herarchcal Schedulng Framewor for Vrtual Clusterng of Multprocessors, Euromcro Conference on Real-tme Systems, IEEE, Washngton D.C., 8 9(8). N. Guan, M. Stgge, W. Y, et al., New Response Tme Bounds for Fxed Prorty Multprocessor Schedulng, IEEE Trans Commun, 5(), (). E. Bn, M. Bertogna, S. Baruah, Vrtual Multprocessor Platforms: Specfcaton and Use, IEEE Realtme Systems Symposum, IEEE, Washngton D.C., (9) 5
REAL-TIME and embedded systems are applied in many
95 IEEE TRANSACTIONS ON COMPUTERS, VOL. 57, NO. 7, JULY 008 Deferrable Schedulng for Mantanng Real-Tme Data Freshness: Algorthms, Analyss, and Results Mng Xong, Member, IEEE, Song Han, Student Member,
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationAdaptive Resource Allocation Control with On-Line Search for Fair QoS Level
Adaptve Resource Allocaton Control wth On-Lne Search for Far QoS Level Fumko Harada, Toshmtsu Usho, Graduate School of Engneerng Scence Osaka Unversty {harada@hopf, usho@}sysesosaka-uacjp Yukkazu akamoto
More informationMixed-Criticality Scheduling on Multiprocessors using Task Grouping
Mxed-Crtcalty Schedulng on Multprocessors usng Task Groupng Jankang Ren Lnh Th Xuan Phan School of Software Technology, Dalan Unversty of Technology, Chna Computer and Informaton Scence Department, Unversty
More informationAn Investigation into Server Parameter Selection for Hierarchical Fixed Priority Pre-emptive Systems
An Investgaton nto Server Parameter Selecton for Herarchcal Fxed Prorty Pre-emptve Systems R.I. Davs and A. Burns Real-Tme Systems Research Group, Department of omputer Scence, Unversty of York, YO10 5DD,
More informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More informationLecture 7 Real Time Task Scheduling. Forrest Brewer
Lecture 7 Real Tme Task Schedulng Forrest Brewer Real Tme ANSI defnes real tme as A Real tme process s a process whch delvers the results of processng n a gven tme span A data may requre processng at a
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationReal-time Scheduling
Real-tme Schedulng COE718: Embedded System Desgn http://www.ee.ryerson.ca/~courses/coe718/ Dr. Gul N. Khan http://www.ee.ryerson.ca/~gnkhan Electrcal and Computer Engneerng Ryerson Unversty Overvew RTX
More informationOn-line Scheduling Algorithm with Precedence Constraint in Embeded Real-time System
00 rd Internatonal Conference on Coputer and Electrcal Engneerng (ICCEE 00 IPCSIT vol (0 (0 IACSIT Press, Sngapore DOI: 077/IPCSIT0VNo80 On-lne Schedulng Algorth wth Precedence Constrant n Ebeded Real-te
More informationRoutability Driven Modification Method of Monotonic Via Assignment for 2-layer Ball Grid Array Packages
Routablty Drven Modfcaton Method of Monotonc Va Assgnment for 2-layer Ball Grd Array Pacages Yoch Tomoa Atsush Taahash Department of Communcatons and Integrated Systems, Toyo Insttute of Technology 2 12
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationReal-time Fault-tolerant Scheduling Algorithm for Distributed Computing Systems
Real-tme Fault-tolerant Schedulng Algorthm for Dstrbuted Computng Systems Yun Lng, Y Ouyang College of Computer Scence and Informaton Engneerng Zheang Gongshang Unversty Postal code: 310018 P.R.CHINA {ylng,
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationA Novel Fault Tolerant Scheduling Technique In Real-Time Heterogeneous Distributed Systems Using Distributed Recovery Block
Proceedngs of Natonal Conference VISION 07 on Hgh Performance Computng 2 nd Aprl 07 Government College of Engneerng, Department of CSE, Trunelvel, Taml Nadu, INDIA A Novel Fault Tolerant Schedulng Technque
More informationPriority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks
Prorty-Based Schedulng Algorthm for Downlnk Traffcs n IEEE 80.6 Networks Ja-Mng Lang, Jen-Jee Chen, You-Chun Wang, Yu-Chee Tseng, and Bao-Shuh P. Ln Department of Computer Scence Natonal Chao-Tung Unversty,
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationHalmstad University Post-Print
Halmstad Unversty Post-Prnt Admsson Control for Swtched Realtme Ethernet Schedulng Analyss versus etwor Calculus Xng Fan and Magnus Jonsson.B.: When ctng ths wor cte the orgnal artcle. Orgnal Publcaton:
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationFibre-Optic AWG-based Real-Time Networks
Fbre-Optc AWG-based Real-Tme Networks Krstna Kunert, Annette Böhm, Magnus Jonsson, School of Informaton Scence, Computer and Electrcal Engneerng, Halmstad Unversty {Magnus.Jonsson, Krstna.Kunert}@de.hh.se
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationMultitasking and Real-time Scheduling
Multtaskng and Real-tme Schedulng EE8205: Embedded Computer Systems http://www.ee.ryerson.ca/~courses/ee8205/ Dr. Gul N. Khan http://www.ee.ryerson.ca/~gnkhan Electrcal and Computer Engneerng Ryerson Unversty
More informationTF 2 P-growth: An Efficient Algorithm for Mining Frequent Patterns without any Thresholds
TF 2 P-growth: An Effcent Algorthm for Mnng Frequent Patterns wthout any Thresholds Yu HIRATE, Ego IWAHASHI, and Hayato YAMANA Graduate School of Scence and Engneerng, Waseda Unversty {hrate, ego, yamana}@yama.nfo.waseda.ac.jp
More informationSpace-Optimal, Wait-Free Real-Time Synchronization
1 Space-Optmal, Wat-Free Real-Tme Synchronzaton Hyeonjoong Cho, Bnoy Ravndran ECE Dept., Vrgna Tech Blacksburg, VA 24061, USA {hjcho,bnoy}@vt.edu E. Douglas Jensen The MITRE Corporaton Bedford, MA 01730,
More informationAvailable online at Available online at Advanced in Control Engineering and Information Science
Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationA fast algorithm for color image segmentation
Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au
More informationSome material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier
Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationBurst Round Robin as a Proportional-Share Scheduling Algorithm
Burst Round Robn as a Proportonal-Share Schedulng Algorthm Tarek Helmy * Abdelkader Dekdouk ** * College of Computer Scence & Engneerng, Kng Fahd Unversty of Petroleum and Mnerals, Dhahran 31261, Saud
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationAchieving class-based QoS for transactional workloads
Achevng class-based QoS for transactonal workloads Banca Schroeder Mor Harchol-Balter Carnege Mellon Unversty Department of Computer Scence Pttsburgh, PA USA @cs.cmu.edu Arun Iyengar Erch
More informationA Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationPerformance Comparison of a QoS Aware Routing Protocol for Wireless Sensor Networks
Communcatons and Network, 2016, 8, 45-55 Publshed Onlne February 2016 n ScRes. http://www.scrp.org/journal/cn http://dx.do.org/10.4236/cn.2016.81006 Performance Comparson of a QoS Aware Routng Protocol
More informationBIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING
An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationAnalysis of Collaborative Distributed Admission Control in x Networks
1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,
More informationAvoiding congestion through dynamic load control
Avodng congeston through dynamc load control Vasl Hnatyshn, Adarshpal S. Seth Department of Computer and Informaton Scences, Unversty of Delaware, Newark, DE 976 ABSTRACT The current best effort approach
More informationDynamic Voltage Scaling of Supply and Body Bias Exploiting Software Runtime Distribution
Dynamc Voltage Scalng of Supply and Body Bas Explotng Software Runtme Dstrbuton Sungpack Hong EE Department Stanford Unversty Sungjoo Yoo, Byeong Bn, Kyu-Myung Cho, Soo-Kwan Eo Samsung Electroncs Taehwan
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationEfficient Broadcast Disks Program Construction in Asymmetric Communication Environments
Effcent Broadcast Dsks Program Constructon n Asymmetrc Communcaton Envronments Eleftheros Takas, Stefanos Ougaroglou, Petros copoltds Department of Informatcs, Arstotle Unversty of Thessalonk Box 888,
More informationTolerating Transient Faults in Statically Scheduled Safety-Critical Embedded Systems
Toleratng Transent Faults n Statcally Scheduled Safety-Crtcal Embedded Systems Nagaraan Kandasamy *, John P. Hayes *, and Bran T. Murray ** * Department of Electrcal Engneerng ** Delph Automotve Systems
More informationDECA: distributed energy conservation algorithm for process reconstruction with bounded relative error in wireless sensor networks
da Rocha Henrques et al. EURASIP Journal on Wreless Communcatons and Networkng (2016) 2016:163 DOI 10.1186/s13638-016-0662-9 RESEARCH Open Access DECA: dstrbuted energy conservaton algorthm for process
More informationA Clustering Algorithm for Chinese Adjectives and Nouns 1
Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,
More informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More informationReliability and Energy-aware Cache Reconfiguration for Embedded Systems
Relablty and Energy-aware Cache Reconfguraton for Embedded Systems Yuanwen Huang and Prabhat Mshra Department of Computer and Informaton Scence and Engneerng Unversty of Florda, Ganesvlle FL 326-62, USA
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More informationA comparative study of scheduling algorithms for the multiple deadline-constrained workflows in heterogeneous computing systems with time windows
Proceda Computer Scence Volume 29, 2014, Pages 509 522 ICCS 2014 14th Internatonal Conference on Computatonal Scence A comparatve study of schedulng algorthms for the multple deadlne-constraned workflows
More informationDistributed Middlebox Placement Based on Potential Game
Int. J. Communcatons, Network and System Scences, 2017, 10, 264-273 http://www.scrp.org/ournal/cns ISSN Onlne: 1913-3723 ISSN Prnt: 1913-3715 Dstrbuted Mddlebox Placement Based on Potental Game Yongwen
More informationAnalysis of Dependencies of Checkpoint Cost and Checkpoint Interval of Fault Tolerant MPI Applications
Mallkarjuna Shastry P M et al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Analyss of Dependences of Checkpont Cost and Checkpont Interval of Fault Tolerant MPI Applcatons Mallkarjuna
More informationResponse-Time Guarantees in ATM Networks
Response-Tme Guarantees n ATM Networks Andreas Ermedahl Hans Hansson Mkael Sjödn Department of Computer Systems Uppsala Unversty Sweden E-mal: febbe,hansh,mcg@docs.uu.se Abstract We present a method for
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationBRDPHHC: A Balance RDF Data Partitioning Algorithm based on Hybrid Hierarchical Clustering
015 IEEE 17th Internatonal Conference on Hgh Performance Computng and Communcatons (HPCC), 015 IEEE 7th Internatonal Symposum on Cyberspace Safety and Securty (CSS), and 015 IEEE 1th Internatonal Conf
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationPerfecting Preemption Threshold Scheduling for Object-Oriented Real-Time System Design: From The Perspective of Real-Time Synchronization
Perfectng Preempton Threshold Schedulng for Obect-Orented Real-Tme System Desgn: From The Perspectve of Real-Tme Synchronzaton Saehwa Km School of Electrcal Engneerng and Computer Scence Seoul Natonal
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationRouting in Degree-constrained FSO Mesh Networks
Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng
More informationAn efficient iterative source routing algorithm
An effcent teratve source routng algorthm Gang Cheng Ye Tan Nrwan Ansar Advanced Networng Lab Department of Electrcal Computer Engneerng New Jersey Insttute of Technology Newar NJ 7 {gc yt Ansar}@ntedu
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationChapter 1. Introduction
Chapter 1 Introducton 1.1 Parallel Processng There s a contnual demand for greater computatonal speed from a computer system than s currently possble (.e. sequental systems). Areas need great computatonal
More informationResearch Article Adaptive Cost-Based Task Scheduling in Cloud Environment
Scentfc Programmng Volume 2016, Artcle ID 8239239, 9 pages http://dx.do.org/10.1155/2016/8239239 Research Artcle Adaptve Cost-Based Task Schedulng n Cloud Envronment Mohammed A. S. Mosleh, 1 G. Radhaman,
More informationEnhancing Class-Based Service Architectures with Adaptive Rate Allocation and Dropping Mechanisms
Enhancng Class-Based Servce Archtectures wth Adaptve Rate Allocaton and Droppng Mechansms Ncolas Chrstn, Member, IEEE, Jörg Lebeherr, Senor Member, IEEE, and Tarek Abdelzaher, Member, IEEE Abstract Class-based
More informationAdaptive Energy and Location Aware Routing in Wireless Sensor Network
Adaptve Energy and Locaton Aware Routng n Wreless Sensor Network Hong Fu 1,1, Xaomng Wang 1, Yngshu L 1 Department of Computer Scence, Shaanx Normal Unversty, X an, Chna, 71006 fuhong433@gmal.com {wangxmsnnu@hotmal.cn}
More informationAnalysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD
Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,
More informationThe Data Warehouse in a Distributed Utility Environment
The Data Warehouse n a Dstrbuted Utlty Envronment Charles A. Mllgan Dstngushed Engneer, Sun Mcrosystems Charles.mllgan@sun.com Abstract Utlty provsonng, Grd resource management, nstant copy kosks, and
More informationScheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationEfficient Content Distribution in Wireless P2P Networks
Effcent Content Dstrbuton n Wreless P2P Networs Qong Sun, Vctor O. K. L, and Ka-Cheong Leung Department of Electrcal and Electronc Engneerng The Unversty of Hong Kong Pofulam Road, Hong Kong, Chna {oansun,
More informationVerification by testing
Real-Tme Systems Specfcaton Implementaton System models Executon-tme analyss Verfcaton Verfcaton by testng Dad? How do they know how much weght a brdge can handle? They drve bgger and bgger trucks over
More informationA Generic and Compositional Framework for Multicore Response Time Analysis
A Generc and Compostonal Framework for Multcore Response Tme Analyss Sebastan Altmeyer Unversty of Luxembourg Unversty of Amsterdam Clare Maza Grenoble INP Vermag Robert I. Davs Unversty of York INRIA,
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationNetwork Cloud. Internal Network. Internal Network. Internal Network. Border Switch. Border Switch. Border Switch. Network. Internal. Border.
Multplexng VBR Trac Flows wth Guaranteed Applcaton-level QoS Usng Statstcal Rate Monotonc Schedulng Ala K. Atlas and Azer Bestavros Computer Scence Department Boston Unversty Boston, MA 0225 fakatlas,
More informationSolutions for Real-Time Communication over Best-Effort Networks
Solutons for Real-Tme Communcaton over Best-Effort Networks Anca Hangan, Ramona Marfevc, Gheorghe Sebestyen Techncal Unversty of Cluj-Napoca, Computer Scence Department {Anca.Hangan, Ramona.Marfevc, Gheorghe.Sebestyen}@cs.utcluj.ro
More informationQuery and Update Load Shedding With MobiQual
Dodda Sudeep et al,int.j.computer Technology & Applcatons,Vol 3 (1), 470-474 Query and Update Load Sheddng Wth MobQual Dodda Sudeep 1, Bala Krshna 2 1 Pursung M.Tech(CS), Nalanda Insttute of Engneerng
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationResource and Virtual Function Status Monitoring in Network Function Virtualization Environment
Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087
More informationA comparison of MPCP and MSRP when sharing resources in the Janus multiple-processor on a chip platform
A comparson of MPCP and MSRP when sharng resources n the Janus multple-processor on a chp platform Paolo Ga, Marco D Natale, Guseppe Lpar, Scuola Superore Sant Anna, Psa, Italy {pj,marco,lpar}@sssup.t
More informationOn the Network Partitioning of Large Urban Transportation Networks
On the etwor Parttonng of Large Urban Transportaton etwors Hamdeh Etemadna and Khaled Abdelghany Abstract Ths paper ams at developng a traffc networ parttonng mechansm for dstrbuted traffc management applcatons.
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationA Load-balancing and Energy-aware Clustering Algorithm in Wireless Ad-hoc Networks
A Load-balancng and Energy-aware Clusterng Algorthm n Wreless Ad-hoc Networks Wang Jn, Shu Le, Jnsung Cho, Young-Koo Lee, Sungyoung Lee, Yonl Zhong Department of Computer Engneerng Kyung Hee Unversty,
More informationPerformance and Cost Optimization for Multiple Large-scale Grid Workflow Applications
Performance and Cost Optmzaton for Multple Large-scale Grd Worflow Applcatons Rubng Duan, Radu Prodan, Thomas Fahrnger Insttute of Computer cence, Unversty of Innsbruc Emal: rubng.duan@ub.ac.at ABTRACT
More informationPetri Net Based Software Dependability Engineering
Proc. RELECTRONIC 95, Budapest, pp. 181-186; October 1995 Petr Net Based Software Dependablty Engneerng Monka Hener Brandenburg Unversty of Technology Cottbus Computer Scence Insttute Postbox 101344 D-03013
More informationA QoS-aware Scheduling Scheme for Software-Defined Storage Oriented iscsi Target
A QoS-aware Schedulng Scheme for Software-Defned Storage Orented SCSI Target Xanghu Meng 1,2, Xuewen Zeng 1, Xao Chen 1, Xaozhou Ye 1,* 1 Natonal Network New Meda Engneerng Research Center, Insttute of
More informationSorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions
Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place
More informationA SYSTOLIC APPROACH TO LOOP PARTITIONING AND MAPPING INTO FIXED SIZE DISTRIBUTED MEMORY ARCHITECTURES
A SYSOLIC APPROACH O LOOP PARIIONING AND MAPPING INO FIXED SIZE DISRIBUED MEMORY ARCHIECURES Ioanns Drosts, Nektaros Kozrs, George Papakonstantnou and Panayots sanakas Natonal echncal Unversty of Athens
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationDesign and Analysis of Algorithms
Desgn and Analyss of Algorthms Heaps and Heapsort Reference: CLRS Chapter 6 Topcs: Heaps Heapsort Prorty queue Huo Hongwe Recap and overvew The story so far... Inserton sort runnng tme of Θ(n 2 ); sorts
More information