A Genetic Algorithm Based Dynamic Load Balancing Scheme for Heterogeneous Distributed Systems

Size: px
Start display at page:

Download "A Genetic Algorithm Based Dynamic Load Balancing Scheme for Heterogeneous Distributed Systems"

Transcription

1 Proceedngs of the Internatonal Conference on Parallel and Dstrbuted Processng Technques and Applcatons, PDPTA 2008, Las Vegas, Nevada, USA, July 14-17, 2008, 2 Volumes. CSREA Press 2008, ISBN A Genetc Algorthm Based Dynamc Load Balancng Scheme for Heterogeneous Dstrbuted Systems Bbhudatta Sahoo 1, Sudpta Mohapatra 2, and Sanay Kumar Jena 1 1 Department of Computer Scence & Engneerng, NIT Rourkela, Orssa, Inda 2 Department of Electroncs & Electrcal Communcaton Engneerng, IIT Karagpur, Inda Abstract - Load balancng s a crucal ssue n parallel and dstrbuted systems to ensure fast processng and optmum utlzaton of computng resources. Load balancng strateges try to ensure that every processor n the system does almost the same amount of work at any pont of tme. Ths paper nvestgates dynamc loadbalancng algorthm for heterogeneous dstrbuted systems where half of the processors have double the speed of the others. Two ob classes are consdered for the study, the obs of frst class are dedcated to fast processors. Whle second ob classes are generc n the sense they can be allocated to any processor. The performance of the scheduler has been verfed under scalablty. Some smulaton results are presented to show the effectveness of genetc algorthms for dynamc load balancng. Keywords: Heterogeneous dstrbuted system, dynamc load balancng, makespan, genetc algorthm. 1 Introducton Dstrbuted heterogeneous computng s beng wdely appled to a varety of large sze computatonal problems. These computatonal envronments are conssts of multple heterogeneous computng modules, these modules nteract wth each other to solve the problem. In a Heterogeneous dstrbuted computng system (HDCS), processng loads arrve from many users at random tme nstants. A proper schedulng polcy attempts to assgn these loads to avalable computng nodes so as to complete the processng of all loads n the shortest possble tme. The resource manager schedules the processes n a dstrbuted system to make use of the system resources n such a manner that resource usage, response tme, network congeston, and schedulng overhead are optmzed. There are number of technques and methodologes for schedulng processes of a dstrbuted system. These are task assgnment, load-balancng, load-sharng approaches [7, 9, 10]. Due to heterogenety of computng nodes, obs encounter dfferent executon tmes on dfferent processors. Therefore, research should address schedulng n heterogeneous envronment. In task assgnment approach, each process submtted by a user for processng s vewed as a collecton of related tasks and these tasks are scheduled to sutable nodes so as to mprove performance. In load sharng approach smply attempts to conserve the ablty of the system to perform work by assurng that no node s dle whle processes wat for beng processed. In load balancng approach, processes submtted by the users are dstrbuted among the nodes of the system so as to equalze the workload among the nodes at any pont of tme. Processes mght have to be mgrated from one machne to another even n the mddle of executon to ensure equal workload. Load balancng strateges may be statc or dynamc [1, 3, 7]. To mprove the utlzaton of the processors, parallel computatons requre that processes be dstrbuted to processors n such a way that the computatonal load s spread among the processors. Dynamc load dstrbuton (also called load balancng, load sharng, or load mgraton) can be appled to restore balance [7]. In general, loadbalancng algorthms can be broadly categorzed as centralzed or decentralzed, dynamc or statc, perodc or non-perodc, and those wth thresholds or wthout thresholds [3, 7, 11]. We have used a centralzed loadbalancng algorthm framework as t mposes fewer overheads on the system than the decentralzed algorthm The load-balancng problem, am to compute the assgnment wth smallest possble makespan (.e. the completon tme at the maxmum loaded computng node). The load dstrbuton problem s known to be NP-hard [4, 5] n most cases and therefore ntractable wth number of tasks and/or the computng node exceeds few unts. Here, the load balancng s a ob schedulng polcy whch takes a ob as a whole and assgn t to a computng node [2].Ths paper consders the problem of fndng an optmal soluton for

