Research Article Adaptive Cost-Based Task Scheduling in Cloud Environment

Size: px
Start display at page:

Download "Research Article Adaptive Cost-Based Task Scheduling in Cloud Environment"

Transcription

1 Scentfc Programmng Volume 2016, Artcle ID , 9 pages Research Artcle Adaptve Cost-Based Task Schedulng n Cloud Envronment Mohammed A. S. Mosleh, 1 G. Radhaman, 1 Mohamed A. G. Hazber, 2 and Syed Hamd Hasan 3 1 School of IT & Scence, Dr. GR Damodaran College of Scence, Combatore, Inda 2 Internatonal School of Software Engneerng, Wuhan Unversty, Wuhan, Chna 3 Informaton Systems Department, Kng Abdulazz Unversty, Jeddah, Saud Araba Correspondence should be addressed to Mohammed A. S. Mosleh; mohammed.mosleh@grd.edu.n Receved 22 June 2016; Revsed 19 September 2016; Accepted 20 October 2016 Academc Edtor: Frank De Boer Copyrght 2016 Mohammed A. S. Mosleh et al. Ths s an open access artcle dstrbuted under the Creatve Commons Attrbuton Lcense, whch permts unrestrcted use, dstrbuton, and reproducton n any medum, provded the orgnal work s properly cted. Task executon n cloud computng requres obtanng stored data from remote data centers. Though ths storage process reduces thememoryconstrantsoftheuser scomputer,thetmedeadlnesaserousconcern.inthspaper,adaptvecost-basedtask Schedulng (ACTS) s proposed to provde data access to the vrtual machnes (VMs) wthn the deadlne wthout ncreasng the cost. ACTS consders the data access completon tme for selectng the cost effectve path to access the data. To allocate data access paths, the data access completon tme s computed by consderng the mean and varance of the network servce tme and the arrval rate of network nput/output requests. Then the task prorty s assgned to the removed tasks based data access tme. Fnally, the cost of data paths are analyzed and allocated based on the task prorty. Mnmum cost path s allocated to the low prorty tasks and fast access path are allocated to hgh prorty tasks as to meet the tme deadlne. Thus effcent task schedulng can be acheved by usng ACTS. The expermental results conducted n terms of executon tme, computaton cost, communcaton cost, bandwdth, and CPU utlzaton prove that the proposed algorthm provdes better performance than the state-of-the-art methods. 1. Introducton Cloud computng s a promsng technology that provdes effcent servces to the customers n a dstant vrtual platform on a pay-per-use model. The defnton for cloud computng gven by NIST [1] s as follows: cloud computng s a model for enablng ubqutous, convenent, on-demand network access to shared computng resources whch can be provsoned and provded wth mnmal nteracton. Cloud computng provdes dfferent types of servces such as nfrastructure, software, and platform to the requested users wth a specfc prcefortheservces.cloudservcesusethenternetandthe central remote servers to mantan the data and applcatons. Cloud computng allows consumers and busnesses to use applcatons wthout nstallaton and access ther personal flesatanycomputerwthnternetaccess.thsapproach mproves the computng processes such as data storage and processng. Cloud s deployed n dfferent models: publc cloud, prvate clouds, hybrd cloud, communty cloud, and dstrbuted cloud are some examples. Servce orented archtecture s the basc prncple of the cloud computng whch consders everythng on the cloud as a servce [2]. Infrastructure-as-a-servce (IaaS) s the servce of provdng the physcal machnes (PM) or vrtual machnes (VM) to the user for processng resources, data parttonng, scalng, securty, and backup processes. Platformas-a-servce (PaaS) provdes the vendors wth the platforms for development of applcatons ncludng databases, web servers, and developmental tools. Software-as-a-servce (SaaS) provdes servces for the e-mals, vrtual desktops, communcaton processes, and gamng applcatons. The servces are normally pad servces whose prce s fxed by the servce provders based on the usage level of the customers. The prce of the cloud servces s very less compared to the other nstalled servces. In cloud computng, the tasks are performed n the physcal machnes (PMs) or the VMs as per the task requrements. The data requred for the executon of the tasks and servces arestoredatmultpledstantstoragelocatonscalledthedata centers whch are also used wth specfc cost [3]. When the

