Enhancing Efficiency of Software Fault Tolerance Techniques in Satellite Motion System

Size: px
Start display at page:

Download "Enhancing Efficiency of Software Fault Tolerance Techniques in Satellite Motion System"

Transcription

1 Joural of Iformatio Systems ad Telecommuicatio, Vol. 2, No. 3, July-September Ehacig Efficiecy of Software Fault Tolerace Techiques i Satellite Motio System Hoda Baki Departmet of Electrical ad Computer Egieerig, Uiversity of Kasha, Isfaha, Ira baki@grad.kashau.ac.ir Seyed Morteza Babamir Departmet of Electrical ad Computer Egieerig, Uiversity of Kasha, Isfaha, Ira babamir@kashau.ac.ir Azam Farokh Departmet of Electrical ad Computer Egieerig, Uiversity of Kasha, Isfaha, Ira farokh@grad.kashau.ac.ir Mohammad Mehdi Morovati* Departmet of Electrical ad Computer Egieerig, Uiversity of Kasha, Isfaha, Ira morovati@grad.kashau.ac.ir Received: 02/Oct/2012 Revised: 07/Ju/2014 Accepted: 02/Aug/2014 Abstract This research shows the ifluece of usig multi-core architecture to reduce the executio time ad thus icrease performace of some software fault tolerace techiques. Accordig to superiority of N-versio Programmig ad Cosesus Recovery Block techiques i compariso with other software fault tolerace techiques, implemetatios were performed based o these two methods. Fially, the compariso betwee the two methods listed above showed that the Cosesus Recovery Block is more reliable. Therefore, i order to improve the performace of this techique, we propose a techique amed Improved Cosesus Recovery Block techique. I this research, satellite motio system which kow as a scietific computig system is cosider as a base for our experimets. Because of existig ay error i calculatio of system may result i defeat i system totally, it should t cotais ay error. Also the executio time of system must be acceptable. I our proposed techique, ot oly performace is higher tha the performace of cosesus recovery block techique, but also the reliability of our proposed techique is equal to the reliability of cosesus recovery block techique. The improvemet of performace is based o multi-core architecture where each versio of software key uits is executed by oe core. As a result, by parallel executio of versios, executio time is reduced ad performace is improved. Keywords: Software Fault Tolerace; Multi-core; Parallel Executio; Cosesus Recovery Block; N-versio Programig; Acceptace Test. 1. Itroductio Nowadays the ifluece of software o differet domais such as ecoomics, medicie, aerospace ad so o is quite sesible. Oe of the mai requiremets of these systems is safety ad reliability of software. Accordig to the importace of software reliability, demad for usig fault tolerace techiques i software developmet have icreased sigificatly. Desig diversity is oe of the fault tolerace methods which eeds to ru multiple versios of the program [1]. software fault tolerace techiques icrease software reliability, o the other had by icreasig umber of versios of the program, executio time icreases at the same time ad this will reduce the performace. by takig advatages of distributed ad parallel processig systems, the efficiecy is icreased ad thus the cost of usig these systems will be acceptable. Usig the multi-core architecture is a good idea for takig advatage of parallel processig. Based o the idea of software fault tolerace, for some software key uits i a system, N versios ca be developed separately with similar fuctioality [2]. The purpose of desig diversity is costructig idepedet modules as may as possible ad miimizig occurrece of idetical errors i these modules [3]. All versios are executed with idetical iitial coditios ad iputs. Output of all versios is give to a decisio module ad the decisio module selects a uique result as a correct output. The paper cotiues as follow: sectio 2 itroduces N-versio programmig ad recovery block ad their derivative techiques. Sectio 3, itroduces satellite motio system as a case study. Sectio 4, discusses the usage of multi-core architecture i fault tolerace techiques. Implemetatio results are reviewed i Sectio 5.the proposed method is preseted i Sectio 6 ad fially i Sectio 7 coclusios are discussed. 2. Software Fault-Tolerace Techiques I this sectio some fault tolerace techiques are itroduced. * Correspodig Author