2 load balancng n heterogeneous dstrbuted system. The rest of the paper s organzed as follows. The next secton dscusses Heterogeneous dstrbuted computng system (HDCS) structure and the load-balancng problem. Secton 3 descrbes the dfferent dynamc load dstrbuton algorthms. We have smulated the behavor of dfferent load balancng algorthm wth our smulator developed usng Matlab, where each task t s wth the expected executon tme e and expected completon tme c, on machne M. The results of the smulaton wth scalablty of computng nodes and tasks are presented n Secton 4. Fnally, conclusons and drectons for future research are dscussed n Secton 5. 2 System and problem model 2.1 Heterogeneous dstrbuted computng system Heterogeneous dstrbuted computng system (HDCS) utlzes a dstrbuted sute of dfferent hgh-performance machnes, nterconnected wth hgh-speed lnks, to perform dfferent computatonally ntensve applcatons that have dverse computatonal requrements. Dstrbuted computng provdes the capablty for the utlzaton of remote computng resources and allows for ncreased levels of flexblty, relablty, and modularty. In heterogeneous dstrbuted computng system the computatonal power of the computng enttes are possbly dfferent for each processor as shown n fgure 1[1, 3, 4]. A large heterogeneous dstrbuted computng system (HDCS) conssts of potentally mllons of heterogeneous computng nodes connected by the global Internet. The applcablty and strength of HDCS are derved from ther ablty to meet computng needs to approprate resources [2, 3, 9]. Resource management sub systems of the HDCS are desgnated to schedule the executon of the tasks that arrve for the servce. HDCS envronments are well suted to meet the computatonal demands of large, dverse groups of tasks. The problem of optmally mappng also defned as matchng and schedulng. µ 1 λ Job arrvals Resource Manager Fgure: 1 Dstrbuted Computng System µ 2 µ m We consder a heterogeneous dstrbuted computng system (HDCS) conssts of a set of m {M 1, M 2, Mm} ndependent heterogeneous, unquely addressable computng entty (computng nodes). Let there are n number of obs wth each ob has a processng tme t are to be processed n the HDCS wth m nodes. Hence the generalzed loadbalancng problem s to assgn each ob to one of the node M so that the loads placed on all machne are as balanced as possble [5]. 2.2 Mathematcal model for load balancng Ths secton presents a mathematcal model for load balancng problem based on mnmax crteron. Obectve of ths formulaton s to mnmze the load at the maxmum loaded processor. Let A() be the set of obs assgned to machne M ; hence the machne M needs total computng tme T = t, whch s otherwse known as (L ) A() load on machne M. The basc obectve of load balancng s to mnmze makespan[11]; whch s defned as maxmum loads on any machne ( T = max T ). Ths problem can be expressed as lnear programmng problem, wth the obectve to Mnmze L (load of the correspondng assgnment) Mnmze L x = t, for all A() x L, for all M x {0, t } x = 0, t, for all A(), M { } x = 0, for all A(), M Where M M; set of machnes to whch the ob can be assgned. The problem of fndng an assgnment of mnmum makespan s NP-hard [5]. The solutons to ths can be obtaned usng a dynamc programmng algorthm Ο(n L m ), where L s the mnmum makespan. Due to the complexty of load balancng problem, most of researchers proposed heurstc algorthms, whle optmal algorthm are developed for only restrcted cases or for small problems[4]. Genetc algorthms (GAs) are evolutonary optmzaton approaches whch are an alternatve to tradtonal optmzaton methods. GA s most approprate for complex non-lnear models where locaton of the global optmum s a dffcult task. Hence genetc algorthms have been used to solve hard optmzaton problem. In ths paper we have analyze the performance HDCS where half the total processors have double speed than others.

3 3 System Model and Methodology 3.1 System and Workload Models Typcally, a load dstrbutng algorthm has four components: () a transfer polcy that determnes whether a node s n a sutable state to partcpate n a task transfer, () a selecton polcy that determnes whch task should be transferred, () a locaton polcy that determnes to whch node a task selected for transfer should be sent, and (v) an nformaton polcy whch s responsble for trggerng the collecton of system state nformaton [1, 3, 7, 13]. When a new ob arrves at the node (Fgure 3.1) the transfer polcy looks at the node s ob queue length. The ob s allowed to execute at the node f the ob queue length s less than a predetermned threshold. Otherwse Job s assgned to the central scheduler. Job transferred from other nodes Job arrvals Job completed Computng node Job transferred to other nodes Fgure: 3.1 Job flow at computng node Schedulng of tasks n a load balancng dstrbuted system nvolves decdng not only when to execute a process, but also where to execute t. Accordngly, schedulng n a dstrbuted system s accomplshed by two components: the allocator and the scheduler. The allocator decdes where a ob wll execute and the scheduler decdes when a ob gets ts share of the computng resource at the node. In ths paper we have used the computng resource model as dscussed n [6 ] Fgure 3.2: Central scheduler Queung Model Each heterogeneous computng node s multtaskng, can accommodate maxmum K no of obs for some acceptable QoS. The heterogeneous dstrbuted computng system addressed here can be expressed by Kendall notaton[14] lke M/M/m/K/n, where: () Frst M: represents exponental nter arrval tmes between obs(tasks) dstrbuton (Posson process), () Second M: represents exponental executon tme of obs dstrbuton, () m: represents number of heterogeneous computng nodes,(v) K: represents maxmum number of tasks that can be n a computng Node under the multtaskng, and (v) n: represents number of obs. Let λ be the arrval rate of obs at computng node, Hence the arrval rate at resource manager s λ, where λ = ( λ 1 + λ 2 + λ 3 + Λ + λ m ) m We have assume that the servce rate of all m heterogeneous computng nodes are dfferent,.e. μ μ for any two computng node. In ths paper we have use a heterogeneous dstrbuted computng system, wth two dfferent type of computng nodes connected va a hgh-speed network as shown n fgure 1. Half of the computng nodes (nodes) execute at double the speed of the others. The obs assgned for the executon are assumed to be hghly ndependent. That means when a ob s scheduled for executon, no ob ever deally wats for communcaton wth any other obs. Ths system can be modeled as an open queung network [1,6]. Let M F and Ms be the number of fast or slow computng nodes (machne), so that M F = Ms = m/2. We have assumed that the obs are classfed nto types as dedcated and generc obs wth nter-arrval tme λ G, and λ D respectvely. The obs of frst class are dedcated to fast processors and second class obs are generc n the sense that can be allocated to any processor. There s one arrval stream for dedcated obs and one for generc obs. Model of the system s shown n fgure 3.2. The generc obs arrve at a rate λ G, and can process by any of the computng node. We shall assume that all arrval streams are Posson process. All obs have dentcally dstrbuted servce requrements. One allocated to a partcular computng node, a ob can not be reassgned and must be process to completon by that node. The dedcated obs are mostly the local loads of the computng nodes; f a