2 2 Scentfc Programmng tasks are performed n the processng machnes, the requred data are requested and obtaned from the data centers. The data from the data centers has to reach the VM wthn the partcular tme whch s always the access completon tme. The problem wth ths process s that the data s accessed through certan paths whch are bound by the computaton and storage costs. So t s possble that ether one of the two stuatons arses: n order to obtan the data n tme, the cost hastobesacrfcedor,nordertoreducethecost,thedelay n data access has to be accepted. Ths problem reduces the overall schedulng performance. In order to overcome the data access problem, an adaptve cost-based task schedulng (ACTS) s proposed n ths paper so that the data s obtaned at the requred tme wthout delay and through affordable cost paths. The proposed approach estmates the completon tme for accessng the data [13] that are requred by the VM machnes durng the partcular task executons. Then the cost of each possble path s estmated by the sum of computaton, communcaton, and storage costs [14] of the path. Usng the completon tme for data access the prorty of the tasks s assgned. The paths wth hgh cost but wth quck data access are assgned to tasks wth hgh prorty and the paths wth low cost are assgned to the low prorty tasks. Thus the data paths can be adaptvely selected to reduce theoverallcostandeffectvelydelverthedataattherequred tme. The remander of the paper s summarzed as follows: Secton 2 explans the related researches brefly and presents the analyss of schedulng schemes. Secton 3 presents the methodologes utlzed n the paper. Secton 4 provdes the expermental results and ther dscussons. Secton 5 concludes the research. 2. Related Works A cloud scheduler s a cloud-enable dstrbuted resource manager. It manages vrtual machnes on clouds to create an envronment for job executon. The FIFO scheduler n Hadoop MapReduce, far scheduler n Facebook, and capacty scheduler n Yahoo are typcal examples that serve the cloud systems wth effcent and equtable resource management, but none of these schedulers satsfes QoS (qualty of servce) constrants. Therefore, they are not applcable to soft real-tme needed applcatons and servces, whch are becomng more and more mportant and necessary n thehybrdcloudenvronment.themanobjectveofths secton s not to propose methodologes to overcome all of the current ssues n cloud task schedulng but to study and analyze some of the current methodologes and focus on fndng ther drawbacks. Sahn and Vdyarth [4] presented a cost-effectve deadlne constrant dynamc schedulng algorthm for the scentfc workflows. The workflow schedulng algorthms n thegrdandclustersareeffcentbutcouldnotbeutlzed effectvely n the cloud envronment because of the ondemand resource provsonng and pay-as-you-go prcng model. Hence the schedulng usng a dynamc cost-effectve deadlne-constraned heurstc algorthm has been utlzed to explot the features of cloud by consderng the vrtual machne performance varablty and nstance acquston delay to determne the tme schedulng. The problem wth the approach s that VM falures may adversely affect the overall workflow executon tme. Tsa et al. [5] proposed hyper-heurstc schedulng algorthm (HHSA) for provdng effectve cloud schedulng solutons. The dversty detecton and mprovement detecton operators are utlzed n ths approach to dynamcally determnethebetterlow-levelheurstcfortheeffectveschedulng.hhsacanreducethemakespanoftaskschedulngand mproves the overall schedulng performance. The drawback s that the approach has hgh overhead of connecton whch reduces the mportance of schedulng and thus reduces the overall performance. Zhu et al. [6] proposed an agent-based dynamc schedulng algorthm named ANGEL for effectve schedulng of tasks n the vrtualzed clouds. In ths approach, a bdrectonal announcement-bddng mechansm and the collaboratve process are performed to mprove the schedulng performance. To further mprove the schedulng, elastcty s consdered to dynamcally add VMs. The calculaton rules are generated to mprove the bddng process that n turn reduces the delay. The problem wth ths approach s that t reduces the performance as t does not consder the communcaton and dspatchng tmes. Zhu et al. [7] presented an evolutonary multobjectve (EMO) workflow schedulng approach to reduce the workflow schedulng problem such as cost and makespan. Due to the specfc propertes of the workflow schedulng problem, the exstng genetc operatons, such as bnary encodng, realvalued encodng, and the correspondng varaton operators are based on them n the EMO. The problem s that the approach does not consder monetary costs and tme overheads of both communcaton and storage. Zhang et al. [8] proposed a fne-graned schedulng approach called phase and resource nformaton-aware scheduler for MapReduce (PRISM) for schedulng n the MapReduce model. MapReduce has been utlzed for ts effcency n reducng the runnng tme of the data-ntensve jobs but most of the MapReduce schedulers are desgned on the bass of task-level solutons that provde suboptmal job performance. Moreover, the task-level schedulers face dffcultes n reducng the job executon tme. Hence the PRISM was developed whch dvdes tasks nto phases. Each phase wth a constant resource usage profle performs schedulng at the phase level. Thus the overall job executon tme can be reduced sgnfcantly but the problem of meetng job deadlnes n the phase level schedulng s a serous concern that requres specfed attenton. Zhu et al. [9] presented real-tme task orented energy aware (EA) schedulng called EARH for the vrtualzed clouds. The proposed approach s based on rollng-horzon (RH) optmzaton and the procedures are developed for creaton, mgraton, and cancellaton of VMs to dynamcally adjust the scale of cloud to acheve real tme deadlnes and reduce energy. The EARH approach has the drawback of the number of cycles assgned to the VMs that cannot be updated dynamcally.