2 174 Baki, Babamir, Farokh & Morovati, Ehacig Efficiecy of Software Fault Tolerace Techiques i Satellite Motio System 2.1 N-versio programig techique Usig differet algorithms ad desigs, Most program fuctios ca be performed i various ways. A program versio deotig a separate implemetatio of a program fuctio is called a variat. Each variat has a varyig degree of efficiecy i terms of memory maagemet ad utilizatio, executio time, reliability, ad other criteria. N-versio programmig (NVP) techique is oe of the mai techiques of software fault tolerace. I this techique, N differet versios of a module are implemeted ad executed cocurretly (simultaeously). The the results will be preseted to a decisio module ad this module selects the correct result [3]. The decisio module examies the results ad selects the best oe if exists. There are other available alterative decisio mechaisms. For example oe decisio mechaisms is majority voter. The NVP algorithm techique is show i Fig. 1. Fig. 1. N-versio programmig techique algorithm Other augmetatios, ehacemets, ad combiatios have bee made to the NVP techiques. These are typically give a etirely ew ame rather tha beig called a extesio to the NVP techique. Some of these techiques are described i the followig. 2.2 N-versio programig-tie broker techique I order to improve the performace of NVP techique, N-versio programmig-tie Broker (NVP-TB) techique has bee developed whose strategy is to sychroize the versios. I this techique, assumig that three versios of software key uit are developed, whe the results of two faster versios are produced, it does ot wait for the slowest versio aymore. I other words, whe the two faster versios, complete their executio, their results will be compared ad oe of the results is retured as a correct result if they match, otherwise, it waits for the result of slowest versio ad the the correct result is determied by decisio mechaism [4]. The algorithm of this techique is represeted i Fig. 2. Fig. 2. N-versio programmig-tie broker techique algorithm 2.3 N-versio programig-acceptace test techique To reduce the probability of selectig a icorrect result, Tai ad his colleagues added a acceptace test to the NVP techique. I this techique, after the decisio mechaism selects oe of the results as the correct oe, this result is passed to the acceptace test for checkig its correctess i order to icrease the reliability [4]. The N-versio programig-acceptace test techique is represeted i Fig. 3. Fig. 3. N-versio programmig-acceptace test techique algorithm 2.4 N-versio programig-tie broker- Acceptace test techique Because the two modified NVP techiques are complemetary, N-versio programmig-tie Brokeracceptace test (NVP-TB-AT) techique has bee developed to cocetrate o both reliability ad performace. Actually, this techique is a combiatio of NVP-TB techique ad acceptace test. Acceptace test is used to icrease the reliability which will cause the executio time to icrease ad thus the performace will be reduced. But by usig the Tie-broker techique, reductio of performace is compesated. As a result, ot oly this techique has higher performace tha NVP-AT, but also has reliability equal to NVP-AT[5]. The N-versio programig-tie broker Acceptace test is explaied i Fig. 4. Fig. 4. N-versio programmig-tie broker-acceptace test techique algorithm 2.5 Recovery block techique Recovery block (RcB) techique is oe of the mai techiques of software fault tolerace. This techique works i a way that differet versios are prioritized i order of their importace; the they is ru i order of their prefereces. I other words, RcB icorporates these variats such that the most efficiet module is located first i the series, ad is called the primary alterate or primary try block. Acceptace or rejectio of each versio is idetified by acceptace test module. At first, the overall situatio of system is stored. if o versios ca successfully pass the acceptace test, the system is retured to the saved state ad the the ext module will ru [3]. If o alterates are successful, a error occurs. The algorithm of RcB techique is show i Fig. 5.