4 computng node s loaded above a threshold t s not avalable for genercs obs for a perod of tme. 3.2 Dynamc load dstrbuton algorthms A dynamc load dstrbuton algorthm must be general, adaptve, stable, fault tolerant and transparent to applcatons. Load balancng algorthms can be classfed as () global vs. local, () centralzed vs. decentralzed, () Non-cooperatve vs. cooperatve, and (v) adaptve vs. nonadaptve[7,13]. In ths paper we have used centralzed load balancng algorthm, a central node collects the load nformaton from the other computng nodes n HDCS. Central node communcates the assmlated nformaton to all ndvdual computng nodes, so that the nodes get updated about the system state. Ths updated nformaton enables the nodes to decde whether to mgrate ther process or accept new process for computaton. The computng nodes may depend upon the nformaton avalable wth central node for all allocaton decson. The schedulng polces can be probablstc, determnstc and adaptve. In probablstc case, the dedcated obs are dspatched randomly to the frst processor wth equal probablty whle the generc obs are randomly dspatched to the slow processors. In determnstc case the routng decson s based on system state. Two dfferent polces are examned for ths case. In both polces, the dedcated obs on the shortest of the fast processor queues. However, the frst polcy requres the generc obs on the shortest queue of the slow processors whle the second polcy assgns generc obs to the (slow or fast) processor expected to offer the least ob response tme. However, when a generc ob s assgned to a fast processor, ob start tme depends on an agng factor. In adaptve case, ob mgraton from slow to fast processors employed. Ths s a recever-ntated load sharng method employed to mprove the performance of generc obs. The polcy s ntated when a generc ob s queued on a slow processor and a fast processor becomes dle. Only the mgraton of non-executng obs s consdered. Executng obs are not elgble for transfer because of complexty ssues. When a ob s transferred from a slow to fast processor for remote processng, the ob ncurs addtonal communcaton cost. Only obs that are watng n the queues are transferred. The beneft of mgraton depends on mgraton cost[6,13]. We have referred the workload model that s characterzed by three parameters: The dstrbuton of ob arrval The dstrbuton of processor servce tme The dstrbuton of the mgraton overhead. 3.3 Job Schedulng Polces Here we examned only the non-preemptve schedulng polces only wth a assumpton that the scheduler has perfect nformaton on () The length of all processor queue, qnd () The queung tme of dedcated obs n the fast processor queues. We have used the schedulng strategy used by Karatza et al.[6]. The schedulng strateges used for load balancng decson are Least expected response tme for generc obs maxmum wat for dedcated obs (LERT-MW) LERT-MW wth mgraton havng dea about executon tmes LERT-MW: In ths polcy also dedcated obs are dspatched to the fast processor whch s havng the least queue length, and generc ob wll sent to ether fast or slow processor expected to offer the least ob response tme. The mnmum ob response tme (makespan) s based on the user s vew of how to mprove performance. Ths algorthm needs global nformaton on queue lengths for the generc and dedcated obs, and also t requres addtonal nformaton about the tme-dedcated obs watng n a queue. LERT-MWM: In the above method we don t have pror knowledge about the executon tmes. So, we can t evenly dstrbute the load among all the nodes. The results some processors reman dle, whle others are overloaded. Ths requres the mgraton of obs form overloaded processors to dle processors. By ths process mgraton overhead may be more for small obs & results lower processors utlzaton. So we are gong for GA, whch wll use the LERT-MW n the phase of schedulng. 3.4 GA based Load Balancng Method In ths secton, we detal our schedulng algorthm whch utlzes GA for load balancng n HDCS. Genetc algorthms work wth a populaton of the potental solutons of the canddate problem represented n the form of chromosomes. Each chromosome s composed of varables called genes. Each chromosome (genotype) maps to a ftness value (phenotype) on the bass of the obectve functon of the canddate problem. The algorthm we have developed us based upon one developed by Zomalya et al.[11, 12]. Jobs arrve at unknown ntervals for processng and are placed n the queue of unscheduled tasks from whch tasks are assgned to processors. Each task s havng a task number and a sze. GA follows the concept of soluton evoluton by stochastcally developng generatons of soluton populatons usng a gven ftness statstc. They are partcularly applcable to problems whch are large, non-