3 Scentfc Programmng 3 Table 1: Drawbacks of schedulng schemes n lterature. Author Schedulng scheme Drawbacks Sahn and Vdyarth [4] Cost-effectve deadlne constrant dynamc schedulng algorthm VM falures ncrease the workload of other VMs and affect the executon tme Tsa et al. [5] Hyper-heurstc schedulng algorthm Hgh overhead of connecton Zhu et al. [6] Agent-based schedulng algorthm n vrtualzed Nonconsderaton of communcaton and clouds (ANGEL) dspatchng tme reducng performance Zhu et al. [7] Evolutonary multobjectve (EMO) workflow Nonconsderaton of monetary costs and tme schedulng overhead does not mprove performance Zhang et al. [8] Phase and resource nformaton-aware scheduler for MapReduce (PRISM) Deadlnes are not specfed Zhu et al. [9] Energy aware rollng-horzon (EARH) optmzaton based schedulng Lack of updaton n number of VM cycles Magulur and Srkant [10] Throughput-optmal schedulng & load-balancng Utlzng queue lengths n weghts s based on algorthm assumpton Zuo et al. [11] Self-adaptve learnng partcle swarm Lack of prorty to deadlne constrant tasks optmzaton- (SLPSO-) based schedulng results n task falures Su et al. [12] Cost effcent task schedulng Does not consder the completon tme and cost (computaton cost and communcaton cost) Magulur and Srkant [10] suggested a schedulng method for job schedulng wth unknown duraton n the cloud envronment. The job szes are assumed to be unknown not onlyatarrval,butalsoatthebegnnngofservce.hence the throughput-optmal schedulng and load-balancng algorthm for a cloud data center s ntroduced, when the job szes are unknown. Ths algorthm s based on usng queue lengths for weghts n max-weght schedule nstead of the workload. Zuo et al. [11] presented self-adaptve learnng partcle swarm optmzaton- (SLPSO-) based schedulng approach for deadlne constrant task schedulng n hybrd IaaS clouds. The approach solves the problem of meetng the peak demand for preservng the qualty-of-servce constrants by usng the PSO optmzaton technque. The approach provdes better schedulng of the tasks wth maxmzng the proft of IaaS provder whle guaranteeng QoS. The problem wth ths approach s the lack of prorty determnaton whch results n falure of deadlne tasks. Schedulng tasks n a cloud computng envronment s a challengng process. In [12] Su et al. presented a cost effcent task schedulng method that can be utlzed for processng largeszeprograms.buttheperformanceoftheapproachs not suffcent as t dd not consder the completon tme and cost for schedulng. From the lterature t s found that the major ssues n the above descrbed methods are hgh cost consumpton especally for communcaton and computaton of data from cloud data centers. The nablty to meet up the deadlnes, due to the napproprate data path allocaton whle task schedulng, s another area of concern. The analyss of varous schedulng schemes s lsted as below Analyss of Schedulng Schemes. Generally, the effcent task schedulng concepts of the clusters and the grd are not effectve n the cloud envronment. The man reason s that n cloud computng the resource provson s on-demand and the resources are provded on the bass of pay-per-use. Hence the schedulng approach has to make use of the features of the cloud n order to effcently schedule the tasks wthout tme delay. Whle processng a task n a VM, the data are needed to be obtaned from the dstant data centers located at multple locatons. As the tasks are deadlne constrant, the data are needed to be obtaned wthn the partcular tme usng effectve schedulng approaches. However, the soluton for schedulng deadlne constrant tasks n the cloud leads to a new problem n the form of cost. The computaton and the storage resources are the basc resources n the cloud envronment that forms the cost models. Table 1 shows the varous schedulng schemes descrbed n lterature and ther drawbacks. The hgh cost problems can be reduced by effectvely selectng the mnmum cost paths based on avalablty of the data paths. The problem s that not all the tasks take the same executon tme whch means some tasks requre data qucker than the other tasks. But when usng only the mnmum cost path,thedatawouldhavetowatnqueueormghtbelostdue to queue overflow. So the cost paths are needed to be selected adaptvely for deadlne constrant tasks. These two problems are the major focus of ths research. 3. Adaptve Cost-Based Task Schedulng The proposed adaptve cost-based task schedulng (ACTS) sdscussednthssecton.theschedulngofthetasksto the VMs can be performed effectvely usng the proposed schedulng method. Ths work takes nspraton from the work of Su et al. In ther work, cost effcent task schedulng s used whch consders the overall executon tme and total monetary costs for schedulng. Though the executon tme and monetary cost are consdered ths scheme cannot be consdered as effcent due to the reason that these two factors are collaboratve factors. The executon tme s the