3 Joural of Iformatio Systems ad Telecommuicatio, Vol. 2, No. 3, July-September Acceptace Test Fig. 5. Recovery block techique algorithm 2.6 Distributed recovery block techique Distributed recovery block (DRB) techique, is the distributed versio of RcB techique i which several recovery blocks are implemeted i several systems. the oly differece betwee these blocks is the priority of modules [6]. The basic DRB techique cosists of a primary ode ad a shadow ode, each cooperatig with each other ad ruig a RcB scheme. I DRB, the recovery blocks are cocurretly executed o both odes. The iitial primary ode executes the primary algorithm ad the iitial shadow ode executes the alterate alterative oe. First, the techique attempts to esure that the primary algorithm o ode 1 s results passes the AT (i.e., produces a result which passes the test. If this result fails the AT, the the DRB tries the result from the alterate algorithm o ode 2. If either passes the AT, the backward recovery is used to execute the alterate o Node 1 ad the primary o Node 2. The results of these executios are checked to esure the AT. If either of these results passes the AT, the a error occurs. If ay of the results are successful, the result is passed o to the successor computig statio. 2.7 Cosesus recovery block techique The cosesus recovery block (CRB) techique is a combiatio of NVP ad RcB., at first NVP rus ad if it fails to produce the correct result, recovery Block rus ad produces the correct result[3]. The cosesus recovery block techique is represeted i Fig. 6. Fig. 6. Cosesuse Recovery block techique algorithm Whe two or more correct aswers exist for the same problem ad the same iput, we have multiple correct results (MCR). NVP i geeral ad votig-type decisio algorithms i particular, are ot appropriate for situatios i which MCR may occur. It is claimed that the CRB techique reduces the importace of the AT used i the RcB. CRB is Also able to hadle cases i which NVP would ot be appropriate because of MCR. Acceptace Test (AT) is the most basic approach to self-checkig software (Fig. 7), which typically is used with the RcB, CRB ad DRB techiques. The AT is used to verify the acceptace of the systems behavior based o the assertio o the aticipated system state. As show i Fig. 7, a value of TRUE or FALSE is retured. The AT eeds to be simple, effective, ad highly reliable i order to: (1) decrease the chace of additioal desig faults, (2) keep ru-time overhead reasoable, (3) esure detectio of the aticipated faults ad (4) esure that a o-faulty behavior would ot icorrectly be detected. Fig. 7. Acceptace test fuctioality. ATs ca thus be difficult i developmet depedig o their specificatios. Also, the form of a AT depeds o its applicatio. The coverage of a AT is a idicator of its complexity, where a icrease i coverage geerally requires a more complicated implemetatio of the test. Icreasig the complexity leads to icreasig the time of programs executio ad fault maifestatios [3,7]. 4. Satellite Motio System I this sectio the satellite motio system, which is used i scietific computig, is itroduced as a case study. The calculatio of satellite motio is the most critical part of the satellite cotrol system; so, errors i this part lead to failure of etire system. The geodetic satellites have two major missios: (1) positioig i geodesy or (2) to be used as a sesor for measurig the exteral gravity field of the Earth. I order to icrease the reliability of this part, the fault-tolerat software techiques were utilized. Satellite motio equatio is represet i Eq.(1)[8]. The aalytical solutio of this differetial equatio leads to the Kepler orbit [9]. GM r r K 3 r (1) The satellite motio equatio is a secod order vector differetial equatio; therefore it has to be coverted to a first order differetial equatio that is represet i Eq. (2) [8].

4 176 Baki, Babamir, Farokh & Morovati, Ehacig Efficiecy of Software Fault Tolerace Techiques i Satellite Motio System GM x x 3 K x r GM GM r r K y y K 3 3 y r r GM z z K 3 z r vx x vy y vz z GM vx x K 3 x r GM vy y K 3 y r GM vz z K 3 z r (2) Where, r is the positio vector, GM is the product of gravitatioal costat ad Earth s mass, k is the effects of all the perturbig forces o a satellite. Sice the equatio is a secod order three-dimesioal differetial equatio, it could be solved umerically usig methods such as Ruge-Kutta, Adams-Bashforth ad Adams-Moulto. I this paper, various implemetatios of these methods are used as differet versios of fault-tolerat techiques. Ruge-Kutta, Adams-Bashforth ad Adams-Moulto are the most commo methods for solvig first order differetial equatios umerically. Ruge-Kutta (Eq.(3),(4) ad (5)) solves these equatios i siglephase, while Adams-Bashforth (Eq. (6) ad (7)) ad Adams-Moulto (Eq. (6) ad (8)) solve it i multi-phase. y f ( x, y ) (3) k 1 hf ( x, y ) h k1 k 2 hf ( x, y ) 2 2 h k 2 k 3 hf ( x, y ) 2 2 k 4 hf ( x h, y k 3) (4) h y 1 y ( k 1 2k 2 2k 3 k 4) 6 (5) y ( t ) f ( y, t ) y ( t ) y 0 0 (6) 1 p 1 i ( (1 ), i i 0 y y h f t i h y 1 c c 1 i i 1 i 0 y y h f ( t ih, y ) a (7) (8) 5. Multi-Core Architecture Usage I a sigle-core platform, oly oe thread is ruig at a certai time poit. But I a multi-core platform, there ca be several threads which are ruig o differet cores at the same time. So i the multi-core architecture, threads which are created to ru the program, really ru i parallel o a multi-core platform. Therefore sychroizatio issues ad the cost for commuicatio amog cores are discussed. If the extra cost is quite cosiderable compared to the ormal sigle core executio cost, such applicatios are ot suitable for the multi-core architecture [9]. A software system is composed of a series of software key ad o-key uits (Fig. 8). Each software system icludes critical ad importat parts i which occurrece of error leads to the system failure whose cost caot be compesated. These critical ad importat parts are called software key uits ad other sectios are o-key uits[2]. Fig. 8. o-key software uit ad key software uit Oe way to icrease fault tolerace is usig differet versios ad deploymet of fault tolerace techiques. But sice the developmet of differet versios of the etire system is very costly, several differet versios that have differet implemetatios are developed oly for software key uits. Sice the key uits have several versios which lead to icrease of the executio time, we use multi-core architecture features to reduce time ad ru the versios o differet cores i parallel. This approach reduces executio time ad thus icreases the performace. I compariso with the high cost of the sequetial program, the cost of sychroizatio ad commuicatio betwee the cores is egligible [2]. 6. Implemetatio ad Results of Multi- Core Usage The effect of multi-core architecture o icreasig performace of the NVP techique has bee discussed by Yag et al [10]. I this paper we discuss the effect of multi-core architecture o techiques derived from the NVP, DRB, CRB ad improved cosesus recovery block. I this paper, fault-tolerace techiques have bee used to icrease reliability; so, differet implemetatios of umerical methods for solvig differetial equatios of the satellite motio were used as differet versios i fault tolerace techiques. Accordigly, Ruge-Kutta, Adams-Bashforth ad Adams-Moulto methods are implemeted as differet versios. I other words, i each techique we execute differet versios o sigle ad multi-core architecture ad the

5 Joural of Iformatio Systems ad Telecommuicatio, Vol. 2, No. 3, July-September compare executio times o the sigle core with the multi-core. Fially, we offer a ew techique to reach a higher performace where the executio times of techiques are sigificatly decreased usig the multicore architecture. As show i Fig. 9, the speedup rate of the NVP techique for dual ad quad core processors is 1.73 ad 2.42 respectively. Because the reliability o this techique is low the NVP-TB-AT Techique is used istead. The speedup rate of this techique is 1.70 ad 2.06 for dual ad quad core processors respectively. The effect of multi-core architecture o performace of the RcB techique is show i Fig. 10. Fig. 9. Executio time of NVP techique ad derived techique The RcB techique executio time o sigle core, dual core ad quad core are 11266, 6413 ad 4718 respectively. I sigle core architecture, all versios are executed sequetially; so the executio time is loger tha other oes. For example, i our implemetatio the executio time of each versio is equal to 1945, 2356 ad 1872 respectively. This meas that the executio time of RcB techique o sigle core is about sum of all these times. I order to apply advatage of parallelism, we ca use distributed versio of this techique amed Distributed Recovery Block (DRB). The DRB techique has 1.76 ad 2.39 speedup rate usig dual ad quad core processors. Show i Fig. 10, the executio time improvemet for quad core architecture is more tha dual core architecture i the case of parallelism. I other words by icreasig the umber of cores, a improvemet of the performace is expected. Fig. 10. Efect of multi-core architecture o performace of recovery block techique 7. Suggested Techique (Improved Cosesus Recovery Block) while usig NVP-TB-AT, if the result of two faster versios were equal, oe of them would be aouced as the correct result ad o acceptace test is performed o the results [5]. So if there is a error i the system that causes the result of two faster versios be similar ad wrog, probability of the overall system failure icreases usig this techique. Thus this techique is less reliable tha RcB techique, because i RcB techique the result goes to the acceptace test module i ay coditios to be retured as a correct result. Also, if a program had several correct aswers, the NVP-TB-AT techique might face failure. If both faster versios produce correct but differet results, the voter waits for the slowest versio ad judges betwee results of two faster versios ad result of slowest versio usig the decisio mechaism. If the lowest versio has a correct but a differet result tha results of faster versios, the voter caot decide ad system will face failure. But, if the RcB techique is used ad the program has several correct results, system does ot fail because the AT is applied to every versio ad so the correct result will be determied. Order of this techique is show by Eq. (9) ad (10). Versios V 1, V 2,, V V Nmber of Versios C Number of Cores Order of Versios f ( V 1), f ( V 2),, f ( V ) F1, F2,, F f ( V ) The Slowest Versio V S C Q ( V ) F1, F2,, F RcB Order O ( Q ( V )) QV ( ) O ( ) if C V C NVP Order QV ( ) O ( ) if C V V DRB Order O ( S f ( V )) CRB Order O (( NVP Order ) ( RcB Order )) ICRB Order O (( NVP Order ) ( CRB Order )) (9) (10) As metioed i Sectio 2, differet versios of RcB techique are executed cosecutively. Accordigly, the RcB techique order is calculated by sum of all versios time order. I the NVP techique, time order is related to the umber of versios ad available cores because of ruig versios simultaeously. I other words, if available cores are more tha the umber of versios, icreasig the umber of cores will be ieffective o decreasig time order. O the other had, while the available cores are equal to or less tha the umber of versios, icreasig the umber of cores leads to decrease of time order.

6 178 Baki, Babamir, Farokh & Morovati, Ehacig Efficiecy of Software Fault Tolerace Techiques i Satellite Motio System I the DRB techique, the executio steps of versios are computed based o relatioship betwee the umber of versios ad odes (primary ad shadow odes). This meas that the arragemet for ruig versios cosiders that all versios ca be performed by miimum steps. Moreover, accordig to cocurret executio, time order of this techique always depeds o the slowest versio. So, the DRB techique time order is determied by product of the umber of cases i which all versios are executed ad time order of the slowest versio. Sice the CRB techique is a merger of the NVP ad RcB techiques, the proposed techique is a combiatio of NVP ad DRB techiques ad the time order of these two techiques are computed usig sum of costituet techiques time order. O the other had, the performace of the RcB techique is largely depedet o the performace of acceptace test. While i may cases, creatio of the acceptace test module is very difficult, the CRB techique decreases the importace of acceptace test more tha the RcB oe. Also, the NVP techique will ot be able to produce the fial result whe the problem has several correct aswers. So, the RcB ad NVP techiques have drawbacks i some cases which the CRB has resolved by combiig two techiques discussed above. Accordig to superiority of CRB techique over other techiques, we cocetrate o it ad i order to improve its performace, we have proposed a techique which is similar to CRB techique ad called Improved Cosesus Recovery Block. I executio of CRB, first the NVP sectio tries to produce the correct result. If decisio module was able to produce the result, the techique termiates. Otherwise, the secod sectio amely recovery block will execute to produce the correct result. Sice the executio of recovery block is sequetially, the executio time is icreased. The recovery block does ot use multi-core facility ad therefore does ot take advatage of parallel processig. I this paper, i order to take full advatage of multi-core facilities ad reduce the executio time of the CRB techique, we try to use Distributed Recovery Block (DRB) istead of RcB. Fig. 11 shows the proposed algorithm where the first versios are executed simultaeously through NVP techique ad their result is give to a voter. If the voter ca produce a correct result, it returs the result. Otherwise, differet versios are executed through DRB techique. Ifluece of the multi-core architecture o performace of the CRB techique is show i Fig. 12. Differet implemetatios of umerical methods for solvig differetial equatios of satellite motio were used as differet versios which are required i CRB techique. As Fig. 12 shows, the CRB executio time o dual-core ad quad-core architectures is ad respectively, while Improved Cosesus Recovery Block executio time o dual-core ad quad-core architectures is ad respectively. So Improved CRB decreases total executio time. I other words, the speedup rate of Improved CRB i compariso with CRB for dual-core ad quad-core architectures is 1.51 ad 1.58 respectively. Executio of the NVP sectio is same i CRB ad Improved CRB techiques but the differece is i the recovery block sectio because the CRB executes the recovery block sectio sequetially. T (1) Speed up T ( P) (11) Also, the Improved CRB techique Speed-up for 2, 4 ad 8 Cores cases are represeted i the Table 1, calculated usig Eq.(11)[11] (Prefers to the umber of cores ad T(P) is the executio time usig P cores). Table 1. Speed-up of Improved Cosesus Recovery Block Techique Statuses Speed up 2 Cores Cores Cores 2.29 Importat poit of this techique is the close relatio betwee speed-up ad both the umber of versios ad available cores., if the umber of available cores is greater tha the umber of versios, icreasig the umber of cores will be ieffective o Speed-up improvemet. Otherwise, icreasig the umber of cores is effective o speed-up. I the worst case, amely the case i which last versio performs the acceptace test successfully, the executio time will be equal to the total time of ruig all versios. However, i the Improved CRB, the recovery block sectio is executed distributedly ad so its executio time is equal to executio time of the logest versio. Fig. 11. Improved cosesus recovery block techique algorithm Fig. 12. Ifluece of multi-core architecture o performace of cosesus recovery block techique

7 Joural of Iformatio Systems ad Telecommuicatio, Vol. 2, No. 3, July-September Accordig to Fig. 10, executio time of the DRB techique i quad core architecture is less tha executio time of CRB techique. But sice the CRB does ot have problems of the DRB techique, it is more suitable i may cases. I this paper, we showed that the CRB executio time ca also be decreased. 8. Coclusios Amog differet software fault tolerace techiques the Cosesus Recovery Block (CRB) has more reliability over other oes i some cases ad also it does ot have problems of other techiques. To icrease performace of this techique, we proposed oe techique which is called Improved CRB techique i which the reliability is like the CRB ad because of usig distributio cocepts, it has more performace. Accordig to capability of multi-core architecture for supportig parallel processig, this architecture has bee used to decrease the executio time ad thus icreasig performace of the fault-tolerace techiques. As a result, we showed that the Improved CRB techique is more suitable over other techiques from view of the reliability ad performace properties. Because the satellite motio computatio is the most critical part of the system, i this paper we have used this subsystem as a case study ad software fault tolerace techiques were used to solve the umerical differetial equatio of satellite motio i order to icrease the reliability. To this ed, differet implemetatios of the umerical differetial equatio of the satellite motio methods were employed as differet versios which are required i software fault tolerace techiques. The, to determie the icrease rate of the performace, we compared the executio time for sigle core architecture i the sequetial mode ad for multi-core oe i the cocurret mode i differet fault tolerace techiques. The NVP-TB-AT techique, which has more performace ad reliability over other derived NVP techiques, the executio time i case of sequetial mode at sigle core architecture was 9335 while the executio time i case of the parallel mode at dual-core ad quadcore architecture was 5477 ad 4511 respectively. So, the speedup rate for dual-core ad quad-core architectures is 1.70 ad 2.06 respectively. Moreover, the executio time of recovery block techique o sigle-core, dual-core ad quad-core is 22.04, ad respectively. Sice high reliability is critical i the satellite motio computatio system, we use the Cosesus Recovery Block techique which has high reliability but its problem is high executio time. This problem was solved by proposig a Improved Cosesus Recovery Block techique. Accordig to our experimets, the best executio time of Improved CRB is at quad-core architecture ad it is equal to 10124, while the executio time of CRB is at quad core architecture. These two techiques have similar reliability but their performace rate is differet. I other words, Cosesus Recovery Block does ot use distributio ad cocurrecy mechaisms, therefore it caot use advatages of cocurrecy i multi core architecture. The proposed techique has high performace because of takig advatage of distributio mechaism ad usig cocurrecy i multi core architecture. Therefore accordig to the obtaied results, usig Improved Recovery Block techique ad the multi core architecture simultaeously icreases the reliability ad performace i a fault tolerat software. Refereces [1] A. Avizieis ad J. P. J. Kelly, "Fault tolerace by desig diversity- Cocepts ad experimets," IEEE Computer, vol. 17, pp , [2] L. Yag, L. Yu, J. Tag, L. Wag, J. Zhao, ad X. Li, "McC++/Java: Eablig Multi-core Based Moitorig ad Fault Tolerace i C++/Java," i 15th IEEE Iteratioal Coferece o Egieerig of Complex Computer Systems (ICECCS), 2010, pp [3] L. L. Pullum, Software fault tolerace techiques ad implemetatio: Artech House Publishers, [4] A. T. Tai, J. F. Meyer, ad A. Avizieis, "Performability ehacemet of fault-tolerat software," Reliability, IEEE Trasactios o, vol. 42, pp , [5] A. T. Tai, J. F. Meyer, ad A. Avizieis, Software performability: From cocepts to applicatios: Kluwer Academic Publishers, [6] K. H. Kim, "The Distributed Recovery Block Scheme," M. R. Lyu(ed.), Software Fault Tolerace, pp , [7] I. Kore ad C. M. Krisha, Fault-tolerat systems: Morga Kaufma, [8] M. Eshagh ad M. Najafi Alamdari, "Compariso of umerical Itegratio methods i orbit determiatio of low earth orbitig satellites," Joural of The Earth ad Space Physics, vol. 32, pp , [9] S. Akhter ad J. Roberts, Multi-Core Programmig vol. 33: Itel Press, [10] L. Yag, Z. Cui, ad X. Li, "A case study for fault tolerace orieted programmig i multi-core architecture," i 11th IEEE Iteratioal Coferece o High Performace Computig ad Commuicatios, HPCC '09., 2009, pp [11] B. Parhami, Itroductio to parallel processig: algorithms ad architectures vol. 1: Spriger, 1999.

8 180 Baki, Babamir, Farokh & Morovati, Ehacig Efficiecy of Software Fault Tolerace Techiques i Satellite Motio System Hoda Baki is M.Sc. studet at Kasha Uiversity i software egieerig. She received B.Sc. degree i software egieerig from Islamic Azad Uiversity Cetral Tehra Brach (IAUCTB) i Her mai research iterests are high performace computig, distributed systems, quatitative evaluatio of software architecture ad desig based o software architecture styles. Seyed Morteza Babamir received BS degree i Software Egieerig from Ferdowsi Uiversity of Meshhad ad MS ad PhD degrees i Software Egieerig from Tarbiat Modares Uiversity i 2002 ad 2007 respectively. He was a researcher at Ira Aircraft Idustries, Tehra City, Ira, from 1987 to 1993, head of Computer Ceter i Uiversity of Kasha, Kasha, Ira, from 1997 to 1999 ad haed of Computer Egieerig Departmet i Uiversity of Kasha from 2002 to Sice 2007, he has bee a associate professor of Departmet of Computer Egieerig i Uiversity of Kasha, Kasha, Ira. He authored oe book i Software Testig, four book chapters, fourtee joural papers ad more tha forty iteratioal ad iteral coferece papers ( He is maagig director of Soft Computig Joural published by supportig Uiversity of Kasha, Kasha, Ira. He is a member of the ACM. Azam Farokh is M.S. studet at Kasha Uiversity i software egieerig. She received B.S. degree i software egieerig from Arak Uiversity i Her research iterests are icludig Software Egieerig, high performace computig, Distributed Systems, Fault Tolerat Systems ad software architecture. Her curret research project is Evaluatio of the appropriate style for Adaptive software architecture. Mohammad Mehdi Morovati is M.Sc. studet at Kasha Uiversity i software egieerig. He received B.Sc. degree i software egieerig i 2008 from college of Bahoar. His research iterests iclude the field of Software Egieerig ad Artificial Itelligece ad to date his focus has spaed the areas of Distributed Software Systems, Fault Tolerace Software Systems, High Performace Computig ad Self-adaptive Software Systems.

Data diverse software fault tolerance techniques

Data diverse software fault tolerance techniques Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the

More information

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig

More information

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work 200 2d Iteratioal Coferece o Iformatio ad Multimedia Techology (ICIMT 200) IPCSIT vol. 42 (202) (202) IACSIT Press, Sigapore DOI: 0.7763/IPCSIT.202.V42.0 Idex Weight Decisio Based o AHP for Iformatio Retrieval

More information

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein 068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:

More information

GPUMP: a Multiple-Precision Integer Library for GPUs

GPUMP: a Multiple-Precision Integer Library for GPUs GPUMP: a Multiple-Precisio Iteger Library for GPUs Kaiyog Zhao ad Xiaowe Chu Departmet of Computer Sciece, Hog Kog Baptist Uiversity Hog Kog, P. R. Chia Email: {kyzhao, chxw}@comp.hkbu.edu.hk Abstract

More information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

More information

EFFICIENT MULTIPLE SEARCH TREE STRUCTURE

EFFICIENT MULTIPLE SEARCH TREE STRUCTURE EFFICIENT MULTIPLE SEARCH TREE STRUCTURE Mohammad Reza Ghaeii 1 ad Mohammad Reza Mirzababaei 1 Departmet of Computer Egieerig ad Iformatio Techology, Amirkabir Uiversity of Techology, Tehra, Ira mr.ghaeii@aut.ac.ir

More information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

Service Oriented Enterprise Architecture and Service Oriented Enterprise

Service Oriented Enterprise Architecture and Service Oriented Enterprise Approved for Public Release Distributio Ulimited Case Number: 09-2786 The 23 rd Ope Group Eterprise Practitioers Coferece Service Orieted Eterprise ad Service Orieted Eterprise Ya Zhao, PhD Pricipal, MITRE

More information

FPGA IMPLEMENTATION OF BASE-N LOGARITHM. Salvador E. Tropea

FPGA IMPLEMENTATION OF BASE-N LOGARITHM. Salvador E. Tropea FPGA IMPLEMENTATION OF BASE-N LOGARITHM Salvador E. Tropea Electróica e Iformática Istituto Nacioal de Tecología Idustrial Bueos Aires, Argetia email: salvador@iti.gov.ar ABSTRACT I this work, we preset

More information

Multi-Threading. Hyper-, Multi-, and Simultaneous Thread Execution

Multi-Threading. Hyper-, Multi-, and Simultaneous Thread Execution Multi-Threadig Hyper-, Multi-, ad Simultaeous Thread Executio 1 Performace To Date Icreasig processor performace Pipeliig. Brach predictio. Super-scalar executio. Out-of-order executio. Caches. Hyper-Threadig

More information

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5 Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:

More information

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui 2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal

More information

Software development of components for complex signal analysis on the example of adaptive recursive estimation methods.

Software development of components for complex signal analysis on the example of adaptive recursive estimation methods. Software developmet of compoets for complex sigal aalysis o the example of adaptive recursive estimatio methods. SIMON BOYMANN, RALPH MASCHOTTA, SILKE LEHMANN, DUNJA STEUER Istitute of Biomedical Egieerig

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms for Disk Covering Problems with the Most Points Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi

More information

Stone Images Retrieval Based on Color Histogram

Stone Images Retrieval Based on Color Histogram Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose

More information

How do we evaluate algorithms?

How do we evaluate algorithms? F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:

More information

EE University of Minnesota. Midterm Exam #1. Prof. Matthew O'Keefe TA: Eric Seppanen. Department of Electrical and Computer Engineering

EE University of Minnesota. Midterm Exam #1. Prof. Matthew O'Keefe TA: Eric Seppanen. Department of Electrical and Computer Engineering EE 4363 1 Uiversity of Miesota Midterm Exam #1 Prof. Matthew O'Keefe TA: Eric Seppae Departmet of Electrical ad Computer Egieerig Uiversity of Miesota Twi Cities Campus EE 4363 Itroductio to Microprocessors

More information

ISSN (Print) Research Article. *Corresponding author Nengfa Hu

ISSN (Print) Research Article. *Corresponding author Nengfa Hu Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com

More information

Heuristic Approaches for Solving the Multidimensional Knapsack Problem (MKP)

Heuristic Approaches for Solving the Multidimensional Knapsack Problem (MKP) Heuristic Approaches for Solvig the Multidimesioal Kapsack Problem (MKP) R. PARRA-HERNANDEZ N. DIMOPOULOS Departmet of Electrical ad Computer Eg. Uiversity of Victoria Victoria, B.C. CANADA Abstract: -

More information

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Y.K. Patil* Iteratioal Joural of Advaced Research i ISSN: 2278-6244 IT ad Egieerig Impact Factor: 4.54 HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Prof. V.S. Nadedkar** Abstract: Documet clusterig is

More information

l-1 text string ( l characters : 2lbytes) pointer table the i-th word table of coincidence number of prex characters. pointer table the i-th word

l-1 text string ( l characters : 2lbytes) pointer table the i-th word table of coincidence number of prex characters. pointer table the i-th word A New Method of N-gram Statistics for Large Number of ad Automatic Extractio of Words ad Phrases from Large Text Data of Japaese Makoto Nagao, Shisuke Mori Departmet of Electrical Egieerig Kyoto Uiversity

More information

1 Enterprise Modeler

1 Enterprise Modeler 1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio

More information

Operating System Concepts. Operating System Concepts

Operating System Concepts. Operating System Concepts Chapter 4: Mass-Storage Systems Logical Disk Structure Logical Disk Structure Disk Schedulig Disk Maagemet RAID Structure Disk drives are addressed as large -dimesioal arrays of logical blocks, where the

More information

Chapter 4 Threads. Operating Systems: Internals and Design Principles. Ninth Edition By William Stallings

Chapter 4 Threads. Operating Systems: Internals and Design Principles. Ninth Edition By William Stallings Operatig Systems: Iterals ad Desig Priciples Chapter 4 Threads Nith Editio By William Stalligs Processes ad Threads Resource Owership Process icludes a virtual address space to hold the process image The

More information

The identification of key quality characteristics based on FAHP

The identification of key quality characteristics based on FAHP Iteratioal Joural of Research i Egieerig ad Sciece (IJRES ISSN (Olie: 2320-9364, ISSN (Prit: 2320-9356 Volume 3 Issue 6 ǁ Jue 2015 ǁ PP.01-07 The idetificatio of ey quality characteristics based o FAHP

More information

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000. 5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator

More information

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao

More information

A Study on the Performance of Cholesky-Factorization using MPI

A Study on the Performance of Cholesky-Factorization using MPI A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio

More information

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation 6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

New HSL Distance Based Colour Clustering Algorithm

New HSL Distance Based Colour Clustering Algorithm The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics

More information

A Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions

A Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms

More information

Appendix D. Controller Implementation

Appendix D. Controller Implementation COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);

More information

COMP Parallel Computing. PRAM (1): The PRAM model and complexity measures

COMP Parallel Computing. PRAM (1): The PRAM model and complexity measures COMP 633 - Parallel Computig Lecture 2 August 24, 2017 : The PRAM model ad complexity measures 1 First class summary This course is about parallel computig to achieve high-er performace o idividual problems

More information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute

More information

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers * Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of

More information

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules

More information

Relay Placement Based on Divide-and-Conquer

Relay Placement Based on Divide-and-Conquer Relay Placemet Based o Divide-ad-Coquer Ravabakhsh Akhlaghiia, Azadeh Kaviafar, ad Mohamad Javad Rostami, Member, IACSIT Abstract I this paper, we defie a relay placemet problem to cover a large umber

More information

Ontology-based Decision Support System with Analytic Hierarchy Process for Tour Package Selection

Ontology-based Decision Support System with Analytic Hierarchy Process for Tour Package Selection 2017 Asia-Pacific Egieerig ad Techology Coferece (APETC 2017) ISBN: 978-1-60595-443-1 Otology-based Decisio Support System with Aalytic Hierarchy Process for Tour Pacage Selectio Tie-We Sug, Chia-Jug Lee,

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu

More information

Parallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware

Parallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware Parallel Polygo Approximatio Algorithm Targeted at Recofigurable Multi-Rig Hardware M. Arif Wai* ad Hamid R. Arabia** *Califoria State Uiversity Bakersfield, Califoria, USA **Uiversity of Georgia, Georgia,

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

Lecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions

Lecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets

More information

A Note on Least-norm Solution of Global WireWarping

A Note on Least-norm Solution of Global WireWarping A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract

More information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic Programming and Curve Fitting Based Road Boundary Detection Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk

More information

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y

More information

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More information

An Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach

An Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach It. J. Cotemp. Math. Scieces, Vol. 6, 0, o. 34, 65-66 A Algorm to Solve Multi-Objective Assigmet Problem Usig Iteractive Fuzzy Goal Programmig Approach P. K. De ad Bharti Yadav Departmet of Mathematics

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies

More information

Outline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs

Outline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs Dyamic Aalysis ad Desig Patter Detectio i Java Programs Outlie Lei Hu Kamra Sartipi {hul4, sartipi}@mcmasterca Departmet of Computig ad Software McMaster Uiversity Caada Motivatio Research Problem Defiitio

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe

More information

Optimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method

Optimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal

More information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 20 Itroductio to Trasactio Processig Cocepts ad Theory Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Trasactio Describes local

More information

Keywords Software Architecture, Object-oriented metrics, Reliability, Reusability, Coupling evaluator, Cohesion, efficiency

Keywords Software Architecture, Object-oriented metrics, Reliability, Reusability, Coupling evaluator, Cohesion, efficiency Volume 3, Issue 9, September 2013 ISSN: 2277 128X Iteratioal Joural of Advaced Research i Computer Sciece ad Software Egieerig Research Paper Available olie at: www.ijarcsse.com Couplig Evaluator to Ehace

More information

The golden search method: Question 1

The golden search method: Question 1 1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())

More information

Cache-Optimal Methods for Bit-Reversals

Cache-Optimal Methods for Bit-Reversals Proceedigs of the ACM/IEEE Supercomputig Coferece, November 1999, Portlad, Orego, U.S.A. Cache-Optimal Methods for Bit-Reversals Zhao Zhag ad Xiaodog Zhag Departmet of Computer Sciece College of William

More information

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk

More information

A Modified Multiband U Shaped and Microcontroller Shaped Fractal Antenna

A Modified Multiband U Shaped and Microcontroller Shaped Fractal Antenna al Joural o Recet ad Iovatio Treds i Computig ad Commuicatio ISSN: 221-8169 A Modified Multibad U Shaped ad Microcotroller Shaped Fractal Atea Shweta Goyal 1, Yogedra Kumar Katiyar 2 1 M.tech Scholar,

More information

Empirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic.

Empirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic. Empirical Validate C&K Suite for Predict Fault-Proeess of Object-Orieted Classes Developed Usig Fuzzy Logic. Mohammad Amro 1, Moataz Ahmed 1, Kaaa Faisal 2 1 Iformatio ad Computer Sciece Departmet, Kig

More information

COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design

COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad

More information

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms Fuzzy Rule Selectio by Data Miig Criteria ad Geetic Algorithms Hisao Ishibuchi Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka 599-8531, JAPAN E-mail: hisaoi@ie.osakafu-u.ac.jp

More information

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 ) EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders

More information

Enhancing Cloud Computing Scheduling based on Queuing Models

Enhancing Cloud Computing Scheduling based on Queuing Models Ehacig Cloud Computig Schedulig based o Queuig Models Mohamed Eisa Computer Sciece Departmet, Port Said Uiversity, 42526 Port Said, Egypt E. I. Esedimy Computer Sciece Departmet, Masoura Uiversity, Masoura,

More information

One advantage that SONAR has over any other music-sequencing product I ve worked

One advantage that SONAR has over any other music-sequencing product I ve worked *gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig

More information

CMPT 125 Assignment 2 Solutions

CMPT 125 Assignment 2 Solutions CMPT 25 Assigmet 2 Solutios Questio (20 marks total) a) Let s cosider a iteger array of size 0. (0 marks, each part is 2 marks) it a[0]; I. How would you assig a poiter, called pa, to store the address

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

Recursion. Computer Science S-111 Harvard University David G. Sullivan, Ph.D. Review: Method Frames

Recursion. Computer Science S-111 Harvard University David G. Sullivan, Ph.D. Review: Method Frames Uit 4, Part 3 Recursio Computer Sciece S-111 Harvard Uiversity David G. Sulliva, Ph.D. Review: Method Frames Whe you make a method call, the Java rutime sets aside a block of memory kow as the frame of

More information

The VSS CCD photometry spreadsheet

The VSS CCD photometry spreadsheet The VSS CCD photometry spreadsheet Itroductio This Excel spreadsheet has bee developed ad tested by the BAA VSS for aalysig results files produced by the multi-image CCD photometry procedure i AIP4Wi v2.

More information

FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS

FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS SIAM J. SCI. COMPUT. Vol. 22, No. 6, pp. 2113 2134 c 21 Society for Idustrial ad Applied Mathematics FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS ZHAO ZHANG AND XIAODONG ZHANG

More information

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig

More information

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System A Novel Feature Extractio Algorithm for Haar Local Biary Patter Texture Based o Huma Visio System Liu Tao 1,* 1 Departmet of Electroic Egieerig Shaaxi Eergy Istitute Xiayag, Shaaxi, Chia Abstract The locality

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 22 Database Recovery Techiques Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Recovery algorithms Recovery cocepts Write-ahead

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to

More information

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the

More information

ANALYSIS OF RATIONAL FUNCTION DEPENDENCY TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES

ANALYSIS OF RATIONAL FUNCTION DEPENDENCY TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES ANALSIS OF RATIONAL FUNCTION DEPENDENC TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES M. Hosseii, Departmet of Geomatics Egieerig, Faculty of

More information

Neuro Fuzzy Model for Human Face Expression Recognition

Neuro Fuzzy Model for Human Face Expression Recognition IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1

More information

Evaluation of Distributed and Replicated HLR for Location Management in PCS Network

Evaluation of Distributed and Replicated HLR for Location Management in PCS Network JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 9, 85-0 (2003) Evaluatio of Distributed ad Replicated HLR for Locatio Maagemet i PCS Network Departmet of Computer Sciece ad Iformatio Egieerig Natioal Chiao

More information

Appendix A. Use of Operators in ARPS

Appendix A. Use of Operators in ARPS A Appedix A. Use of Operators i ARPS The methodology for solvig the equatios of hydrodyamics i either differetial or itegral form usig grid-poit techiques (fiite differece, fiite volume, fiite elemet)

More information

BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM

BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM Staislav Shidlovskiy 1, 1 Natioal Research

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information