5 lnear and possbly dscrete n nature, features that tradtonally add to the degree of complexty of soluton. Due to the probablstc development of the soluton, GA do not guarantee optmalty even when t may be reached. However, they are lkely to be close to the global optmum. Ths probablstc nature of the soluton s also the reason they are not contaned by local optma. The proposed algorthm for load balancng s presented n fgure 3.3. A fxed number of tasks, each havng a task number and a sze, s randomly generated and placed n a central task pool from whch tasks are assgned to dfferent computng nodes (processors). As load balancng s performed by the centralzed GA-based method, the frst thng to do s to ntalze a populaton of possble solutons [11, 12]. Ths can be acheved usng the sldng wndow technque. The wndow sze s fxed, wth the number of elements n each strng equal to the sze of the wndow. As load-balancng s performed by the centralzed GAbased method, the frst thng to do s to ntalze a populaton of possble solutons. Every tme when a ob arrved at queue of unscheduled tasks (task pool), the ob s scheduled by usng LERT-MW method and placed n correspondng queue. After a nterval of tme we wll apply GA and apply the obs to the correspondng processors. If we apply GA at every arrval of task the overhead wll be more. So that we applyng GA after a random nterval of tme. Now the obs n the correspondng queues wll be appeared as a two dmensonal array, to facltate the cross over operaton the task wth sze s represented as one dmensonal array. The ntal populaton s created by swappng the tasks order randomly for some fxed number of tmes. Here we are generatng 6 populatons for our problem. After generatng the populaton we have to perform the selecton operaton. Ths operaton can be performed by usng ftness functon.. ALGORITHM: GA_Loadbalancng [1] Intalzaton() [2] Load chekng() [3] Repeat through step 6 untl task queue s empty. [4] Strng_evaluaton() [5] Genetc_operaton a. Mutaton() b. Reproducton() c. Crossover() [6] request_message_evaluaton() [7] End Fgure 3.3: Genetc algorthm framework for load balancng An obectve functon s the most mportant component of any optmzaton method, ncludng a GA, as t s used to evaluate the qualty of the solutons. The obectve functon here s to arrve at task assgnments that wll acheve mnmum executon tme, maxmum processor utlzaton, and a well-balanced load across all processors. Then, the obectve functon s ncorporated nto the ftness functon of the GA. Ths ftness functon wll then be used to measure the performance of the strngs n relaton to the obectves of the algorthm. The frst obectve functon for the proposed algorthm s the makespan as descrbed n secton 2.2. Consderng the fact that a computng node M may not always be dle, The total task completon tme can be expressed as sum of current load of M (CL ) and new load of M (NL ). T = CL + NL For smplcty the computng nodes are referred as sngle processor, however a sngle node may have more than one processor as dedcated computng unt. We have use average node (processor) utlzaton as one of metrc to study the performance of load balancng algorthm. As hgh average processor utlzaton mples that the load s well balanced across all nodes(processors). By keepng the processors hghly utlzed, the total executon tme should be reduced. The expected utlzaton of each processor based on the gven task assgnment must be calculated. Ths s acheved by dvdng the task completon tmes of each processor by the makespan value. The utlzaton of the ndvdual processors ( UM ) can be gven by: UM = T makespan The overall task assgnment beng evaluated may have a small makespan and hgh average processor utlzaton.. However, assgnng these tasks to the processors may stll overload some of the processors. Therefore, the thrd obectve s to optmze the number of acceptable node queues. Each node queue s checked ndvdually to see f assgnng all the tasks on the node queues wll overload or under-load the processors. Whether a processor queue s acceptable or not s determned by the lght and heavy thresholds used [12]. Low Threshold: Average Load * 0.8 Hgh Threshold: Average Load * 1.2 To facltate the desgn of genetc algorthm for load balancng, the three obectves dscussed above are ncorporated nto a sngle ftness functon and gven by the followng equaton:

6 Ftness = 1 UM acceptable_ queue_ sze makespan m m The ftness functon s used to evaluate the qualty of the task assgnments usng strng_evaluaton() as shown n fgure 3.3. Instead of watng for the GA to converge, t wll be allowed to run for a fxed number of k cycles (k=10 n ths paper). The decson was made because solutons generated n less than k generatons may not be good enough. On the other hand, runnng the GA for more than k generatons may not be very feasble, as too much tme wll be devoted to genetc operatons. When the GA s termnated after k cycles, the fttest strng n the pool wll be decoded and used as the task schedule. We have analyzed the centralzed dynamc loadbalncng mechansm usng a dscrete event smulator developed by us usng Matlab Performance analyss The followng results summarze the overall model performance. Here we are smulatng the model by usng the metrcs lke throughput, number tasks watng n the queue wth n nterval. We have used the M/M/m/K/n queung model for the smulaton. From the results n fgure: 4.1, t concludes that the LERT-MWM wth executon tmes method s best when compared to LERT-MW whch s not havng the pror nformaton about the executon tme of the obs. So f we know the executon tmes of all the obs we can effectvely dstrbute the load that can be showed n fgure 4.1. Fgure 4.1: Comparson of LERT-MWM and LERT- MW wth and wth out knowng the executon tmes. 4.1 Changng the Number of Tasks: Default values were used for all the parameters except for the number of tasks to be assgned. The number of tasks was vared from and the effects on the total completon tme and throughput are gven below. The Fgure: 4.2 show that the total tme taken for all three algorthms ncreased lnearly as the number of tasks was ncreased. It was also noted that the GA performed better among the three algorthms. When comparng the results of the GA and the LERT-MWM algorthm, one can observe that the gap between these two curves was wdenng as the number of tasks was ncreased. Ths shows that the GA actually reduced the total completon tme by a consderable amount (greater speedup) n comparson to the LERT- MWM algorthm as the number of tasks ncreased. Ths also ndcates relable performance of the GA_loadbalancng when the number of tasks ncreases. Agan we compared our GA wth another GA technque usng normal schedulng, means assgnng obs sequentally(frst Come Frst Serve) to the processors one by one. For all the cases the proposed GA shows better performance. The next experment compares the LERT-MWM and Genetc Algorthm usng the LERT-MW method n schedulng phase. These comparsons are shown n the below Fgures 4.2 and 4.3. The test runs were based on a set of default values: number of teratons: 500, number of processors: 50, number of generaton cycles: 3, populaton sze: 6, maxmum sze of each task: 100, Hgh Threshold multpler: 1.2, and Low Threshold multpler: 0.8. The performance comparsons were done n two types. Fgure 4.2: Comparson of GA, Wth Normal Schedulng and LART-MWM by Fxng the Number of Processors. 4.2 Changng the Number of processors: Here we have studed the performance of load balancng algorthms aganst the scalablty of computng nodes (processors). In smulaton the number of processors was vared from and the effects on the total completon tme and throughput are shown n fgure 4.3.

7 [4] Gamal Attya & Yskandar Hamam, Two phase algorthm for load balancng n heterogeneous dstrbuted systems, Proc. 12th IEEE EUROMICRO conference on Parallel, Dstrbuted and Network-based processng, Coruna, Span 2004, [5] Jon Klenberg & Eva Tardos, Algorthm Desgn (Pearson Educaton Inc. 2006). [6] Helen D. Karatza, & Ralph C. Hlzer, Load sharng n heterogeneous dstrbuted systems, Proceedngs of the Wnter Smulaton Conference, 1, San Dego Calforna, 2002 Page(s): 2002, Fgure 4.3: Comparson of GA, GA wth Normal Schedulng and LART-MWM by Fxng the Number of Tme Unts The total obs completed wth n an nterval by varyng the total number of processors ncreased lnearly frst and after that t stablzes at some pont. In most cases, the GA out performed the other two algorthms n terms of processor utlzaton. Hence f we know the executon tmes of the obs we can effectvely balance the loads among all the nodes. 5 Conclusons Ths paper studes performance of genetc algorthm based approach to solve dynamc load balancng n heterogeneous computng system. Smulaton results ndcate that the performance of best method depends on system load. We analyzed the system performance and scalablty of computng nodes wth load balancng. The smulaton result shows GA based algorthm works better when the numbers of tasks are large. As dstrbuted systems contnue to grow n scale, n heterogenety, and n dverse networkng technology, they are presentng challenges that need to be addressed to meet the ncreasng demands of better performance and servces for varous dstrbuted applcaton. 6 References [1] Svarama P. Dandamud, Senstvty evaluaton of dynamc load sharng n dstrbuted systems, IEEE Concurrency,6(3), 1998, [2] Je L, & Hsao Kameda, Load balancng problems for multclass obs n dstrbuted/parallel computer systems, IEEE Transactons on Computers, 47(3), 1998, [7] Je Wu, Dstrbuted system desgn,(crc press, 1999) [8] Y.Zhang, H.Kameda & S.L.Hung, Comparson of dynamc and statc load-balancng strateges n heterogeneous dstrbuted systems, IEE proceedngs n Computer and Dgtal Technques,144(2), 1997, [9] Bora Ucar, Cevdet Aykanat, Kamer Kaya, & Murat Iknc, Task assgnment n heterogeneous computng system, Journal of parallel and Dstrbuted Computng, 66, 2006, [10] Marta Beltran, Antono Guzman, & Jose Lus Bosque, Dealng wth heterogenety n load balancng algorthm, Proc. 5 th IEEE Internatonal Symposum on Parallel and Dstrbuted Computng, Tmsoara, Romana, 2006, [11] A. Y. Zomaya, C. Ward, & B. Macey, Genetc Schedulng for Parallel Processor Systems: Comparatve Studes and Performance Issues, IEEE Transacton Parallel and Dstrbuted Systems, 10(8), 1999, [12] A. Y. Zomaya, & Y. H. Teh, Observatons on usng genetc algorthms for dynamc load-balancng, IEEE Transactons on Parallel and Dstrbuted Systems, 12(9), 2001, [13] B. A. Shraz, A. R. Hurson, & K. M. Kav, Schedulng and load balancng n parallel and dstrbuted systems, CS press, [14] K. S. Trved, Probablty and statstcs wth relablty, queung and computer scence applcatons, Prentce Hall of Inda, [3] Veeravall Bharadwa, Debassh Ghose, Venkataraman Man, & Thomas G. Robertazz, Schedulng Dvsble Loads n Parallel and Dstrbuted Systems (Wley-IEEE Computer Socety Press, 1996).

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION 24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,