4 4 Scentfc Programmng tme for task completon. Ths means the executon tme ncludesthetmefromwhchthetasksareassgnedtoa VM untl the output of the tasks s obtaned. However, the tme consumed for each process n task executon vares and not all of them can be mnmzed. In ths sense, the tme taken for obtanng the data from the data centers for task executon s consderably hgher than all other process n task executon. Smlarly, the monetary cost s the combned cost of resources for computaton, communcaton, storage, data transfer, and so forth; n these processes, the costs for computaton and communcaton are normally hgher than other costs. But Su et al. consdered only the combned factors for schedulng. Hence n the proposed ACTS we focused on specfcally consderng the ndvdual processes as factors for schedulng. The major factors are data access completon tme, computaton cost, and communcaton cost. The data that are requred to be processed n the VM or the PM are stored n the dstant data centers. These data are needed to be fetched to the processng VMs from the data centers through the cost-effectve paths. The data access of each VM follows an ndependent Posson dstrbuton assocated wth the average rate of the arrval rate of the network I/O requests. The data access to the drver doman (PM) s processed on the bass of provdng the access to the frst come users whle the other users wat n the queue. The servce tme of a data access n the drver doman s represented n an arbtrary dstrbuton. The data access completon tme s consdered to be the determnaton pont n the selecton of the data paths. The completon tme for the data access s calculated by utlzng the parameters of the network nput/output requests n the physcal machnes. The mean of the servce tme network I/O requests n the PMs s gven by μ and the varance of the servce tme network I/O requests n the PMs s gven by σ. The arrval rate of the network I/O requests to the PMs s gven by λ. Then the completon tme t of a data access can beestmatedusngtheformula t= 2μ λ+λμ2 σ 2 2μ 2. (1) 2λμ The arrval rate of the network I/O requests to the PMs can be calculated by λ= λ (e) r (e) + λ (n) r (n), (2) where r (e) and r (n) are the rato of the CPU tme allocated to the exstng and new VMs. λ (e) and λ (n) arethearrvalrateof the network I/O requests of the exstng and new VMs to the PMs. The tasks are performed n the vrtual machne (VM) whch obtans the data from cloud centers through the data access paths. Each data access path contans resources for processng the requests and accessng the data and also requres storage resources for storng the accessed data. Each of the resources carres certan costs for utlzng the resources. The computaton cost ncludes the cost of resources for executon of the I/O requests for the data access and the cost for reaccessng the same data agan. It also ncludes the cost for regeneratng the datasets. The communcaton cost s the total cost of the resources utlzed for the processng of the I/O requests. It can be expressed as the product of the data set sze and the network traffc prce. The cost of the possble data access paths s analyzed n order to determne the mnmum cost path. The cost of each path can be estmated by Cost = Computaton cost + Communcaton cost. (3) The computaton cost and communcaton cost are vtal n the determnaton of the cost-effectve paths as these resources handle the I/O requests of the VMs. When the VM executes a task, for accessng the data from the data centers, the VM sends request for the access. The data centers receve the I/O requests and then provde access for the data. The proposed ACTS consders both the cost and the completon tme of data access for effcently schedulng thetasks.actsassgnsprortytothetasksbasedonthe completon tme. Tme T s chosen as a fxed tme and thecompletontmescomparedwtht to determne the prorty.thelowprortytasksarethosethathavemore completon tme and hence the path s selected as mnmum cost path to reduce the overall cost. The reason for ths approach to low prorty tasks s because these tasks can be executed n a normal tme wthout much urgency. Smlarly, thehghprortytasksarethosethatrequredatawthnthe lesscompletontmeandhencethepathsthatprovdequcker data access are selected wthout watng for the mnmum cost path. Ths may ncrease the cost but the man am s to obtan the requested data wthn the tme and hence the small varaton n the overall cost can be neglgble. After the executon of the tasks, the CPU utlzaton and the bandwdth utlzaton are estmated. Fgure 1 shows the proposed ACTS procedure. Ths work focuses on schedulng the tasks to the VMs wth mnmum cost paths to reduce the complexty n the data accessng from theclouddatacenter.thetasksareallocatedtotheunderloaded VMs based on the normal load condtons. The tasks allocatedtovmsaccessthedatafromthedstantclouddata centers. The cost that recurred for I/O processng s computed and the completon tme for data access s estmated. Then the CPU utlzaton and bandwdth utlzaton are calculated and updated for successve task executons. For example, let us consder V tasks of smple mathematcal programs wth flexble propertes of bandwdth, random access memory (RAM), and mllon nstructons per second (mps). These parameters of the cloud tasks are user defned and can be flexbly chosen. Moreover, the smulatons are made n the real-tme smulaton envronment (CloudSm) whch provdes user frendly behavor. The tasks are nonpreemptve dependent tasks. The VMs are ntated from the cloud envronment wth exstng VMs denoted as E and the newly ntated VMs are placed under N. Ths s because when there s large load, thenewvmsarentroduced.thetasksexecutethesmple mathematcal programs wth the length dfferng based on the ntated codes. The addton program of (a +b)sexecuted once for a task wth 4 bts whle t s repeated to acheve the prescrbed length n the chosen tasks.

5 Scentfc Programmng 5 Tasks Request for data access I/O request processng Vrtual machne (VM) Cloud data centers Computaton of data access tme Estmaton of computaton and communcaton cost Data access acceptance Executon of task Data access through cost-effectve path Estmaton of CPU utlzaton and bandwdth utlzaton Output Fgure 1: Adaptve cost-based task schedulng. Now let us take task v wth m resources avalable. Intally thetasksarecheckedforpossbleexecuton.allthevmsare runnng n parallel and are unrelated and each VM runs on ts own resources. There s no sharng of ts own resources by other VMs. We schedule nonpreemptve dependent tasks to the VMs. For each task V, the arrval rate λ j and T(V,m j ) are calculated. Then the costs C comp and C communcaton are computed for each data path d usng (2), (7), and (9). The computaton cost n equaton (7) s estmated as the sum of all costs ncurred for runnng a task V on a VM m of a provder p (8)whlethecommuncatoncost(9)stheproductofcostfor data requred and the nbound network traffc prces. Based on the completon tme, the tasks prorty s assgned. Then based on T(V,m j ) andcost,thepathsaresorted.thenthe paths are allocated to each task and then the underloaded VMs are loaded wth the tasks whch access the data from the cloud data center at the deadlne tme. Then the CPU utlzaton (11) and bandwdth utlzaton (12) are calculated for determnng the effcency of the system. Ths schedulng proceduressortednthefollowngalgorthm. Algorthm 1 (adaptve cost-based task schedulng). Input:numberoftasks,VMs Output:taskschedulng Begn Deploy the set of physcal machnes. E = set of exstng VMs present n the cloud computng system. N = set of new VMs to be created. Set of tasks V={V 1, V 2,...,V }. Set of resources M={m 1,m 2,...,m n }. For each task V, Arrval rate λ j to PM j usng (1) λ j = λ (e) r (e) E + λ (n) r (n), (4) N //where r (e) and r (n) are the rato of the CPU tme allocated to the exstng and new VMs. λ (e) and λ (n) arethearrvalrateofthenetworki/o requests of the exstng and new VMs to the PMs. Compute completon tme of data access T(V,m j ) usng (2) T(V,m j )= 2μ j λ j +λ j μ 2 j σ2 j 2μ 2 j 2λ jμ j, (5) //where μ j s the mean servce tme of network I/O requests n m j, σ j s the varance of the servce tme dstrbuton, and λ j sthearrvalrateof network I/O requests to m j End for Compute cost of each possble data path d usng (3) Cost = Computaton cost + Communcaton cost, C d =C comp +C communcaton. (6)

