Available online at ScienceDirect. Procedia Computer Science 46 (2015 )
|
|
- Gervais Pierce
- 6 years ago
- Views:
Transcription
1 Avalable onlne at ScenceDrect Proceda Computer Scence 46 (2015 ) Internatonal Conference on Informaton and Communcaton Technologes (ICICT 2014) A Novel Famly Genetc Approach for Vrtual Machne Allocaton Chrstna Terese Joseph a,, Chandrasekaran K b, Robn Cyrac a a Department of Computer Scence and Engneerng, Raagr School of Engneerng and Technology, Koch , Kerala, Inda b Department of Computer Scence and Engneerng, Natonal Insttute of Technology, Karnataka, Surathkal , Inda Abstract The concept of vrtualzaton forms the heart of systems lke the Cloud and Grd. Effcency of systems that employ vrtualzaton greatly depends on the effcency of the technque used to allocate the vrtual machnes to sutable hosts. The lterature contans many evolutonary approaches to solve the vrtual machne allocaton problem, a broad category of whch employ Genetc Algorthm. Ths paper proposes a novel technque to allocate vrtual machnes usng the Famly Gene approach. Expermental analyss proves that the proposed approach reduces energy consumpton and the rate of mgratons, and hence offers much scope for future research. c Publshed The Authors. by Elsever Publshed B.V. byths Elsever s an B.V. open access artcle under the CC BY-NC-ND lcense Peer-revew ( under responsblty of organzng commttee of the Internatonal Conference on Informaton and Communcaton Technologes Peer-revew under (ICICT responsblty 2014). of organzng commttee of the Internatonal Conference on Informaton and Communcaton Technologes (ICICT 2014) Keywords: Cloud Computng; Genetc Algorthm; Vrtual machne allocaton; Famly gene; Energy-effcent 1. Introducton The term Cloud Computng s a fuzzy term for whch no concrete defnton exsts. It can be vewed as the delvery of servces over the Internet, as and when the customer demands. The transton of large organzatons from the tradtonal CAPEX model to the OPEX model support the fact that Cloud computng s one of the most promsng technologes n the current IT scenaro. The ncreasng number of users for Cloud Computng ncreases the challenges faced by the Cloud servce provders to provde the requested servces ensurng hgh avalablty and relablty of the servces. The vrtualzaton technque proves functonal n helpng the Cloud servce provders to meet these challenges. In order to employ vrtualzaton, vrtual enttes of the actual versons are created and deployed n the system. Ths technology enables the Cloud servce provder to serve more number of customers than the support provded by the actual hardware resources avalable wth the provder. Generally vrtualzaton s appled at the computer system level. Ths nvolves the creaton and deployment of vrtual machnes. The requests of the customers wll then be processed by these Vrtual Machnes (VMs). Varous VMs wll have dfferent processng and memory requrements. One of the maor factors that needs to be consdered n systems that deploy VMs s the allocaton of the VMs to hosts. Correspondng author. Tel.: E-mal address: xtna 1232@hotmal.com Publshed by Elsever B.V. Ths s an open access artcle under the CC BY-NC-ND lcense ( Peer-revew under responsblty of organzng commttee of the Internatonal Conference on Informaton and Communcaton Technologes (ICICT 2014) do: /.procs
2 Chrstna Terese Joseph et al. / Proceda Computer Scence 46 ( 2015 ) An mproper allocaton can result to the VMs beng executed on unsutable hosts, whch can then lead to unwarranted effects. Ths would affect the credblty of the Cloud servce provder. In order to avod ths, an effcent scheme should be used to correctly allocate the VMs to the hosts that support ther executon. Ths decson problem s called the VM Allocaton Problem. Varous approaches have been appled to solve the NP-Hard problem of VM allocaton. The VM allocaton problem can be consdered as a mult-obectve constraned optmzaton problem. A large number of approaches appled to solve the VM Allocaton problem employ evolutonary technques ncludng Genetc Algorthm (GA). Some of the lmtatons of the Genetc Algorthm approaches nclude the premature convergence and the hgh processng tme nvolved. Due to premature convergence, many of the Genetc Algorthms converge to a sub-optmal result. These phenomena should be avoded. Another lmtaton s the hgh processng tme. Most of the Genetc Algorthm approaches requre a lot of tme for processng the varous generatons before producng the optmal result. The approach proposed n ths paper attempts to overcome these lmtatons of the Genetc Algorthm approaches to VM Allocaton. In general, the paper ams to: Perform a lterature survey on the varous evolutonary approaches to resource schedulng and allocaton. Propose a novel technque to allocate VMs whch overcomes the lmtatons of the GA-based approaches. Compare the expermental results of the proposed approach wth the results of the exstng approaches. The organzaton of the paper s as follows: Secton 2 gves an outlne of the varous evolutonary approaches used to solve resource schedulng problems n envronments that employ vrtualzaton. Secton 3 defnes the problem. Secton 4 gves the detals of the proposed system. Secton 5 presents the expermental analyss and results and the paper s concluded n Secton Related Works Barbagallo et al. propose a bo-nspred technque that ams at reducng the energy consumpton n data centers through redstrbuton of load among the servers 1. Accordng to the authors, the proposed algorthm can be effcently employed n self-organzng systems. H.Chen et al. propose a method nspred by the foragng behavour of ants, whch globally allocates resources n Cloud 2. An mproved verson of the ant colony optmzaton algorthm that adopts the characterstcs of greedy algorthms as well s presented. The proposed algorthm attans load balancng and mproved schedulng tme. The task schedulng n Cloud s reduced to an optmal matchng problem wth multple obectves by usng a bpartte graph model to represent the tasks. The resource allocaton problem that consders the dependency among VMs as well as the utlzaton of the lnks of the network s consdered by C. Wang et al 3. The authors consder the scenaro where the requests for resources are not ndependent. The proposed algorthm adopts the characterstcs of PSO. A sngle resource request s represented usng an entty called Vrtual Cloud Embeddng (VCE). Dong et al. propose a genetc algorthm approach that works n a dstrbuted manner to place VMs 4. The proposed approach may be used by IaaS Cloud provders to reduce the energy consumpton and thus mprove the effcency. The optmzaton technque- Ant Colony Optmzaton (ACO) may be used to effectvely consoldate VMs n a data center 5. The performance of such algorthm can be enhanced by ncorporatng a dstrbuted and parallel nature. The parallel nature also mproves the scalablty of the algorthm. E. Feller et al. propose a decentralzed schema and propose the use of the ACO-based approach to mprove the effcency of VM consoldaton by reducng the number of mgratons that have to be carred out 6. An approach to consoldate VMs usng ACO to maxmze resource utlzaton and reduce energy consumpton s proposed by Ferdaus et al 7. A Genetc algorthm approach s proposed by Paolo et al. to allocate VMs n dstrbuted systems wth more than one ters 8. A varaton of the Genetc Algorthm called Improved Genetc Algorthm (IGA) s proposed by Zhong et al. to allocate VMs n data centers of IaaS cloud servce provders 9. The Reorderng Groupng Genetc Algorthm Approach (RGGA) was proposed to solve the multdmensonal bnpackng problem of VM allocaton by Wlcox et al. 10 Load balancng and hstory nformaton was also consdered n the Genetc Algorthm approach to allocate VMs by Band et al. 11. The dea of Pareto domnance and smulated annealng are combned to solve the mult-obectve problem of VM allocaton wth the obectves of load balancng and power savng n MOGA-LS 12. The energy consumpton due to communcaton wthn the data center network s one of the parameters consdered n the approach usng Genetc Algorthm to place
3 560 Chrstna Terese Joseph et al. / Proceda Computer Scence 46 ( 2015 ) VMs by Grant et al. 13 An extenson to ths work uses a reparng procedure 14. A Hybrd Genetc Algorthm approach s used to effcently allocate VMs by Tang et al. 15. A maor class of the bo-nspred methods for VM placement employs Genetc Algorthm. The proposed approach uses a varaton of the Genetc Algorthm approach, called Famly Genetc Algorthm (FGA), whch tres to overcome the lmtatons of the Genetc Algorthm approaches. 3. Problem Defnton The VM Placement problem s a mult-obectve optmzaton problem. Our am s to fnd an optmal placement, whch s a mappng from VMs to hosts. Consder a system wth m host machnes and n VMs. Each VM s represented as v and each host s represented as p. We have a sngle decson varable for the problem denoted by y. The value of ths decson varable s 1 when the th VM s allocated to the th host machne and 0 otherwse. The set of all hosts and all VMs n the system are represented by P and V respectvely. In our system, each host machne can be represented by the vector: p = (d, cpu, mem, bw ) (1) where d provdes an dentfcaton number for the host, cpu gves the processng power of the host, mem gves the amount of memory the host has and bw gves the amount of the bandwdth that the host supports. Each VM s also represented by a smlar vector, gven by: v = (d, cpu, mem, bw ) (2) where d gves the dentfcaton of the VM, cpu gves the processng power requred by the VM, mem gves the amount of memory requested by the VM and bw gves the amount of bandwdth requested by the VM. The problem can be formally defned as follows: Fnd a mappng from the set of VMs, V, to the set of PMs, P, such that the physcal resource utlzaton s maxmzed. In the envronment consdered, the obectve of maxmzng physcal resource utlzaton can be decomposed nto three obectves: Maxmze v cpu p cpu, vmem p mem subect to the constrants m y = 1 =1 n =1 n =1 n =1 y v cpu y v mem y v bw p cpu p mem p bw, vbw p bw The constrants ensure that each VM s allocated to only one host, though one host may be mapped to more than one VMs. They also ensure that the load on each host machne s not greater than ts capacty. We can also defne upper and lower thresholds for the utlzaton on a host. The utlzaton of th host machne by th VM can be gven as: p () u = v cpu p cpu vmem p mem p bw 100, f y = 1 0, otherwse vbw The total utlzaton of host can then be calculated as p u = n =1 p () u (3) (4) (5) (6)
4 Chrstna Terese Joseph et al. / Proceda Computer Scence 46 ( 2015 ) Fg. 1. Archtecture of the proposed system ntegrated nto CloudSm. 4. Proposed System The archtecture of the proposed system s as shown n Fg. 1. The Famly Genetc Algorthm (FGA) module s ntegrated nto CloudSm. In CloudSm, we have Data centers that comprse of hosts. Each of the hosts has one or more Processng Elements (PE). On these hosts, we have varous VMs runnng. These VMs have one or more cloudlets runnng on them. In CloudSm, user obs are drectly represented as Cloudlets. The cloudlets have varous requrements. The processng power requrement of each Cloudlet s represented usng Mllon Instructons Per Second (MIPS). In the proposed archtecture, the FGA module takes the host lst and the VM lst and produces an optmal mappng. The FGA module dvdes the entre processng among the varous famles that run n parallel n the module. The Famly Genetc Algorthm (FGA) attempts to overcome the lmtatons of the Genetc Algorthm approaches. Accordng to Jan et al. 16, the maor contrbutng factor towards premature convergence s the mutaton operator. The authors attempt to reduce the chances of premature convergence by usng a self-adustng mutaton operator. Generally, n GA approaches, the mutaton rate, that s, the probablty of mutaton s statc. The value of ths parameter of GA s defned at the begnnng of the GA and remans constant throughout. As a varaton to ths tradtonal GA, Jan et al. vary the rate of mutaton. Thus here, the mutaton probablty s dynamc. It s defned to be dependent on a parameter called populaton dfferenta. Populaton dfferenta s a rato that s used to ndcate the rate at whch the dfferent ndvduals dffer from each other. Ths parameter gudes the probablty of mutaton. The use of ths self-adustng probablty of mutaton ensures that no premature convergence takes place. In ther approach the degree at whch 2 ndvduals, say A and B dffer from each other s gven by: l 1 d (A, B) = A B =0 where l gves the length o f the chromosome. Thus, the total rate at whch each of the ndvduals dffer from the rest of the populaton can be defned as: Populaton d f f erenta = N =0 where N s the populaton sze. N =0 d(a, B k ) (N 1) (N 1) l 100 The outlne of the Famly Gene Algorthm s descrbed n Algorthm 1. The basc dea n FGA s that we dvde the entre populaton nto famles. In tradtonal GA, we take an entre populaton. The varous operators of GA, selecton, (7) (8)
5 562 Chrstna Terese Joseph et al. / Proceda Computer Scence 46 ( 2015 ) crossover and mutaton are appled at once to the entre populaton across all the generatons. Researchers have proved that these steps are the most tme-consumng steps n GA. In FGA, by dvdng the populaton nto famles and then processng each of these famles n parallel, we attempt to enhance the speed of GA. When employed n a dstrbuted parallel system, the processng of each famly may be carred out n parallel, thus greatly reducng the total runtme. Ths approach was frst proposed by Janhua et al 17. In ther approach the famles were constructed consderng the neghbourng solutons. Our problem of VM allocaton does not defne such neghbours. So here, n order to construct the famles, we perform smple mutatons. The resultng chromosomes whch vary, though only slghtly, from each other, are placed n the same famly. The processng tme s further reduced by destroyng the famles whch do not offer any hope of obtanng better ndvduals. Each famly s processed k tmes. If no better ndvdual has been encountered tll then, we destroy the famly and take the next famly. If atleast one better ndvdual has been generated from the processng of the current famly, then we contnue processng the famly for W teratons. The values of k and W are determned through expermental evaluatons. For each ndvdual n the populaton, we assess the qualty of the ndvdual by calculatng the ftness value assocated wth t. In GA, the ftness value s generally a functon of the obectves that we take nto consderaton. In the proposed approach, the obectve that we take nto consderaton s the physcal resource utlzaton. The algorthm that we used to calculate the ftness value of each ndvdual s outlned n Algorthm 2. An addtonal precauton has to be taken whle employng famly gene approach to the VM allocaton problem. It should be ensured that all the chromosomes satsfy the constrants. To ensure ths, we mplement a separate functon where each ndvdual s checked for feasblty. In case the ndvdual s found to be nfeasble, an attempt s made to transform the nfeasble soluton nto a feasble one. Algorthm 3 takes as nput an ndvdual and returns a chromosome representng a feasble assgnment. Algorthm 1 Outlne of the Famly Gene algorthm Input: Lsts of hosts and VMs Intalze the lst of hosts and Vms. Intalze the values of parameters of GA and the number of famles to be constructed. Randomly ntalze the populaton. Compute the ftness values of each chromosome n the populaton. Calculate the populaton dfferenta. Perform crossover and mutaton. Select the famly heads as the best ndvduals from the current populaton. for all Famly Populaton do repeat Perform mutaton on the famly head and nsert mutated chromosome nto famly. Compute the ftness value of the chromosome obtaned after mutaton. f ftness of the mutated chromosome s greater then add the mutated chromosome to the populaton. Set flag as true end f untl famly sze repeat Perform crossover and mutaton on the current famly to get the next generaton of the current famly. untl k tmes f flag=true else W tmes f flag=false Select the fttest ndvdual from the populaton to get the best soluton. 5. Expermental Analyss and Results The expermental analyss was done usng the CloudSm toolkt, whch was developed by Rakumar Buyya et al. 18 Ths s an open source tool used by maorty of the researchers to smulate the Cloud envronment. The toolkt
6 Chrstna Terese Joseph et al. / Proceda Computer Scence 46 ( 2015 ) Algorthm 2 Calculaton of the ftness value of each chromosome Input: Chromosome Output: Ftness of the chromosome for all p P do Intalze utlzaton values for all v V do f VM s assgned to current host then Update the utlzaton values end f return vcpu p cpu vmem p mem vbw p bw Algorthm 3 Check the feasblty of an ndvdual Input: Chromosome Output: FeasbleS oluton Intalze lst o f f ree hosts to contan all hosts Intalze the capactes and the number o f pes for all v ɛv do Remove from free host the host assgned n chromosome. for all p ɛp do for all v ɛv do f v s assgned to p then Calculate the utlzaton. Update the remanng capacty of the host end f f the host s overutlzed then Assgn any non-free host that can accept the VM. f no allocated hosts can accept the VM then Assgn a sutable host from the free hosts. Update the capactes of the assgned host. end f end f Update the chromosome wth the new assgnments. return Updated chromosome provdes smple allocaton polces and 6 power-aware allocaton polces. The proposed allocaton polcy usng FGA was mplemented, run and compared wth the exstng polces. Fg. 2(a). shows the placement of hosts by the default allocaton polcy n CloudSm. Fg. 2(b). gves the placement that results from usng the proposed approach. Whle allocatng VMs usng the proposed approach the number of hosts n use s reduced. The proposed approach performs the allocaton usng ust the hosts that are requred to satsfy the VM requrements. The remanng hosts whch are not mapped to any VM may be swtched off to further reduce energy consumpton. An mportant parameter that characterzes the performance of an allocaton polcy s the energy consumpton. There s a growng concern nowadays for the ncreasng power consumpton of data centers. Nevertheless, an allocaton polcy that reduces energy consumpton s much more favourable. For our analyss, we allocate varyng number of VMs usng the proposed approach and the exstng approaches. On analyss, t s found
7 564 Chrstna Terese Joseph et al. / Proceda Computer Scence 46 ( 2015 ) (a) (b) Fg. 2. (a) the no. of VMs on each host n the ntal placement; (b) the number of VMs on each host n the placement by the proposed approach. (a) (b) Fg. 3. (a) the energy consumpton; (b) the number of VM mgratons; (c) the SLA tme per actve host for the exstng and proposed approaches. that the energy consumpton s greatly reduced by allocatng VMs usng the proposed approach. Fg. 3(a). supports ths observaton. For any allocaton polcy, f the resultng allocaton s unable to meet any of the resource requrements, the VMs have to be mgrated from the allocated host to some other sutable host. The mgraton of VMs ncurs an overhead on the system. So, an allocaton polcy that keeps the number of VM mgratons at a mnmum s preferred.
8 Chrstna Terese Joseph et al. / Proceda Computer Scence 46 ( 2015 ) Fg. 3(b). compares the number of mgratons for varous approaches for varyng number of VMs. It can be observed that the number of mgratons s lesser for the proposed approach. When users submt obs to be executed n the Cloud envronment, they specfy certan condtons that should be met by the Cloud servce provder. Ths set of user requrements s called the Servce Level Agreement (SLA). The maor obectve of the Cloud servce provder should be to attan a hgher level of SLA. A parameter related to SLA that depends on the allocaton polcy used s the SLA tme per host. Ths parameter gves the tme n percentage where each host follows the SLA. Fg. 3(c). shows that the SLA tme per actve host s greater for the proposed approach, ensurng a hgher SLA level n the proposed approach. In summary, t can be observed that the proposed approach reduces energy consumpton and the number of VM mgratons and ncreases the SLA level, whle keepng the number of actve hosts at a mnmal level. 6. Concluson The problem of VM Allocaton s one of the most mportant decson problems present n all systems that nvolve vrtualzaton, such as, Clouds and Grds. The paper proposes an approach to enhance the effcency of the tradtonal GA approaches to VM allocaton. It has been seen that the energy consumpton has been greatly reduced. The number of VM mgratons s also reduced, whle at the same tme ncreasng the SLA tme per host. The promsng results obtaned from the proposed approach show that the famly genetc algorthm may be employed effcently n real data centers. As the energy consumpton s reduced, t can also be used n green data centers. Though the proposed approach has been tested n the Cloud smulaton envronment, ths approach may be extended to any of the other systems that nvolve vrtualzaton. References 1. Barbagallo, D., D Ntto, E., Dubos, D.J., Mrandola, R.. A bo-nspred algorthm for energy optmzaton n a self-organzng data center. In: Self-Organzng Archtectures. Sprnger; 2010, p Hongwe Chen Le Xong, C.W.. Cloud task schedulng smulaton va mproved ant colony optmzaton algorthm. Journal of Convergence Informaton Technology(JCIT) 2013;8. 3. Wang, C., Wu, Q., Tan, Y., Guo, D., Wu, Q.. Vce-pso: Vrtual cloud embeddng through a meta-heurstc approach. In: Hgh Performance Computng and Communcatons & 2013 IEEE Internatonal Conference on Embedded and Ubqutous Computng (HPCC EUC), 2013 IEEE 10th Internatonal Conference on. IEEE; 2013, p Dong, Y.S., Xu, G.C., Fu, X.D.. A dstrbuted parallel genetc algorthm of placement strategy for vrtual machnes deployment on cloud platform. The Scentfc World Journal 2014;2. 5. Esnault, A., Feller, E., Morn, C.. Energy-aware dstrbuted ant colony based vrtual machne consoldaton n aas clouds bblographc study. Informatcs Mathematcs (INRIA) 2012;: Feller, E., Morn, C., Esnault, A., et al. A case for fully decentralzed dynamc vm consoldaton n clouds 2012;: Ferdaus, M.H., Murshed, M., Calheros, R.N., Buyya, R.. Vrtual machne consoldaton n cloud data centers usng aco metaheurstc. In: Euro-Par 2014 Parallel Processng. Sprnger; 2014, p Campegan, P.. A genetc algorthm to solve the vrtual machnes resources allocaton problem n mult-ter dstrbuted systems. In: Second Internatonal Workshop on Vrtualzaton Performance: Analyss, Characterzaton, and Tools (VPACT 2009), Boston, Massachusett. 2009,. 9. Zhong, H., Tao, K., Zhang, X.. An approach to optmzed resource schedulng algorthm for open-source cloud systems. In: ChnaGrd Conference (ChnaGrd), 2010 Ffth Annual. IEEE; 2010, p Wlcox, D., McNabb, A., Sepp, K.. Solvng vrtual machne packng wth a reorderng groupng genetc algorthm. In: Evolutonary Computaton (CEC), 2011 IEEE Congress on. IEEE; 2011, p Madhusudhan, B., Sekaran, K.C.. A genetc algorthm approach for vrtual machne placement n cloud 2013;. 12. Zhao, J., Dng, Y., Xu, G., Hu, L., Dong, Y., Fu, X.. A locaton selecton polcy of lve vrtual machne mgraton for power savng and load balancng. The Scentfc World Journal 2013;. 13. Wu, G., Tang, M., Tan, Y.C., L, W.. Energy-effcent vrtual machne placement n data centers by genetc algorthm. In: Neural Informaton Processng. Sprnger; 2012, p Quang-Hung, N., Nen, P.D., Nam, N.H., Tuong, N.H., Thoa, N.. A genetc algorthm for power-aware vrtual machne allocaton n prvate cloud. In: Informaton and Communcaton Technology. Sprnger; 2013, p Tang, M., Pan, S.. A hybrd genetc algorthm for the energy-effcent vrtual machne placement problem n data centers. Neural Processng Letters 2014;: Jan, Z., Wang, S.. Study on self-adustng of gene mgraton genetc algorthm. Journal of X an Jaotong Unversty 2002; Janhua, L., Xangqan, D., Sun an, W., Qng, Y.. Famly genetc algorthms based on gene exchange and ts applcaton. Systems Engneerng and Electroncs, Journal of 2006;17(4): Calheros, R.N., Ranan, R., Beloglazov, A., De Rose, C.A., Buyya, R.. Cloudsm: a toolkt for modelng and smulaton of cloud computng envronments and evaluaton of resource provsonng algorthms. Software: Practce and Experence 2011;41(1):23 50.
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 informationApplication 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 informationMulti-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 informationCHAPTER 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 informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationComparison 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 informationA 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 informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationVirtual 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 informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationA 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 informationCloud testing scheduling based on improved ACO
Internatonal Symposum on Computers & Informatcs (ISCI 2015) Cloud testng schedulng based on mproved ACO Yang Zheng 1,2 a, Lzh Ca *2,3 b, Shdong Huang 4,c, Jawen Lu 1,d and Pan Lu 5,e 1 College of Informaton
More informationOptimized 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 informationMeta-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 informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationCost-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 informationDistributed 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 informationScheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationNUMERICAL 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 informationEnergy Aware Virtual Machine Migration Techniques for Cloud Environment
Energy Aware rtual Machne Mgraton Technques for Cloud Envronment Kamal Gupta Department of CSE MMU, Sadopur jay Katyar, PhD Department of CSE MMU, Mullana ABSTRACT Cloud Computng offers ndspensable nfrastructure
More informationResearch Article Adaptive Cost-Based Task Scheduling in Cloud Environment
Scentfc Programmng Volume 2016, Artcle ID 8239239, 9 pages http://dx.do.org/10.1155/2016/8239239 Research Artcle Adaptve Cost-Based Task Schedulng n Cloud Envronment Mohammed A. S. Mosleh, 1 G. Radhaman,
More informationResource and Virtual Function Status Monitoring in Network Function Virtualization Environment
Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087
More informationA 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 informationAn Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems
S. J and D. Shn: An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems 2355 An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems Seunggu J and Dongkun Shn, Member,
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationLoad-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 informationAn Approach to Optimized Resource Scheduling Algorithm for Open-source Cloud Systems
The Ffth Annual ChnaGrd Conference An Approach to Optmzed Resource Schedulng Algorthm for Open-source Cloud Systems Ha Zhong 1, 2, Kun Tao 1, Xueje Zhang 1, 2 1 School of Informaton Scence and Engneerng,
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationA Genetic Algorithm Based Dynamic Load Balancing Scheme for Heterogeneous Distributed Systems
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 1-60132-084-1
More informationReal-time Fault-tolerant Scheduling Algorithm for Distributed Computing Systems
Real-tme Fault-tolerant Schedulng Algorthm for Dstrbuted Computng Systems Yun Lng, Y Ouyang College of Computer Scence and Informaton Engneerng Zheang Gongshang Unversty Postal code: 310018 P.R.CHINA {ylng,
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationEfficient 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 informationSum 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 informationAn 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 informationDistributed Middlebox Placement Based on Potential Game
Int. J. Communcatons, Network and System Scences, 2017, 10, 264-273 http://www.scrp.org/ournal/cns ISSN Onlne: 1913-3723 ISSN Prnt: 1913-3715 Dstrbuted Mddlebox Placement Based on Potental Game Yongwen
More informationAvailable online at Available online at Advanced in Control Engineering and Information Science
Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced
More informationA Time-driven Data Placement Strategy for a Scientific Workflow Combining Edge Computing and Cloud Computing
> REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) < 1 A Tme-drven Data Placement Strategy for a Scentfc Workflow Combnng Edge Computng and Cloud Computng Bng Ln, Fangnng
More informationData-Aware Scheduling Strategy for Scientific Workflow Applications in IaaS Cloud Computing
Data-Aware Schedulng Strategy for Scentfc Workflow Applcatons n IaaS Cloud Computng Sd Ahmed Makhlouf*, Belabbas Yagoub LIO Laboratory, Department of Computer Scence, Faculty of Exact and Appled Scences,
More informationHybrid 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 informationGame Based Virtual Bandwidth Allocation for Virtual Networks in Data Centers
Avaable onlne at www.scencedrect.com Proceda Engneerng 23 (20) 780 785 Power Electroncs and Engneerng Applcaton, 20 Game Based Vrtual Bandwdth Allocaton for Vrtual Networks n Data Centers Cu-rong Wang,
More informationPARETO BAYESIAN OPTIMIZATION ALGORITHM FOR THE MULTIOBJECTIVE 0/1 KNAPSACK PROBLEM
PARETO BAYESIAN OPTIMIZATION ALGORITHM FOR THE MULTIOBJECTIVE 0/ KNAPSACK PROBLEM Josef Schwarz Jří Očenáše Brno Unversty of Technology Faculty of Engneerng and Computer Scence Department of Computer Scence
More informationDetermining 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 informationReliable 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 informationApplication of VCG in Replica Placement Strategy of Cloud Storage
Internatonal Journal of Grd and Dstrbuted Computng, pp.27-40 http://dx.do.org/10.14257/jgdc.2016.9.4.03 Applcaton of VCG n Replca Placement Strategy of Cloud Storage Wang Hongxa Computer Department, Bejng
More information3. CR parameters and Multi-Objective Fitness Function
3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft
More informationAvailable online at ScienceDirect. Procedia Environmental Sciences 26 (2015 )
Avalable onlne at www.scencedrect.com ScenceDrect Proceda Envronmental Scences 26 (2015 ) 109 114 Spatal Statstcs 2015: Emergng Patterns Calbratng a Geographcally Weghted Regresson Model wth Parameter-Specfc
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationAnalysis 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 informationDegree-Constrained Minimum Spanning Tree Problem Using Genetic Algorithm
Degree-Constraned Mnmum Spannng Tree Problem Usng Genetc Algorthm Keke Lu, Zhenxang Chen, Ath Abraham *, Wene Cao and Shan Jng Shandong Provncal Key Laboratory of Network Based Intellgent Computng Unversty
More informationELEC 377 Operating Systems. Week 6 Class 3
ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationMaximum 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 informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationRouting in Degree-constrained FSO Mesh Networks
Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng
More informationVirtual Machine Placement Based on the VM Performance Models in Cloud
Vrtual Machne Placement Based on the VM Performance Models n Cloud Hu Zhao, Qnghua Zheng, Member, IEEE, Wezhan Zhang Member, IEEE, Yuxuan Chen, Yunhu Huang SPKLSTN Lab, Department of Computer Scence and
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationBIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING
An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College
More informationEVALUATION 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 informationAvailable online at ScienceDirect. Procedia CIRP 17 (2014 )
Avalable onlne at www.scencedrect.com ScenceDrect Proceda CIRP 7 (4 ) 48 4 Varety Management n Manufacturng. Proceedngs of the 47th CIRP Conference on Manufacturng Systems Robust Metaheurstcs for Schedulng
More informationResearch of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm
, pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,
More informationAn 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 informationMulti-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 informationTwo-Stage Data Distribution for Distributed Surveillance Video Processing with Hybrid Storage Architecture
Two-Stage Data Dstrbuton for Dstrbuted Survellance Vdeo Processng wth Hybrd Storage Archtecture Yangyang Gao, Hatao Zhang, Bngchang Tang, Yanpe Zhu, Huadong Ma Bejng Key Lab of Intellgent Telecomm. Software
More informationEECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science
EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty
More informationA 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 informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationReliability and Performance Models for Grid Computing
Relablty and Performance Models for Grd Computng Yuan-Shun Da,2, Jack Dongarra,3,4 Department of Electrcal Engneerng and Computer Scence, Unversty of Tennessee, Knoxvlle 2 Department of Industral and Informaton
More informationSimulation 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 informationIntegrated Congestion-Control Mechanism in Optical Burst Switching Networks
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subect matter experts for publcaton n the IEEE GLOBECOM 2005 proceedngs Integrated Congeston-Control Mechansm n Optcal Burst
More informationA 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 informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationImproved Resource Allocation Algorithms for Practical Image Encoding in a Ubiquitous Computing Environment
JOURNAL OF COMPUTERS, VOL. 4, NO. 9, SEPTEMBER 2009 873 Improved Resource Allocaton Algorthms for Practcal Image Encodng n a Ubqutous Computng Envronment Manxong Dong, Long Zheng, Kaoru Ota, Song Guo School
More informationNGPM -- A NSGA-II Program in Matlab
Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationBalanced Ant Colony Algorithm for Scheduling DAG to Grid Heterogeneous System
Internatonal Journal of Scentfc & Engneerng Research Volume 2, Issue 6, June-2011 1 Balanced Ant Colony Algorthm for Schedulng DAG to Grd Heterogeneous System Mrs. Smtha Jha Abstract- Ant Colony Optmzaton
More informationA fault tree analysis strategy using binary decision diagrams
Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:
More informationQuery Clustering Using a Hybrid Query Similarity Measure
Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan
More informationImperialist 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 informationMOBILE Cloud Computing (MCC) extends the capabilities
1 Resource Sharng of a Computng Access Pont for Mult-user Moble Cloud Offloadng wth Delay Constrants Meng-Hs Chen, Student Member, IEEE, Mn Dong, Senor Member, IEEE, Ben Lang, Fellow, IEEE arxv:1712.00030v2
More informationStudy on Multi-objective Flexible Job-shop Scheduling Problem considering Energy Consumption
Journal of Industral Engneerng and Management JIEM, 2014 7(3): 589-604 nlne ISSN: 2014-0953 Prnt ISSN: 2014-8423 http://dx.do.org/10.3926/jem.1075 Study on Mult-objectve Flexble Job-shop Schedulng Problem
More informationFAHP 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 informationNeural Network Based Algorithm for Multi-Constrained Shortest Path Problem
Neural Network Based Algorthm for Mult-Constraned Shortest Path Problem Jyang Dong 1,2, Junyng Zhang 2, and Zhong Chen 1 1 Department of Physcs, Fujan Engneerng Research Center for Sold-State Lghtng, Xamen
More informationDelay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks
Appl. Math. Inf. Sc. 7, No. 2L, 467-474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network
More informationA Model Based on Multi-agent for Dynamic Bandwidth Allocation in Networks Guang LU, Jian-Wen QI
216 Jont Internatonal Conference on Artfcal Intellgence and Computer Engneerng (AICE 216) and Internatonal Conference on etwork and Communcaton Securty (CS 216) ISB: 978-1-6595-362-5 A Model Based on Mult-agent
More informationDynamic SLA Management with Forecasting using Multi-Objective Optimization
Dynamc SLA Management wth Forecastng usng Mult-Objectve Optmzaton Alexandru-Floran Antonescu, Phlp obnson, Torsten Braun SAP esearch SAP (Swtzerland) Inc., Althardstrasse 80, 8105 egensdorf, Swtzerland
More informationMaintaining 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 informationDeadlock-free migration for virtual machine consolidation using Chicken Swarm Optimization algorithm
Deadlock-free mgraton for vrtual machne consoldaton usng Chcken Swarm Optmzaton algorthm Tan, F., Zhang, R., Lewandowsk, J., Chao, K-M., L, L. and Dong, B. Post-prnt deposted n Coventry Unversty repostory
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationCracking of the Merkle Hellman Cryptosystem Using Genetic Algorithm
Crackng of the Merkle Hellman Cryptosystem Usng Genetc Algorthm Zurab Kochladze 1 * & Lal Besela 2 1 Ivane Javakhshvl Tbls State Unversty, 1, I.Chavchavadze av 1, 0128, Tbls, Georga 2 Sokhum State Unversty,
More informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationS1 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 informationGA-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 informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationKent 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 informationTowards Autonomous Service Composition in A Grid Environment
Towards Autonomous Servce Composton n A Grd Envronment Wllam K. Cheung +, Jmng Lu +, Kevn H. Tsang +, Raymond K. Wong ++ Department of Computer Scence + Hong Kong Baptst Unversty Hong Kong {wllam,jmng,hhtsang}@comp.hkbu.edu.hk
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationAdaptive Energy and Location Aware Routing in Wireless Sensor Network
Adaptve Energy and Locaton Aware Routng n Wreless Sensor Network Hong Fu 1,1, Xaomng Wang 1, Yngshu L 1 Department of Computer Scence, Shaanx Normal Unversty, X an, Chna, 71006 fuhong433@gmal.com {wangxmsnnu@hotmal.cn}
More informationA Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
More information