More information

Distributed Resource Scheduling in Grid Computing Using Fuzzy Approach

Distributed Resource Scheduling in Grid Computing Using Fuzzy Approach Dstrbuted Resource Schedulng n Grd Computng Usng Fuzzy Approach Shahram Amn, Mohammad Ahmad Computer Engneerng Department Islamc Azad Unversty branch Mahallat, Iran Islamc Azad Unversty branch khomen,

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING

A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING M. Nkravan and M. H. Kashan Department of Electrcal Computer Islamc Azad Unversty, Shahrar Shahreqods

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A 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 information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem 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 information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler 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 information

Cluster Analysis of Electrical Behavior

Cluster 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 information

Efficient Distributed File System (EDFS)

Efficient 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 information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism 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 information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

A Binarization Algorithm specialized on Document Images and Photos

A 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 information

Load Balancing for Hex-Cell Interconnection Network

Load 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 information

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling , pp.40-45 http://dx.do.org/10.14257/astl.2017.143.08 Applcaton of Improved Fsh Swarm Algorthm n Cloud Computng Resource Schedulng Yu Lu, Fangtao Lu School of Informaton Engneerng, Chongqng Vocatonal Insttute

More information

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,

More information

An Optimal Algorithm for Prufer Codes *

An 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 information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An 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 information

Wishing you all a Total Quality New Year!

Wishing 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 information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Routing in Degree-constrained FSO Mesh Networks

Routing 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 information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A 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 information

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research

Scheduling 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 information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual 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 information

Concurrent Apriori Data Mining Algorithms

Concurrent Apriori Data Mining Algorithms Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course 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 information

Real-Time Guarantees. Traffic Characteristics. Flow Control

Real-Time Guarantees. Traffic Characteristics. Flow Control Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Real-time Fault-tolerant Scheduling Algorithm for Distributed Computing Systems

Real-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 information

Cost-efficient deployment of distributed software services

Cost-efficient deployment of distributed software services 1/30 Cost-effcent deployment of dstrbuted software servces csorba@tem.ntnu.no 2/30 Short ntroducton & contents Cost-effcent deployment of dstrbuted software servces Cost functons Bo-nspred decentralzed

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

ARTICLE IN PRESS. Signal Processing: Image Communication

ARTICLE IN PRESS. Signal Processing: Image Communication Sgnal Processng: Image Communcaton 23 (2008) 754 768 Contents lsts avalable at ScenceDrect Sgnal Processng: Image Communcaton journal homepage: www.elsever.com/locate/mage Dstrbuted meda rate allocaton

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning 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 information

An Adaptive Virtual Machine Location Selection Mechanism in Distributed Cloud

An Adaptive Virtual Machine Location Selection Mechanism in Distributed Cloud KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS VOL. 9, NO. 12, Dec. 2015 4776 Copyrght c2015 KSII An Adaptve Vrtual Machne Locaton Selecton Mechansm n Dstrbuted Cloud Shukun Lu 1, Wea Ja 2 1 School

More information

An Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem

An Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem An Effcent Genetc Algorthm wth Fuzzy c-means Clusterng for Travelng Salesman Problem Jong-Won Yoon and Sung-Bae Cho Dept. of Computer Scence Yonse Unversty Seoul, Korea jwyoon@sclab.yonse.ac.r, sbcho@cs.yonse.ac.r

More information

Reliable and Efficient Routing Using Adaptive Genetic Algorithm in Packet Switched Networks

Reliable and Efficient Routing Using Adaptive Genetic Algorithm in Packet Switched Networks IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 1, No 3, January 2012 ISSN (Onlne): 1694-0814 www.ijcsi.org 168 Relable and Effcent Routng Usng Adaptve Genetc Algorthm n Packet Swtched

More information

Evaluation of Parallel Processing Systems through Queuing Model

Evaluation of Parallel Processing Systems through Queuing Model ISSN 2278-309 Vkas Shnde, Internatonal Journal of Advanced Volume Trends 4, n Computer No.2, March Scence - and Aprl Engneerng, 205 4(2), March - Aprl 205, 36-43 Internatonal Journal of Advanced Trends

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

A Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics

A Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics A Hybrd Genetc Algorthm for Routng Optmzaton n IP Networks Utlzng Bandwdth and Delay Metrcs Anton Redl Insttute of Communcaton Networks, Munch Unversty of Technology, Arcsstr. 21, 80290 Munch, Germany

More information

A Novel Fault Tolerant Scheduling Technique In Real-Time Heterogeneous Distributed Systems Using Distributed Recovery Block

A 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 information

Multi-objective Design Optimization of MCM Placement

Multi-objective Design Optimization of MCM Placement Proceedngs of the 5th WSEAS Int. Conf. on Instrumentaton, Measurement, Crcuts and Systems, Hangzhou, Chna, Aprl 6-8, 26 (pp56-6) Mult-objectve Desgn Optmzaton of MCM Placement Chng-Ma Ko ab, Yu-Jung Huang

More information

Motivation. EE 457 Unit 4. Throughput vs. Latency. Performance Depends on View Point?! Computer System Performance. An individual user wants to:

Motivation. EE 457 Unit 4. Throughput vs. Latency. Performance Depends on View Point?! Computer System Performance. An individual user wants to: 4.1 4.2 Motvaton EE 457 Unt 4 Computer System Performance An ndvdual user wants to: Mnmze sngle program executon tme A datacenter owner wants to: Maxmze number of Mnmze ( ) http://e-tellgentnternetmarketng.com/webste/frustrated-computer-user-2/

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The 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 information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

EVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS

EVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS Academc Research Internatonal ISS-L: 3-9553, ISS: 3-9944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A 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 information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

An Investigation into Server Parameter Selection for Hierarchical Fixed Priority Pre-emptive Systems

An 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 information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content 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 information

Video Proxy System for a Large-scale VOD System (DINA)

Video 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 information

The Codesign Challenge

The 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 information

Use of Genetic Algorithms in Efficient Scheduling for Multi Service Classes

Use of Genetic Algorithms in Efficient Scheduling for Multi Service Classes Use of Genetc Algorthms n Effcent Schedulng for Mult Servce Classes Shyamale Thlakawardana and Rahm Tafazoll Centre for Communcatons Systems Research (CCSR), Unversty of Surrey, Guldford, GU27XH, UK Abstract

More information

Obstacle-Aware Routing Problem in. a Rectangular Mesh Network

Obstacle-Aware Routing Problem in. a Rectangular Mesh Network Appled Mathematcal Scences, Vol. 9, 015, no. 14, 653-663 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.1988/ams.015.411911 Obstacle-Aware Routng Problem n a Rectangular Mesh Network Norazah Adzhar Department

More information

A MapReduce-supported Data Center Networking Topology

A MapReduce-supported Data Center Networking Topology A MapReduce-supported Data Center Networkng Topology Zelu Dng*,, Xue Lu, Deke Guo*, Honghu Chen*, Xueshan Luo* * Natonal Unversty of Defense Technology, Chna McGll Unversty, Canada Abstract Several novel

More information

Classifier Selection Based on Data Complexity Measures *

Classifier 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 information

Hybrid Job Scheduling Mechanism Using a Backfill-based Multi-queue Strategy in Distributed Grid Computing

Hybrid Job Scheduling Mechanism Using a Backfill-based Multi-queue Strategy in Distributed Grid Computing IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.12 No.9, September 2012 39 Hybrd Job Schedulng Mechansm Usng a Backfll-based Mult-queue Strategy n Dstrbuted Grd Computng Ken Park

More information

Optimized Resource Scheduling Using Classification and Regression Tree and Modified Bacterial Foraging Optimization Algorithm

Optimized Resource Scheduling Using Classification and Regression Tree and Modified Bacterial Foraging Optimization Algorithm World Engneerng & Appled Scences Journal 7 (1): 10-17, 2016 ISSN 2079-2204 IDOSI Publcatons, 2016 DOI: 10.5829/dos.weasj.2016.7.1.22540 Optmzed Resource Schedulng Usng Classfcaton and Regresson Tree and

More information

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks 2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng

More information

Fibre-Optic AWG-based Real-Time Networks

Fibre-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 information

GA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks

GA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks Seventh Internatonal Conference on Intellgent Systems Desgn and Applcatons GA-Based Learnng Algorthms to Identfy Fuzzy Rules for Fuzzy Neural Networks K Almejall, K Dahal, Member IEEE, and A Hossan, Member

More information

Scheduling Independent Tasks in Heterogeneous Environments under Communication Constraints

Scheduling Independent Tasks in Heterogeneous Environments under Communication Constraints Schedulng Independent Tasks n Heterogeneous Envronments under Communcaton Constrants Petros Lampsas 1 Thanass Loukopoulos 2 Fedon Dmopoulos 1 Marouso Athanasou 1 1 Department of Informatcs and Computer

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.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 information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

Pricing Network Resources for Adaptive Applications in a Differentiated Services Network

Pricing Network Resources for Adaptive Applications in a Differentiated Services Network IEEE INFOCOM Prcng Network Resources for Adaptve Applcatons n a Dfferentated Servces Network Xn Wang and Hennng Schulzrnne Columba Unversty Emal: {xnwang, schulzrnne}@cs.columba.edu Abstract The Dfferentated

More information

A Load-balancing and Energy-aware Clustering Algorithm in Wireless Ad-hoc Networks

A 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 information

Maintaining temporal validity of real-time data on non-continuously executing resources

Maintaining temporal validity of real-time data on non-continuously executing resources 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

More information

Imperialist Competitive Algorithm with Variable Parameters to Determine the Global Minimum of Functions with Several Arguments

Imperialist Competitive Algorithm with Variable Parameters to Determine the Global Minimum of Functions with Several Arguments Fourth Internatonal Conference Modellng and Development of Intellgent Systems October 8 - November, 05 Lucan Blaga Unversty Sbu - Romana Imperalst Compettve Algorthm wth Varable Parameters to Determne

More information

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems

More information

RAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:

RAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems: Speed/RAP/CODA Presented by Octav Chpara Real-tme Systems Many wreless sensor network applcatons requre real-tme support Survellance and trackng Border patrol Fre fghtng Real-tme systems: Hard real-tme:

More information

A Proactive Non-Cooperative Game-theoretic Framework for Data Replication in Data Grids

A Proactive Non-Cooperative Game-theoretic Framework for Data Replication in Data Grids Eghth IEEE Internatonal Symposum on Cluster Computng and the Grd A Proactve Non-Cooperatve Game-theoretc Framewor for Data Replcaton n Data Grds Al H. Elghran, Student Member, IEEE, Ry Subrata, Member,

More information

Queueing Network-based Optimisation Techniques for Workload Allocation in Clusters of Computers *

Queueing Network-based Optimisation Techniques for Workload Allocation in Clusters of Computers * Queueng Network-based Optmsaton Technques for Workload Allocaton n Clusters of Computers * Lgang He, Stephen A. Jarvs, Davd Bacgalupo, Danel P. Spooner, Xnuo Chen and Graham R. Nudd Department of Computer

More information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-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 information

QoS-aware routing for heterogeneous layered unicast transmissions in wireless mesh networks with cooperative network coding

QoS-aware routing for heterogeneous layered unicast transmissions in wireless mesh networks with cooperative network coding Tarno et al. EURASIP Journal on Wreless Communcatons and Networkng 214, 214:81 http://wcn.euraspournals.com/content/214/1/81 RESEARCH Open Access QoS-aware routng for heterogeneous layered uncast transmssons

More information

Chapter 1. Introduction

Chapter 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 information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A 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 information

Multi-objective Virtual Machine Placement for Load Balancing

Multi-objective Virtual Machine Placement for Load Balancing Mult-obectve Vrtual Machne Placement for Load Balancng Feng FANG and Bn-Bn Qu,a School of Computer Scence & Technology, Huazhong Unversty Of Scence And Technology, Wuhan, Chna Abstract. The vrtual machne

More information

Burst Round Robin as a Proportional-Share Scheduling Algorithm

Burst 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 information

Gateway Algorithm for Fair Bandwidth Sharing

Gateway Algorithm for Fair Bandwidth Sharing Algorm for Far Bandwd Sharng We Y, Rupnder Makkar, Ioanns Lambadars Department of System and Computer Engneerng Carleton Unversty 5 Colonel By Dr., Ottawa, ON KS 5B6, Canada {wy, rup, oanns}@sce.carleton.ca

More information

Module Management Tool in Software Development Organizations

Module 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 information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki 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 information

A Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks

A Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks A Sem-Dstrbuted oad Balancng Archtecture and Algorthm for Heterogeneous reless Networks Md. Golam Rabul Ala Choong Seon Hong * Kyung Hee Unversty, Korea rob@networkng.khu.ac.kr, cshong@khu.ac.kr Abstract

More information

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing 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 information

Channel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7

Channel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7 Optmzed Regonal Cachng for On-Demand Data Delvery Derek L. Eager Mchael C. Ferrs Mary K. Vernon Unversty of Saskatchewan Unversty of Wsconsn Madson Saskatoon, SK Canada S7N 5A9 Madson, WI 5376 eager@cs.usask.ca

More information

Analysis of Particle Swarm Optimization and Genetic Algorithm based on Task Scheduling in Cloud Computing Environment

Analysis of Particle Swarm Optimization and Genetic Algorithm based on Task Scheduling in Cloud Computing Environment Analyss of Partcle Swarm Optmzaton and Genetc Algorthm based on Tas Schedulng n Cloud Computng Envronment Frederc Nzanywayngoma School of Computer and Communcaton Engneerng Unversty of Scence and Technology

More information

A Proximity-aware Load Balancing in Peer-to-Peer based Volunteer Computing Systems

A Proximity-aware Load Balancing in Peer-to-Peer based Volunteer Computing Systems A Promty-aware Load Balancng n Peer-to-Peer based Volunteer Computng ystems Toktam Ghafaran, Hossen Deldar, Bahman Javad 3, Rakumar Buyya Department of Computer Engneerng Ferdows Unversty of Mashhad, ran

More information

Using Particle Swarm Optimization for Enhancing the Hierarchical Cell Relay Routing Protocol

Using Particle Swarm Optimization for Enhancing the Hierarchical Cell Relay Routing Protocol 2012 Thrd Internatonal Conference on Networkng and Computng Usng Partcle Swarm Optmzaton for Enhancng the Herarchcal Cell Relay Routng Protocol Hung-Y Ch Department of Electrcal Engneerng Natonal Sun Yat-Sen

More information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

An efficient iterative source routing algorithm

An 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 information

Needed Information to do Allocation

Needed Information to do Allocation Complexty n the Database Allocaton Desgn Must tae relatonshp between fragments nto account Cost of ntegrty enforcements Constrants on response-tme, storage, and processng capablty Needed Informaton to

More information

AADL : about scheduling analysis

AADL : 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 information

MULTIHOP wireless networks are a paradigm in wireless

MULTIHOP wireless networks are a paradigm in wireless 400 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 17, NO. 1, JANUARY 2018 Toward Optmal Dstrbuted Node Schedulng n a Multhop Wreless Network Through Local Votng Dmtros J. Vergados, Member, IEEE, Natala

More information