6 6 Scentfc Programmng Computaton cost C comp = V V mn M m j (C task (V,p,m j )), (7) where the cost of runnng a task V on provder p wth VM m j s defned as RT m j,p V C p m j, RT m j,p V DL a { C task (V,p,m j )=, RT m j,p V > DL a { {, m j M, (8) //where set of tasks s gven by V and p s the servce provder. DL a sthetmetodeadlneofv. RT m j,p V s the runtme of a task V. C p m j s the cost of runnng an VM on p for one tme unt. Communcaton cost can be computed as C communcaton =D a NW n p, (9) //where D a s the GB requred for task V and NW n p s the nbound network traffc prces per GB of the provder p. Select mnmum cost path C dmn. Assgn prorty to tasks V. If (Prorty of V = low && T(V,m j ) T) Data path =C dmn. (10) Else f (Prorty of V = hgh && T(V,m j )<T) // T safxedtmewthwhchthedataaccess completon tme of the tasks s compared to determne the prorty; analyze data paths C d whch satsfes the tme to deadlne DL a for tasks V ; data path = C dt [C dt =C dmn ]; // path has faster data access to satsfy tme to deadlne even wthout mnmum cost End f Assgn tasks to VMs. Estmaton of CPU utlzaton CPU = cl MIPS CPU MIPS 1000 cl ms, (11) // where CPU s the CPU utlzaton; cl MIPS s the calculated cloudlet s MIPS length; CPU MIPS s the MIPS raton of the CPU; cl ms s the cloudlet s duraton n mllseconds when executed on a CPU wth a MIPS ratng of CPU MIPS Estmaton of bandwdth utlzaton BW u = τ V 100 BW V ψ V, (12) // where BW u s the bandwdth utlzaton; BW V s the allotted bandwdth quota; τ V s the amount of data transferred durng the lfe of VM; ψ V s the duraton whchsthevmlfetmeandtsequaltothevm release tme to the VM creaton tme. Update VM characterstcs for next teraton. End Descrpton. The tasks V, the number of VMs, and VM resources m are ntalzed.. The set of exstng VMs E and the set of newly created VMs N are assgned. For each task, the data access completon tme s calculated as T(V,m j ). Smlarly the computaton cost and communcaton cost arealsocalculatednordertoestmatethecostofeach data path. Usng the completon tme and computaton cost, and communcaton cost of each path, the schedulng s performed. The tasks are assgned prortes based on the completon tme. The hgh prorty tasks whch have less completon tme are allocated fast data access paths C dt that satsfy the tme to deadlne wthout prortzng the cost. But for the low prorty tasks whch have hgh completon tme the mnmum cost paths C dmn are allocated. Then the tasks are executed and the utlzaton of CPU and bandwdth are calculated. 4. Expermental Results The experments are conducted to evaluate the performance oftheproposedadaptvecost-basedtaskschedulngand theresultsaretabulated.thecosteffcenttaskschedulng s presented n [12] utlzed n ths work for performance comparson wthout consderng the cost and completon tme of the data access and compared wth the proposed ACTS consderng the cost and data access completon tme. The experments are carred out usng the CloudSm [15] tool. The classes of the CloudSm smulator have been extended (overrdden) to utlze the newly wrtten algorthm. The smulator CloudSm opens the possblty of evaluatng the hypothess pror to software development n an envronment whch can reproduce tests. Specfcally, n case of cloud computng where the access to the nfrastructure ncurs payments n real currency, a smulaton-based approach allows cloud customers to test ther servces n repeatable and controllable envronment. Addtonally t allows tunng the performance bottlenecks before the deployment on real clouds. The effcency of the approaches s compared n terms of computaton cost, communcaton cost, executon tme, CPU utlzaton, and bandwdth. The numbers of tasks and VMs consdered are flexble to user requrements whch mean the user provdes memory, mps, and bandwdth values whch are randomly utlzed n the VM. The approprate determnaton of the characterstcs of the VM and the tasks s hghly recommended for obtanng

7 Scentfc Programmng Computaton cost (prce) Communcaton cost (prce) Number of tasks Cost effcent task schedulng Adaptve cost-based task schedulng Number of tasks Cost effcent task schedulng Adaptve cost-based task schedulng Fgure 2: Comparson of computaton cost. Fgure 3: Comparson of communcaton cost. desred performance evaluaton results. The VM characterstcs are as follows: ram (256, 312, 712, and 856) bytes; mps (330,370,and400);bandwdth(700,750,800,and900)bts per second (bps). Lkewse, the I/O ntensve tasks are taken as follows: length (4, 8, 11, 5, 3, 9, and 10); memory (256, 312, 378, 280, 436, 553, and 375) bytes. An I/O ntensve task performs the functon of readng the nput/output data and wrtes them onto the fles. These values are user provded values and suppose f the number of VMs s 10 then the combnaton of ram, mps, and bandwdth s chosen randomly. For example, n case of the ram for 10 VMs, the one possble set of values wouldbe256,312,712,856,256,312,712,856,256,and312, respectvely Computaton Cost. Computaton cost s the cost that s requred for utlzng the resources for computaton of the I/O requests for the data access. It can be computed usng (7). Fgure 2 shows the comparson of the exstng cost effcent task schedulng wthout consderng the completon tmeandthecostwththeproposedadaptvecost-basedtask schedulng (ACTS) wth consderng the completon tme and the cost n terms of the computaton cost. In the xaxs, the number of tasks s taken whle along the y-axs the computaton cost (prce) s taken. When the number of tasks s 50, the cost effcent task schedulng has computaton cost of 2890 but the proposed ACTS has Thus the proposed ACTS provdes better schedulng wth mnmal computaton cost Communcaton Cost. Communcaton cost s the cost that s requred for utlzng the resources for I/O requests and responses between the data center and the VM for the data access. It can be calculated usng (9). Fgure 3 shows the comparson of the exstng cost effcent task schedulng wthout consderng the completon tmeandthecostwththeproposedadaptvecost-based task schedulng (ACTS) wth consderng the completon tme and the cost n terms of the communcaton cost. In the x-axs, the tasks are taken whle along the y-axs the communcaton cost (prce) s taken. When the number of tasks s 50, the exstng cost effcent task schedulng has communcaton cost of 1100 but the proposed adaptve costbasedtaskschedulnghas946.6.thsshowsthattheproposed ACTS consumes less cost than the exstng scheme Executon Tme. The executon tme s the tme requred to process a task n a VM. The executon tme s estmated as the product of number of cycles for executng per nstructon, tme per cycle, and the number of nstructons. Fgure 4 shows the comparson of the exstng cost effcent task schedulng wthout consderng the completon tmeandthecostwththeproposedadaptvecost-basedtask schedulng (ACTS) wth consderng the completon tme and the cost n terms of the executon tme. In the x-axs, the tasks are taken whle along the y-axs the executon tme n mllseconds (ms) s taken. When the number of tasks s 50, the exstng cost effcent task schedulng has executon tme of ms but the proposed ACTS has 2.56 ms. Ths shows thattheproposedactsreducesthetmetakenfortheoverall process CPU Utlzaton. CPU utlzaton refers to the usage of processng resources or the amount of work handled by a CPU. CPU utlzaton vares dependng on the amount and type of managed computng tasks. It s estmated usng (11).

8 8 Scentfc Programmng Executon tme (ms) Bandwdth (bps) Number of tasks Cost effcent task schedulng Adaptve cost-based task schedulng Fgure 4: Comparson of executon tme Number of tasks Cost effcent task schedulng Adaptve cost-based task schedulng Fgure 6: Comparson of bandwdth utlzaton. CPU utlzaton (%) Number of tasks Cost effcent task schedulng Adaptve cost-based task schedulng Fgure 5: Comparson of CPU utlzaton. Fgure 5 shows the comparson of the exstng cost effcent task schedulng wth the proposed adaptve cost-based task schedulng (ACTS) n terms of the CPU utlzaton. In the x-axs, the number of tasks s taken whle along the yaxs the CPU utlzaton n % s taken. When the number of tasks s 50, the exstng cost effcent task schedulng has CPU utlzaton of 13.14% but the proposed ACTS has %. Ths shows that the proposed ACTS has less CPU utlzaton Bandwdth Utlzaton. Bandwdth s the amount of data that can be transmtted n a fxed amount of tme. It s gven n bts per second (bps). It s estmated usng (12). Fgure 6 shows the comparson of the exstng cost effcent task schedulng wth the proposed Adaptve costbasedtaskschedulng(acts)ntermsofthebandwdth.in the x-axs, the number of tasks s taken whle along the y-axs the bandwdth n bps s taken. When the number of tasks s 50, the exstng cost effcent task schedulng has bandwdth of bps but the proposed ACTS has bps. Thus from the expermental results t s clear that the proposed Adaptve cost-based task schedulng (ACTS) whch consders the completon tme and computaton cost and communcaton cost s effcent compared to the exstng cost effcent task schedulng. 5. Concluson Schedulng tasks n cloud computng wth reduced delay and effectve cost management are a challengng task. Hence n ths paper, adaptve cost-based task schedulng (ACTS) s proposed consderng the data access completon tme and the cost for data access. By consderng these two factors, the data can be fetched from the data centers effectvely and the schedulng performance can be mproved. The approach focuses on provdng data access for executng each task wth mantaned costs. Expermental results also show that the proposed adaptve cost-based task schedulng provdes better performance n terms of executon tme, computaton cost, communcaton cost, and bandwdth and CPU utlzaton when compared wth exstng cost-effcent task schedulng approach. In ths paper, the task schedulng s performed for the already determned task demands and t s qute challengng to schedule tasks wth undetermned demands. Ths could be performed by utlzng effcent resource provsonng technques n the future. The cost for regeneraton of datasets s not computed n ACTS but t s not effcent for excepton cases whch should be consdered n the future researches.

9 Scentfc Programmng 9 Moreover, the load-balancng problems are also needed to be resolved for provdng effcent cloud computng servces whch would be our future scope of research. Competng Interests The authors declare that there s no conflct of nterests regardng the publcaton of ths paper. [15] R. N. Calheros, R. Ranjan, A. Beloglazov, C. A. F. De Rose, and R. Buyya, CloudSm: a toolkt for modelng and smulaton of cloud computng envronments and evaluaton of resource provsonng algorthms, Software Practce and Experence, vol. 41, no. 1, pp , References [1] P. Mell and T. Grance, The NIST defnton of cloud computng, Natonal Insttute of Standards and Technology, vol. 53, no. 6, p. 50, [2] Q.Zhang,L.Cheng,andR.Boutaba, Cloudcomputng:stateof-the-art and research challenges, Journal of Internet Servces and Applcatons,vol.1,no.1,pp.7 18,2010. [3] K. Nanath and R. Plla, A model for cost-beneft analyss of cloud computng, Journal of Internatonal Technology and Informaton Management,vol.22,no.3,artcle6,2013. [4] J. Sahn and D. Vdyarth, A cost-effectve deadlne-constraned dynamc schedulng algorthm for scentfc workflows n a cloud envronment, IEEE Transactons on Cloud Computng, [5] C.W.Tsa,W.C.Huang,M.H.Chang,M.C.Chang,andC.S. Yang, A hyper-heurstc schedulng algorthm for cloud, IEEE Transactons on Cloud Computng, vol.2,no.2,pp , [6]X.Zhu,C.Chen,L.T.Yang,andY.Xang, ANGEL:agentbased schedulng for real-tme tasks n vrtualzed clouds, IEEE Transactons on Computers,vol.64,no.12,pp ,2015. [7]Z.Zhu,G.Zhang,M.L,andX.Lu, Evolutonarymultobjectve workflow schedulng n cloud, IEEE Transactons on Parallel and Dstrbuted Systems, vol.27,no.5,pp , [8]Q.Zhang,M.F.Zhan,Y.Yang,R.Boutaba,andB.Wong, PRISM: fne-graned resource-aware schedulng for MapReduce, IEEE Transactons on Cloud Computng,vol.3,no.2,pp , [9] X.Zhu,L.T.Yang,H.Chen,J.Wang,S.Yn,andX.Lu, Realtme tasks orented energy-aware schedulng n vrtualzed clouds, IEEE Transactons on Cloud Computng, vol. 2, no. 2, pp , [10] S. T. Magulur and R. Srkant, Schedulng jobs wth unknown duraton n clouds, IEEE/ACM Transactons on Networkng,vol. 22, no. 6, pp , [11] X. Zuo, G. Zhang, and W. Tan, Self-adaptve learnng psobased deadlne constraned task schedulng for hybrd aas cloud, IEEE Transactons on Automaton Scence and Engneerng,vol.11,no.2,pp ,2014. [12] S.Su,J.L,Q.Huang,X.Huang,K.Shuang,andJ.Wang, Costeffcent task schedulng for executng large programs n the cloud, Parallel Computng, vol. 39, no. 4-5, pp , [13] J.-W. Ln, C.-H. Chen, and C.-Y. Ln, Integratng QoS awareness wth vrtualzaton n cloud computng systems for delaysenstve applcatons, Future Generaton Computer Systems, vol. 37, pp , [14] D. Yuan, Y. Yang, X. Lu et al., A hghly practcal approach toward achevng mnmum data sets storage cost n the cloud, IEEE Transactons on Parallel and Dstrbuted Systems, vol.24, no. 6, pp , 2013.

10 Journal of Advances n Industral Engneerng Multmeda The Scentfc World Journal Appled Computatonal Intellgence and Soft Computng Internatonal Journal of Dstrbuted Sensor Networks Advances n Fuzzy Systems Modellng & Smulaton n Engneerng Submt your manuscrpts at Journal of Computer Networks and Communcatons Advances n Artfcal Intellgence Internatonal Journal of Bomedcal Imagng Advances n Artfcal Neural Systems Internatonal Journal of Computer Engneerng Computer Games Technology Advances n Advances n Software Engneerng Internatonal Journal of Reconfgurable Computng Robotcs Computatonal Intellgence and Neuroscence Advances n Human-Computer Interacton Journal of Journal of Electrcal and Computer Engneerng

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew 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 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

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

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

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

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

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

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)

More information

Two-Stage Data Distribution for Distributed Surveillance Video Processing with Hybrid Storage Architecture

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

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment

Resource 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 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

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.

More information

Application of VCG in Replica Placement Strategy of Cloud Storage

Application 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 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

Efficient Content Distribution in Wireless P2P Networks

Efficient Content Distribution in Wireless P2P Networks Effcent Content Dstrbuton n Wreless P2P Networs Qong Sun, Vctor O. K. L, and Ka-Cheong Leung Department of Electrcal and Electronc Engneerng The Unversty of Hong Kong Pofulam Road, Hong Kong, Chna {oansun,

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

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

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

A Model Based on Multi-agent for Dynamic Bandwidth Allocation in Networks Guang LU, Jian-Wen QI

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

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

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

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

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

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

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

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

The Data Warehouse in a Distributed Utility Environment

The Data Warehouse in a Distributed Utility Environment The Data Warehouse n a Dstrbuted Utlty Envronment Charles A. Mllgan Dstngushed Engneer, Sun Mcrosystems Charles.mllgan@sun.com Abstract Utlty provsonng, Grd resource management, nstant copy kosks, and

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

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

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

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

Dynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication

Dynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. Dynamc Bandwdth Provsonng wth Farness and Revenue Consderatons

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

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

Research of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm

Research 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 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

Performance Comparison of a QoS Aware Routing Protocol for Wireless Sensor Networks

Performance Comparison of a QoS Aware Routing Protocol for Wireless Sensor Networks Communcatons and Network, 2016, 8, 45-55 Publshed Onlne February 2016 n ScRes. http://www.scrp.org/journal/cn http://dx.do.org/10.4236/cn.2016.81006 Performance Comparson of a QoS Aware Routng Protocol

More 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

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

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

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

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

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

Internet Traffic Managers

Internet Traffic Managers Internet Traffc Managers Ibrahm Matta matta@cs.bu.edu www.cs.bu.edu/faculty/matta Computer Scence Department Boston Unversty Boston, MA 225 Jont work wth members of the WING group: Azer Bestavros, John

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

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

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

Priority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks

Priority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks Prorty-Based Schedulng Algorthm for Downlnk Traffcs n IEEE 80.6 Networks Ja-Mng Lang, Jen-Jee Chen, You-Chun Wang, Yu-Chee Tseng, and Bao-Shuh P. Ln Department of Computer Scence Natonal Chao-Tung Unversty,

More information

Available online at ScienceDirect. Procedia Computer Science 46 (2015 )

Available online at  ScienceDirect. Procedia Computer Science 46 (2015 ) Avalable onlne at www.scencedrect.com ScenceDrect Proceda Computer Scence 46 (2015 ) 558 565 Internatonal Conference on Informaton and Communcaton Technologes (ICICT 2014) A Novel Famly Genetc Approach

More information

A Time-driven Data Placement Strategy for a Scientific Workflow Combining Edge Computing and Cloud Computing

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

Data-Aware Scheduling Strategy for Scientific Workflow Applications in IaaS Cloud Computing

Data-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 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

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More 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

Network Coding as a Dynamical System

Network Coding as a Dynamical System Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.

More information

Dynamic Voltage Scaling of Supply and Body Bias Exploiting Software Runtime Distribution

Dynamic Voltage Scaling of Supply and Body Bias Exploiting Software Runtime Distribution Dynamc Voltage Scalng of Supply and Body Bas Explotng Software Runtme Dstrbuton Sungpack Hong EE Department Stanford Unversty Sungjoo Yoo, Byeong Bn, Kyu-Myung Cho, Soo-Kwan Eo Samsung Electroncs Taehwan

More information

THere are increasing interests and use of mobile ad hoc

THere are increasing interests and use of mobile ad hoc 1 Adaptve Schedulng n MIMO-based Heterogeneous Ad hoc Networks Shan Chu, Xn Wang Member, IEEE, and Yuanyuan Yang Fellow, IEEE. Abstract The demands for data rate and transmsson relablty constantly ncrease

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

CS 268: Lecture 8 Router Support for Congestion Control

CS 268: Lecture 8 Router Support for Congestion Control CS 268: Lecture 8 Router Support for Congeston Control Ion Stoca Computer Scence Dvson Department of Electrcal Engneerng and Computer Scences Unversty of Calforna, Berkeley Berkeley, CA 9472-1776 Router

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

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

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Analysis of Collaborative Distributed Admission Control in x Networks

Analysis of Collaborative Distributed Admission Control in x Networks 1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,

More information

Avoiding congestion through dynamic load control

Avoiding congestion through dynamic load control Avodng congeston through dynamc load control Vasl Hnatyshn, Adarshpal S. Seth Department of Computer and Informaton Scences, Unversty of Delaware, Newark, DE 976 ABSTRACT The current best effort approach

More 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

Channel-Quality Dependent Earliest Deadline Due Fair Scheduling Schemes for Wireless Multimedia Networks

Channel-Quality Dependent Earliest Deadline Due Fair Scheduling Schemes for Wireless Multimedia Networks Channel-Qualty Dependent Earlest Deadlne Due Far Schedulng Schemes for Wreless Multmeda Networks Ahmed K. F. Khattab Khaled M. F. Elsayed ahmedkhattab@eng.cu.edu.eg khaled@eee.org Department of Electroncs

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

Research Article. ISSN (Print) s k and. d k rate of k -th flow, source node and

Research Article. ISSN (Print) s k and. d k rate of k -th flow, source node and Scholars Journal of Engneerng and Technology (SJET) Sch. J. Eng. Tech., 2015; 3(4A):343-350 Scholars Academc and Scentfc Publsher (An Internatonal Publsher for Academc and Scentfc Resources) www.saspublsher.com

More information

Analysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD

Analysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,

More 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

Delay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks

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

Available online at Available online at Advanced in Control Engineering and Information Science

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

Fast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems

Fast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems Fast Retransmsson of Real-Tme Traffc n HIPERLAN/ Systems José A Afonso and Joaqum E Neves Department of Industral Electroncs Unversty of Mnho, Campus de Azurém 4800-058 Gumarães, Portugal {joseafonso,

More information

Distributed Middlebox Placement Based on Potential Game

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

An Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems

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

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More 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

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

Network Intrusion Detection Based on PSO-SVM

Network Intrusion Detection Based on PSO-SVM TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.1, No., February 014, pp. 150 ~ 1508 DOI: http://dx.do.org/10.11591/telkomnka.v1.386 150 Network Intruson Detecton Based on PSO-SVM Changsheng Xang*

More information

Game Based Virtual Bandwidth Allocation for Virtual Networks in Data Centers

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