IWFMS: An Internal Workflow Management System/Optimizer for Hadoop
|
|
- Joseph Phillips
- 8 years ago
- Views:
Transcription
1 IWFMS: An Internal Workflow Management System/Optmzer for Hadoop Lan Lu, Yao Shen Department of Computer Scence and Engneerng Shangha JaoTong Unversty Shangha, Chna ABSTRACT The scale of jobs runnng on parallel computaton platform such as Hadoop s ncreasng quckly, thus workflow engnes that manage data processng jobs have become ncreasngly mportant. However, tradtonal workflow management systems are mostly outsders to Hadoop and cannot fulfll many mportant requrements, such as user constrants and schedulng optmzatons. In ths paper, we present IWFMS, an nternal workflow schedulng system/optmzer that 1) Manage the resource allocaton and executon of jobs n workflows to acheve hgher effcency, 2) Schedule workflows to meet a much rcher set of user constrants such as deadlnes, prortes and workflow trgger events. We dscuss the archtecture of ts key components and evaluate ts features and performance. KEYWORDS IWFMS; Hadoop; Workflow Management; Optmzaton; User Constrants. 1 INTRODUCTION Hadoop [1] s a massvely scalable parallel computaton platform capable of runnng many thousands of jobs per day. Wth the user group growng, bg data n ts raw form rarely satsfes the common user and Hadoop developer's data requrements for performng data processng tasks. Frameworks that help automate ths ncreasngly complex process and codfy work nto repeatable unts or workflows that can be reused over tme wthout the need to wrte any new code or steps are essental layer of Hadoop for common user and more complcated seres of work, such as Ooze[2], Azkaban[3]. These systems, known as workflow engnes, provde a mult-tenant servce that effectvely manages dverse jobs wrtten n a varety of tools and languages, and n the same tme, has an nterface whch s user-frendly and qute convenent. These systems also allow users to specfy constrants. For example, model workflow executon trggers n the form of the data, tme or event predcates, the workflow job s started after those predcates are satsfed. However, these workflow engnes are external workflow submttng systems whch submt workflow as ndependent, unrelated jobs and provde very few executon optmzatons. The cluster then schedule these jobs wthout consderng the relatonshp between them, ths desgn structure s a great restrct to the potental performance mprovement of workflow executon, furthermore, the user constrants are also lmted, supported trgger events are usually tme ntervals or data avalablty but cannot be complcated crcumstances that nvolve cluster condtons or schedulng nformaton. These factors have restrcted the scenaros n whch workflow engnes could have been more wdely used. In ths paper, we ntroduce a new management system and optmzer for workflow applcatons, the Internal Workflow Management System (IWFMS [4]). It allows users to buld complex dependency structure lke data transformatons or decson branches out of multple component jobs cost effectvely, whch nhert the superortes of exsted workflow engnes, whle at the same tme, t provdes a rcher set of user ISBN: SDIWC 59
2 constrant optons, ncreased system utlzaton and a sgnfcant reducton n the workflow completon tme. IWFMS s archtected to work as a plug-n for Hadoop, unlke other exsted workflow mplementatons, IWFMS provdes servce for both users and the clusters. Its core module, the WFScheduler, mantans the cluster nformaton and helps optmze workflow jobs executon, clusters wth IWFMS nstalled can recognze workflow jobs from ordnary jobs and schedule them accordng to ther workflow structures and confguratons. IWFMS can also be used as a sngle optmzer whch wll collaborate smoothly wth man workflow engnes lke Ooze. Organzatons that have been usng tradtonal workflow management systems may not want to change the user nterface for nteractve workflow management and APIs for ntegraton, under these crcumstances, they can abandon the user servce part of IWFMS (although not recommended) and just plug WFScheduler nto Hadoop, ths wll provde most of the workflow executon optmzatons from IWFMS and, wth some manual modfcatons to the confguraton fle, full package of new user constrants. Ths rest of ths paper s organzed as follows: n secton 2 we explore related workflow systems and dentfy ther shortcomngs wth respect to Hadoop requrements. Secton 3 provdes a bref ntroducton to workflow applcatons. Secton 4 descrbes the desgn and mplementaton of IWFMS. In secton 5 we present the expermental setup for measurement and dscuss the results for IWFMS performance. Fnally we summarze our current work and dscuss our future work n secton 6. 2 RELATED WORKS Scentfc workflow on clusters and grds have been studed extensvely, many workflow management systems exst for varous usage needs such as [5-8]. In ths secton, we dscuss a few exstng workflow management systems along wth ther benefts and shortcomngs. Ooze[2] s a Java Web applcaton that combnes multple Hadoop jobs sequentally nto one logcal unt of work. There are two types of Ooze jobs: Ooze Workflow jobs and Ooze Coordnator jobs, the former are a sequence of actons that form a Drected Acyclc Graphs (DAGs), and the latter are recurrent workflow jobs that are trggered by tme and data avalablty. Ooze makes t easy to control over complex jobs and repeat them at predetermned ntervals. However, due to ts complete separaton from clusters, t s more a workflow bulder and auto-submtter than a full-functon workflow management system. It consders lttle about Hadoop clusters condtons and provdes none nformaton about the workflow applcatons to Hadoop, what Ooze does s submttng any jobs as soon as they are ready to be executed, and then leave them to Hadoop wthout executon optmzaton towards ther workflow structures and data dependency. The Pegasus [9] system provdes a comprehensve soluton for constructng and enactng scentfc workflows on the NCSA TeraGrd [10]. Pegasus enables the workflows to be executed locally n a smultaneous manner. It montors the executon performance and provdes mechansms to mplement optmzaton technques. However, Pegasus seems to be not qute sutable for Hadoop clusters, and cannot fulfll the requrements under many scenaros. Azkaban [3] s a batch workflow job scheduler created by LnkedIn to run ther Hadoop jobs. It also provdes an easy to use web user nterface to mantan and track ther workflow applcatons. Azkaban executes all workflow jobs as part of a sngle server process, whch does not support authorzaton for job submsson and control. It shares the same advantages of most exstng management systems that are easy to use and user-frendly, but t provdes even fewer optons for user constrants than Ooze, and lacks sgnfcant features requred for a workflow management system. ISBN: SDIWC 60
3 There are several other e-scence tools that help construct and execute workflows usng local and/or remote data[11-14], n comparson, IWFMS s dfferent from exstng workflow systems n that part of t works nsde Hadoop, ths consttuton breaks the obstacle between management system and Hadoop, whch leaves far more space for optmzaton technques and user customzatons. 3 BACKGROUND 3.1 Workflow Applcaton A workflow applcaton s a collecton of actons (.e. Hadoop Map/Reduce jobs, Pg jobs, scrpts or executable fles) arranged n a control dependency Drect Acyclc Graph (DAG), specfyng a sequence of actons executon. A launched Hadoop workflow applcaton conssts of a seres of submtted or uncommtted Hadoop jobs due to whether ther dependences are satsfed. A workflow engne usually n charge of construct the dependency DAG and set ts trggers, when the trggers are satsfed, the workflow engne wll start submttng jobs n the workflow applcaton accordng to ther DAG poston. The DAG graph s specfed n some knds of descrptve language, n our mplementaton, we use hpdl, a XML Process Defnton Language, whch s almost the same as what Ooze uses, except that we add some new constrant nodes to the grammar. 3.2 hpdl Language hpdl s a farly compact language, t uses a lmted amount of flow control and acton nodes. Control nodes defne the flow of executon, whch ncludes mechansms to control the workflow executon path lke decson, fork or jon operaton, and begnnng/end of a workflow such as start, end and fal nodes. Acton nodes are the mechansm by whch a workflow trggers the executon of a computaton/processng job, the job can be wrtten n a varety of tools and languages, e.g. Hadoop map-reduce jobs, executable fles, shell or Python scrpts and sub-workflows. 3.3 DAG Path In ths paper, DAG path concept s very mportant to our optmzaton technques. A DAG path of the workflow applcaton contans all the acton nodes (jobs) along a drected path from the start node to the end node. A workflow job may belong to multple paths, and a DAG path s called crtcal path n ths paper f ts jobs get the heavest sum total workload. A workflow applcaton s completon tme s decded by the duraton of crtcal path. 4 FEATURES and IMPLEMENTATION In ths secton, we frst descrbe the overvew of IWFMS's superorty and functons. Then we dscuss how WFScheduler addresses ts key functons n subsequent sub-sectons. 4.1 Desgn Goals Both the workflow jobs and ordnary jobs arrve randomly to the cluster, the former may be drven by WFEngne or external workflow engnes lke Ooze or Azkaban et al. When a job s submtted, by checkng the dstrbuted cache, we frst decde whether t s a workflow job. If the job belongs to a workflow applcaton, we read and analyss the confguraton fle along wth the job submsson fle to get to know whch workflow t belongs to and the poston of the DAG structure t les n, besdes, f the job s the frst job submtted of a workflow applcaton, we also load and mantan the nformaton of the workflow and the user-specfed confguraton, accordng to whch we manage the workflow's lfecycle (such as sleep, nvoke and launch) and optmze ts executon. Durng the workflow executon, we observe the process rate and dynamcally estmate the executon tme of each DAG path to dentfy the crtcal path, then we adjust resource allocaton and data dstrbuton for jobs on each path to acheve a shortest overall executon tme, whch s determned by the crtcal path. As the completon tme tends to be ndcated by montorng the processng cost of jobs on crtcal path, the resource needed for ISBN: SDIWC 61
4 each jobs of the workflow applcaton can be computed to meet the deadlne (f specfed), one of the desgn goals s to maxmze the number of workflow applcatons whle satsfyng the deadlnes. The desgn goals for IWFMS were: (1) Help Hadoop to recognze jobs submtted that belong to workflow applcatons, be aware of the workflow applcatons' DAG structures and adjust schedulng strategy accordngly. (2) Dynamcally allocate resources n cluster to meet the gven deadlne of workflow applcatons based on the observed progress rate acheved by whose jobs. (3) Dynamcally allocate resources for jobs on dfferent DAG paths of a workflow applcaton to acheve hgher resource utlzaton and shortest total completon tme. (4) Provde more trgger mechansms by mantanng cluster status nformaton and montorng jobs and workflow applcatons. 4.2 IWFMS Archtecture IWFMS conssts of two major parts, WFEngne and WFScheduler. WFEngne provdes user nterface for constructng and submttng workflow applcatons. WFScheduler s the kernel component for IWFMS to mplement workflow executon optmzng mechansms. WFScheduler s developed as a contrb module for Hadoop, and we have mplemented varous versons that support dfferent job schedulng strateges for Hadoop such as Far, Capacty etc. Fgure 1 shows the basc archtecture of the WFScheduler, whch s dvded nto several modules. WFScheduler works as a mddle layer between Hadoop JobTracker and Hadoop scheduler (FIFO, Far, Capacty etc.), t detects jobs of workflow applcatons and manage them whle does not nfluence the schedulng of ordnary jobs. We have separated the orgnal Hadoop schedulng part from WFScheduler and make t a pluggable module, however due to the archtecture of Hadoop tself, the WFScheduler, along wth other scheduler contaned, works together as a pluggable module for Hadoop. Job Added Job Completed Job Updated Lstener Has Cache fles: Workflow.xml Yes hpdl Parser Workflow App Manager Workflow Queues No Comparator Job Queues Hadoop Scheduler New Avaable Jobs Fgure 1 WFScheduler Internal Archtecture The core modules of WFScheduler are: Workflow Manager: Ths module keeps track of submtted workflow applcatons, n charge of managng ther lfecycles and resource allocaton, t also responds to workflow trgger events by addng jobs of the workflow that was trggered to the scheduler ntalze queue. The workflow queue mantans the nformaton about all runnng and watng workflow applcaton, ncludng node dstrbuton and runtme condton. Workflow ProgressRate Watcher: Ths module montor the progress rate of each runnng workflow applcatons, more specfcally, t compute each path's progress rate of the workflow applcatons by observng the runnng cost of jobs on dfferent paths, based on whch t hereby estmate the completon tme of crtcal path and resource needed for other paths. Cluster Watcher: Ths module keeps track of the cluster nformaton. It watches cluster nodes condtons and job runnng stats, gathers mportant ( or regstered ) events then send them to the core center, Workflow Manager, n whch certan reacton wll be determned. hpdl parser: The hpdl parser exsts n both WFEngne and WFScheduler. It serves as a xml format hpdl language fle parser whch extract nformaton needed ISBN: SDIWC 62
5 about a certan workflow applcaton, such as, nvoke condtons, dependency between jobs, workflow jobs nformaton, user constrants etc. Hadoop Scheduler: The Hadoop scheduler works almost the same as tradtonal Hadoop scheduler, for nstance, Far Scheduler [15] and Capacty Scheduler [16]. The other parts of WFScheduler work as a mddle layer between Hadoop JobTracker and Hadoop scheduler. In fact, most task schedulers for Hadoop, whch serves as pluggable modules, can easly be modfed nto IWFMS s Hadoop scheduler, thus, as mentoned above, IWFMS can support dfferent job schedulng strateges for Hadoop. 4.3 Workflow Job Schedulng The schedulng strategy of workflow jobs and tradtonal jobs dffers n several aspects. There are varous factors that may nfluence the resource allocaton and runnng prorty of a workflow job, for example, the use defned deadlne of workflow applcaton the job belongs to, the total resource needed for the workflow DAG path the job s n, dstrbuton of nput data and the dependency property. We take these factors nto consderaton n order to acheve hgher executon effcency Workflow Deadlne Estmaton To estmaton the total duraton of a workflow applcaton we need to assess the completon tme of each workflow paths. The crtcal path, whose jobs have the heavest workload and longest total completon tme, decdes when the workflow applcaton wll fnally complete. In our mplementaton, to balance the progress rate of whole workflow, we need not only the duraton of the crtcal path but also ones of each workflow path wth certan amount of resources allocated. Accordngly, we can dynamcally decde how many resources the currently runnng job on each DAG path need. We develop an ntal estmaton model based a set of assumptons: 1) The cluster conssts of homogeneous nodes, so that the tme cost of processng for each map or reduce task s equal; 2) The tme cost of unntalzed jobs task can be approxmated by the average tme cost of all map or reduce tasks on the DAG path; 3) Input data s ether already avalable n HDFS or wll successfully outputted by dependent job. We extend the estmaton model used by [17-18], and combne technques proposed n [19] to t for workflow schedule envronment. In our workflow estmaton model, we ntroduce Hadoop specfc notatons T, P, J, I, n m, n r, C m, C r, f m, f r, S, as descrbed below: T = {T p1,,t pk }: The estmated complete tme of path. P = (J 1, J 2, J N ): Workflow DAG paths, whch consst of a seres of jobs and connect the start node and the end node. J = (t m1, t m2 t mu,t r1,,t rv ): A Hadoop workflow job that corresponds to an acton node of the workflow DAG. I = { I p1, I p2,,i pk }: I p represents nput data of the frst job of path P. n m, n r : Number of map/reduce slots assgned to job. Cm = {C m J }: Cost of processng a unt data n map task. Cr = {C r J }: Cost of processng a unt data n reduce task. f m : Map flter rato. The fracton of nput that the map process produces as output of job. f r : Reduce flter rato. The fracton of nput that the reduce process produces as output of job. S = { S J}: Start tme of frst map task for path. Our schedulng strategy s based on followng expressons, n whch j means currently the cluster s schedulng the j-th job of path k: ISBN: SDIWC 63
6 j T Pk = S k + I j 1 J f l m f l l=1 r C m =0 j n m j 1 + I J f l m f l l=1 r C r =0 N n r + I Jj(f m f r ) j C m n m k =j+1 N + I Jj(f m f r ) j C r =j+1 n r k (1) T P T Pj (where P, P j P ) (2) K avaableslots m = nk m k=0 K k avaableslots r = n r k=0 (3) (4) In bref, we calculate how many resources a job on a workflow DAG can get based on the workload ths path left, average process tme and the total amount of resources ths workflow applcaton can get. When a job belongs to multple DAG paths, the slots t can share s decded by the maxmum number of ts paths need dynamcally Schedulng Algorthms The optmzaton of workflow jobs s based on followng prncples: 1) Jobs and ther tasks on dfferent paths get only enough resources they need so dfferent paths of a workflow applcaton end at smlar tme, whch makes sure that the path wth the heavest work load get the most resources and hghest runnng prorty comparng to jobs on other paths of ths workflow applcaton. 2) Based on workflow DAG structure and jobs data dependency, tasks are scheduled to be data-local to the utmost. 3) Workflow applcatons that are n sleep state watng for user specfed events should release ther resources and take only mnmum space, by whch approach the workload of scheduler wll be kept n an acceptable level. To acheve these goals, the WFScheduler sometmes need to temporarly hold certan resources and reserve them for the rght job to be launched or ntalzed. Shown n Algorthm 1, we mplement a custom comparator to mantan the prorty of slots allocaton between jobs of same or dfferent workflow applcatons. Durng the task assgnment, we dynamcally calculate the slots need for the next job to execute on the path and start to reserve slots before the current job ends, through ths method, IWFMS ensures a sgnfcantly hgher percentage of local-tasks. Compared to the tme saved of communcaton cost of ntermedate data, the temporary ISBN: SDIWC 64
7 reservaton cost can almost be gnored, whch we wll testfy by experments n Secton 5. The task assgnment and reservaton strategy s presented n Algorthm 2, the pseudo-code descrbes the man dea of the technques, whle n practce, ths strategy s actually mplemented by multple modules and s hard to be covered n one sngle functon. 5 EXPERIMENTAL RESULTS AND ANALYSIS In ths secton, we evaluate the benefts of IWFMS, whch contan the performance mprovement of workflow applcatons and man IWFMS characterstcs, ncludng user customzatons lke deadlne and trggers. We ran seres of Hadoop workflow jobs that had unbalanced DAG structure and data dependency between jobs, whch are common type of operaton performed by MapReduce. Then we added varous types of constrants lke deadlne, prortes and trgger events to the submtted workflow applcaton. 5.1 Expermental Setup Snce buldng an ndustral grade dstrbuted system wth thousands of machnes s beyond the scope of our ablty, to evaluate the performance of IWFMS, our experments were conducted n an expermental cluster whch conssted of 4 physcal nodes wth 3 as TaskTrackers and 1 as JobTracker. Each node specfcaton was: 63GB man memory, 23 Intel Xeon 2.40GHz processors runnng Ubuntu. Hadoop verson was used n the cluster, along wth Ooze verson on another node as baselne system. TaskTrackers had 8 map slots and 4 reduce slots, most confguraton parameters were default values. As baselne system, we nstalled Ooze verson on another machne whch was used for submttng workflow jobs. In the baselne system, workflow jobs ran on the same cluster whle wthout IWFMS nstalled. 5.2 Results Performance Improvement Fgure 2 and Fgure 3 shows the task allocaton results for the same workflow applcaton runnng n cluster wth or wthout IWMFS. We can see that the tasks allocaton s done qute dfferently, n IWFMS, jobs on lght-workload path get lmted amount of resources whle ones on crtcal path can obtan more slots, the slots lmts make each path of the workflow ISBN: SDIWC 65
8 applcaton ends at smlar tme. On the other sde, we notce that jobs runnng n tradtonal Hadoop system wthout IWFMS acqure slots based only on the tme they are launched, whch leads to a lower utlzaton rate and longer total tme cost. Table 1 Consttuents of workflow applcatons Exp1 Exp2 Exp3 Exp4 Exp5 Exp6 Balanced 100% 80% 60% 40% 20% 0% Unbalanced 0% 20% 40% 60% 80% 100% Fgure 2 Task allocaton n Hadoop+Ooze Fgure 4 Performance of IWFMS To evaluate the performance mprovement further, we ran a seres of workflow applcatons from Ooze examples that were slghtly modfed and had dfferent DAG structures. Fgure 4 llustrates that compared to baselne system; IWFMS exhbts 12%-36% makespan reducton Meetng workflow deadlnes Fgure 3 Task allocaton n Hadoop+IWFMS Another mportant reason for the performance speedup s dstrbuton of slots allocated. In Hadoop wth IWFMS, the majorty of workflow tasks are data-local tasks, thus there are much fewer data transfer cost due to more local computatons, whch would beneft executon effcency for both balanced and unbalanced workflow applcatons. Fgure 5 Task allocaton under dfferent deadlnes In our next experment we tested the effectveness of workflow deadlne constrant. Fgure X shows the task allocaton results for the same workflow applcaton run-nng on ISBN: SDIWC 66
9 cluster wth dfferent deadlnes or wthout deadlnes specfed. For 400s deadlne, the task lmt s 20; whle for 800s deadlne, maxmum tasks allocated are lmted to be no more than In both cases wth deadlnes specfed, the workflow deadlne s met and the WFScheduler ensures that durng the workflow applcatons executon, enough slots are met for each path of the workflow Other user constrants 6 CONCLUSION and FUTURE WORKS In ths paper, we ntroduce our mplementaton of workflow management system that has brand new desgn archtecture. Unlke other workflow engnes, t cares about when and where the workflow jobs wll execute and knows about the condtons of Hadoop cluster. IWFMS provdes us more effcent executon of workflow jobs, at the same tme, workflow applcatons are no longer offlne jobs wth the applyng of IWFMS. Future work ncludes desgnng and mplementng a scrpt language for the user constrant operatons, through whch users wll gan much greater control to ther workflow applcaton. REFERENCES Fgure 6 Task allocaton wth trgger event set Fgure 6 shows the workflow executon when we set trgger event(s), n ths case, the trgger event s when some jobs whose names contan one partcular strng are done, we can see that before the trgger event happened, the workflow applcaton was asleep, and then the trgger event nvoked t and WFScheduler added t to the runnng queue. In fact, the trgger event confguraton s qute flexble and can be easly set n the confgure fle submtted along wth job fles, for example, we can assgn some workflow applcatons to be executed only when cluster s n lghtworkload, what we need to do s set the global confguraton secton n workflow.xml fle. However these user constrants cannot be satsfed usng other workflow engnes lke Ooze and Azkaban, because they don t mantan any nformaton about the cluster and Hadoop, n fact, they don t even stop submttng jobs when Hadoop s not n servce. [1] Apache Hadoop. (n.d.). Retreved October 27, 2014 from [2] Apache Ooze. (n.d.). Retreved October 27, 2014 from [3] The Azkaban Project. (n.d.). Retreved October 27, 2012 from [4] The IWFMS Project. (n.d.). Retrved October 27, 2014 from [5] Bowers, S., & Ludäscher, B. (2005). Actor-orented desgn of scentfc workflows. In Conceptual Modelng ER 2005 (pp ). Sprnger Berln Hedelberg. [6] Ludäscher, B., Altntas, I., Berkley, C., Hggns, D., Jaeger, E., Jones, M.,... & Zhao, Y. (2006). Scentfc workflow management and the Kepler system. Concurrency and Computaton: Practce and Experence, 18(10), [7] Majtha, S., Shelds, M., Taylor, I., & Wang, I. (2004, July). Trana: A graphcal web servce composton and executon toolkt. In Web Servces, Proceedngs. IEEE Internatonal Conference on (pp ). IEEE. [8] Onn, T., Greenwood, M., Adds, M., Alpdemr, M. N., Ferrs, J., Glover, K.,... & Wroe, C. (2006). Taverna: lessons n creatng a workflow envronment for the lfe scences. Concurrency and Computaton: Practce and Experence, 18(10), [9] Sngh, G., Su, M. H., Vah, K., Deelman, E., Berrman, B., Good, J.,... & Mehta, G. (2008, January). Workflow task clusterng for best effort systems wth Pegasus. In Proceedngs of the 15th ACM Mard Gras conference: From lghtweght mash-ups to lambda grds: Understandng the spectrum of dstrbuted computng requrements, applcatons, tools, nfrastructures, nteroperablty, and the ncremental adopton of key capabltes (p. 9). ACM. [10] Catlett, C. The phlosophy of TeraGrd: buldng an open, extensble, dstrbuted TeraScale faclty. ISBN: SDIWC 67
10 Cluster Computng and the Grd 2nd IEEE/ACM Internatonal Symposum CCGRID2002, [11] Deelman, E., Gannon, D., Shelds, M., & Taylor, I. (2009). Workflows and e-scence: An overvew of workflow system features and capabltes. Future Generaton Computer Systems, 25(5), [12] Kepler. (n.d.). Retreved October 27, 2014 from [13] Wang, J., Crawl, D., & Altntas, I. (2009, November). Kepler+ Hadoop: a general archtecture facltatng data-ntensve applcatons n scentfc workflow systems. In Proceedngs of the 4th Workshop on Workflows n Support of Large-Scale Scence (p. 12). ACM. [14] Taverna (n.d.). Retreved February 10, 2012 from [15] Zahara, M. (2010). The hadoop far scheduler. [16] Hadoop s Capacty Scheduler scheduler.html [17] Kc, K., & Anyanwu, K. (2010, November). Schedulng hadoop jobs to meet deadlnes. In Cloud Computng Technology and Scence (CloudCom), 2010 IEEE Second Internatonal Conference on (pp ). IEEE. [18] Ln, X., Lu, Y., Deogun, J., & Goddard, S. (2007, Aprl). Real-tme dvsble load schedulng for cluster computng. In Real Tme and Embedded Technology and Applcatons Symposum, RTAS'07. 13th IEEE (pp ). IEEE. [19] Cao, J., Jarvs, S. A., San, S., & Nudd, G. R. (2003, May). Grdflow: Workflow management for grd computng. In Cluster Computng and the Grd, Proceedngs. CCGrd rd IEEE/ACM Internatonal Symposum on (pp ). IEEE. ISBN: SDIWC 68
Fault tolerance in cloud technologies presented as a service
Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance
More informationA Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing
A Replcaton-Based and Fault Tolerant Allocaton Algorthm for Cloud Computng Tork Altameem Dept of Computer Scence, RCC, Kng Saud Unversty, PO Box: 28095 11437 Ryadh-Saud Araba Abstract The very large nfrastructure
More informationThe Development of Web Log Mining Based on Improve-K-Means Clustering Analysis
The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationA Programming Model for the Cloud Platform
Internatonal Journal of Advanced Scence and Technology A Programmng Model for the Cloud Platform Xaodong Lu School of Computer Engneerng and Scence Shangha Unversty, Shangha 200072, Chna luxaodongxht@qq.com
More informationSurvey on Virtual Machine Placement Techniques in Cloud Computing Environment
Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center
More informationOpen Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Cybernetcs & Systemcs Journal, 2014, 8, 115-121 115 Open Access A Load Balancng Strategy wth Bandwdth Constrant n Cloud Computng Jng Deng 1,*,
More informationMethodology to Determine Relationships between Performance Factors in Hadoop Cloud Computing Applications
Methodology to Determne Relatonshps between Performance Factors n Hadoop Cloud Computng Applcatons Lus Eduardo Bautsta Vllalpando 1,2, Alan Aprl 1 and Alan Abran 1 1 Department of Software Engneerng and
More informationMETHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS
METHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS Lus Eduardo Bautsta Vllalpando 1,2, Alan Aprl 1 and Alan Abran 1 1 Department of Software Engneerng
More informationPolitecnico di Torino. Porto Institutional Repository
Poltecnco d Torno Porto Insttutonal Repostory [Artcle] A cost-effectve cloud computng framework for acceleratng multmeda communcaton smulatons Orgnal Ctaton: D. Angel, E. Masala (2012). A cost-effectve
More informationA Dynamic Energy-Efficiency Mechanism for Data Center Networks
A Dynamc Energy-Effcency Mechansm for Data Center Networks Sun Lang, Zhang Jnfang, Huang Daochao, Yang Dong, Qn Yajuan A Dynamc Energy-Effcency Mechansm for Data Center Networks 1 Sun Lang, 1 Zhang Jnfang,
More informationQoS-based Scheduling of Workflow Applications on Service Grids
QoS-based Schedulng of Workflow Applcatons on Servce Grds Ja Yu, Rakumar Buyya and Chen Khong Tham Grd Computng and Dstrbuted System Laboratory Dept. of Computer Scence and Software Engneerng The Unversty
More informationAn Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems
STAN-CS-73-355 I SU-SE-73-013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part
More informationPAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign
PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of Illnos-Urbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng
More informationLITERATURE REVIEW: VARIOUS PRIORITY BASED TASK SCHEDULING ALGORITHMS IN CLOUD COMPUTING
LITERATURE REVIEW: VARIOUS PRIORITY BASED TASK SCHEDULING ALGORITHMS IN CLOUD COMPUTING 1 MS. POOJA.P.VASANI, 2 MR. NISHANT.S. SANGHANI 1 M.Tech. [Software Systems] Student, Patel College of Scence and
More informationA Cost-Effective Strategy for Intermediate Data Storage in Scientific Cloud Workflow Systems
A Cost-Effectve Strategy for Intermedate Data Storage n Scentfc Cloud Workflow Systems Dong Yuan, Yun Yang, Xao Lu, Jnjun Chen Faculty of Informaton and Communcaton Technologes, Swnburne Unversty of Technology
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationProject Networks With Mixed-Time Constraints
Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationImproved SVM in Cloud Computing Information Mining
Internatonal Journal of Grd Dstrbuton Computng Vol.8, No.1 (015), pp.33-40 http://dx.do.org/10.1457/jgdc.015.8.1.04 Improved n Cloud Computng Informaton Mnng Lvshuhong (ZhengDe polytechnc college JangSu
More informationCheckng and Testng in Nokia RMS Process
An Integrated Schedulng Mechansm for Fault-Tolerant Modular Avoncs Systems Yann-Hang Lee Mohamed Youns Jeff Zhou CISE Department Unversty of Florda Ganesvlle, FL 326 yhlee@cse.ufl.edu Advanced System Technology
More informationAn Optimal Model for Priority based Service Scheduling Policy for Cloud Computing Environment
An Optmal Model for Prorty based Servce Schedulng Polcy for Cloud Computng Envronment Dr. M. Dakshayn Dept. of ISE, BMS College of Engneerng, Bangalore, Inda. Dr. H. S. Guruprasad Dept. of ISE, BMS College
More informationA Dynamic Load Balancing for Massive Multiplayer Online Game Server
A Dynamc Load Balancng for Massve Multplayer Onlne Game Server Jungyoul Lm, Jaeyong Chung, Jnryong Km and Kwanghyun Shm Dgtal Content Research Dvson Electroncs and Telecommuncatons Research Insttute Daejeon,
More informationA Hierarchical Reliability Model of Service-Based Software System
2009 33rd Annual IEEE Internatonal Computer Software and Applcatons Conference A Herarchcal Relablty Model of Servce-Based Software System Lun Wang, Xaoyng Ba, Lzhu Zhou Department of Computer Scence and
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION
More informationIMPACT ANALYSIS OF A CELLULAR PHONE
4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng
More informationCloud Auto-Scaling with Deadline and Budget Constraints
Prelmnary verson. Fnal verson appears In Proceedngs of 11th ACM/IEEE Internatonal Conference on Grd Computng (Grd 21). Oct 25-28, 21. Brussels, Belgum. Cloud Auto-Scalng wth Deadlne and Budget Constrants
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationA New Task Scheduling Algorithm Based on Improved Genetic Algorithm
A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng Envronment Congcong Xong, Long Feng, Lxan Chen A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng
More informationDynamic Fleet Management for Cybercars
Proceedngs of the IEEE ITSC 2006 2006 IEEE Intellgent Transportaton Systems Conference Toronto, Canada, September 17-20, 2006 TC7.5 Dynamc Fleet Management for Cybercars Fenghu. Wang, Mng. Yang, Ruqng.
More informationAn Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,
More informationA hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
More informationCloud-based Social Application Deployment using Local Processing and Global Distribution
Cloud-based Socal Applcaton Deployment usng Local Processng and Global Dstrbuton Zh Wang *, Baochun L, Lfeng Sun *, and Shqang Yang * * Bejng Key Laboratory of Networked Multmeda Department of Computer
More informationA heuristic task deployment approach for load balancing
Xu Gaochao, Dong Yunmeng, Fu Xaodog, Dng Yan, Lu Peng, Zhao Ja Abstract A heurstc task deployment approach for load balancng Gaochao Xu, Yunmeng Dong, Xaodong Fu, Yan Dng, Peng Lu, Ja Zhao * College of
More informationAn ILP Formulation for Task Mapping and Scheduling on Multi-core Architectures
An ILP Formulaton for Task Mappng and Schedulng on Mult-core Archtectures Yng Y, We Han, Xn Zhao, Ahmet T. Erdogan and Tughrul Arslan Unversty of Ednburgh, The Kng's Buldngs, Mayfeld Road, Ednburgh, EH9
More informationApplication of Multi-Agents for Fault Detection and Reconfiguration of Power Distribution Systems
1 Applcaton of Mult-Agents for Fault Detecton and Reconfguraton of Power Dstrbuton Systems K. Nareshkumar, Member, IEEE, M. A. Choudhry, Senor Member, IEEE, J. La, A. Felach, Senor Member, IEEE Abstract--The
More informationRobust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School
Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management
More informationLoad Balancing By Max-Min Algorithm in Private Cloud Environment
Internatonal Journal of Scence and Research (IJSR ISSN (Onlne: 2319-7064 Index Coperncus Value (2013: 6.14 Impact Factor (2013: 4.438 Load Balancng By Max-Mn Algorthm n Prvate Cloud Envronment S M S Suntharam
More informationDynamic Resource Allocation for MapReduce with Partitioning Skew
Ths artcle has been accepted for publcaton n a future ssue of ths journal, but has not been fully edted. Content may change pror to fnal publcaton. Ctaton nformaton: DOI 1.119/TC.216.253286, IEEE Transactons
More informationMulti-Resource Fair Allocation in Heterogeneous Cloud Computing Systems
1 Mult-Resource Far Allocaton n Heterogeneous Cloud Computng Systems We Wang, Student Member, IEEE, Ben Lang, Senor Member, IEEE, Baochun L, Senor Member, IEEE Abstract We study the mult-resource allocaton
More informationHow To Solve An Onlne Control Polcy On A Vrtualzed Data Center
Dynamc Resource Allocaton and Power Management n Vrtualzed Data Centers Rahul Urgaonkar, Ulas C. Kozat, Ken Igarash, Mchael J. Neely urgaonka@usc.edu, {kozat, garash}@docomolabs-usa.com, mjneely@usc.edu
More informationFORMAL ANALYSIS FOR REAL-TIME SCHEDULING
FORMAL ANALYSIS FOR REAL-TIME SCHEDULING Bruno Dutertre and Vctora Stavrdou, SRI Internatonal, Menlo Park, CA Introducton In modern avoncs archtectures, applcaton software ncreasngly reles on servces provded
More informationOn the Optimal Control of a Cascade of Hydro-Electric Power Stations
On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationConferencing protocols and Petri net analysis
Conferencng protocols and Petr net analyss E. ANTONIDAKIS Department of Electroncs, Technologcal Educatonal Insttute of Crete, GREECE ena@chana.tecrete.gr Abstract: Durng a computer conference, users desre
More informationAN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE
AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE Yu-L Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationCost-based Scheduling of Scientific Workflow Applications on Utility Grids
Cost-based Schedulng of Scentfc Workflow Applcatons on Utlty Grds Ja Yu, Rakumar Buyya and Chen Khong Tham Grd Computng and Dstrbuted Systems Laboratory Dept. of Computer Scence and Software Engneerng
More informationA Performance Analysis of View Maintenance Techniques for Data Warehouses
A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao
More informationNetwork Aware Load-Balancing via Parallel VM Migration for Data Centers
Network Aware Load-Balancng va Parallel VM Mgraton for Data Centers Kun-Tng Chen 2, Chen Chen 12, Po-Hsang Wang 2 1 Informaton Technology Servce Center, 2 Department of Computer Scence Natonal Chao Tung
More informationSoftware project management with GAs
Informaton Scences 177 (27) 238 241 www.elsever.com/locate/ns Software project management wth GAs Enrque Alba *, J. Francsco Chcano Unversty of Málaga, Grupo GISUM, Departamento de Lenguajes y Cencas de
More informationResource Sharing Models and Heuristic Load Balancing Methods for
Resource Sharng Models and Heurstc Load Balancng Methods for Grd Schedulng Problems Wanneng Shu 1,2, Lxn Dng 2,3,*, Shenwen Wang 2,3 1 College of Computer Scence, South-Central Unversty for Natonaltes,
More informationDistributing Functionalities in a SOA-Based Multi-agent Architecture
Dstrbutng Functonaltes n a SOA-Based Mult-agent Archtecture Dante I. Tapa, Javer Bajo, and Juan M. Corchado Departamento Informátca y Automátca Unversdad de Salamanca Plaza de la Merced s/n, 37008, Salamanca,
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
Ths artcle appeared n a journal publshed by Elsever. The attached copy s furnshed to the author for nternal non-commercal research and educaton use, ncludng for nstructon at the authors nsttuton and sharng
More informationSome literature also use the term Process Control
A Formal Approach for Internal Controls Complance n Busness Processes Koumars Namr 1, Nenad Stojanovc 2 1 SAP Research Center CEC Karlsruhe, SAP AG, Vncenz-Preßntz-Str.1 76131 Karlsruhe, Germany Koumars.Namr@sap.com
More informationRate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process
Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? Real-Tme Systems Laboratory Department of Computer
More informationPerformance Evaluation of Infrastructure as Service Clouds with SLA Constraints
Performance Evaluaton of Infrastructure as Servce Clouds wth SLA Constrants Anuar Lezama Barquet, Andre Tchernykh, and Ramn Yahyapour 2 Computer Scence Department, CICESE Research Center, Ensenada, BC,
More informationA Load-Balancing Algorithm for Cluster-based Multi-core Web Servers
Journal of Computatonal Informaton Systems 7: 13 (2011) 4740-4747 Avalable at http://www.jofcs.com A Load-Balancng Algorthm for Cluster-based Mult-core Web Servers Guohua YOU, Yng ZHAO College of Informaton
More information) of the Cell class is created containing information about events associated with the cell. Events are added to the Cell instance
Calbraton Method Instances of the Cell class (one nstance for each FMS cell) contan ADC raw data and methods assocated wth each partcular FMS cell. The calbraton method ncludes event selecton (Class Cell
More informationTowards Specialization of the Contract-Aware Software Development Process
Towards Specalzaton of the Contract-Aware Software Development Process Anna Derezńska, Przemysław Ołtarzewsk Insttute of Computer Scence, Warsaw Unversty of Technology, Nowowejska 5/9, 00-665 Warsaw, Poland
More informationiavenue iavenue i i i iavenue iavenue iavenue
Saratoga Systems' enterprse-wde Avenue CRM system s a comprehensve web-enabled software soluton. Ths next generaton system enables you to effectvely manage and enhance your customer relatonshps n both
More informationGenetic Algorithm Based Optimization Model for Reliable Data Storage in Cloud Environment
Advanced Scence and Technology Letters, pp.74-79 http://dx.do.org/10.14257/astl.2014.50.12 Genetc Algorthm Based Optmzaton Model for Relable Data Storage n Cloud Envronment Feng Lu 1,2,3, Hatao Wu 1,3,
More informationSelf-Adaptive SLA-Driven Capacity Management for Internet Services
Self-Adaptve SLA-Drven Capacty Management for Internet Servces Bruno Abrahao, Vrglo Almeda and Jussara Almeda Computer Scence Department Federal Unversty of Mnas Geras, Brazl Alex Zhang, Drk Beyer and
More informationReal-Time Process Scheduling
Real-Tme Process Schedulng ktw@cse.ntu.edu.tw (Real-Tme and Embedded Systems Laboratory) Independent Process Schedulng Processes share nothng but CPU Papers for dscussons: C.L. Lu and James. W. Layland,
More informationPricing Model of Cloud Computing Service with Partial Multihoming
Prcng Model of Cloud Computng Servce wth Partal Multhomng Zhang Ru 1 Tang Bng-yong 1 1.Glorous Sun School of Busness and Managment Donghua Unversty Shangha 251 Chna E-mal:ru528369@mal.dhu.edu.cn Abstract
More informationData Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,
More informationOptimal Map Reduce Job Capacity Allocation in Cloud Systems
Optmal Map Reduce Job Capacty Allocaton n Cloud Systems Marzeh Malemajd Sharf Unversty of Technology, Iran malemajd@ce.sharf.edu Danlo Ardagna Poltecnco d Mlano, Italy danlo.ardagna@polm.t Mchele Cavotta
More informationResearch of concurrency control protocol based on the main memory database
Research of concurrency control protocol based on the man memory database Abstract Yonghua Zhang * Shjazhuang Unversty of economcs, Shjazhuang, Shjazhuang, Chna Receved 1 October 2014, www.cmnt.lv The
More informationResearch of Network System Reconfigurable Model Based on the Finite State Automation
JOURNAL OF NETWORKS, VOL., NO. 5, MAY 24 237 Research of Network System Reconfgurable Model Based on the Fnte State Automaton Shenghan Zhou and Wenbng Chang School of Relablty and System Engneerng, Behang
More informationAllocating Time and Resources in Project Management Under Uncertainty
Proceedngs of the 36th Hawa Internatonal Conference on System Scences - 23 Allocatng Tme and Resources n Project Management Under Uncertanty Mark A. Turnqust School of Cvl and Envronmental Eng. Cornell
More informationDynamic Pricing for Smart Grid with Reinforcement Learning
Dynamc Prcng for Smart Grd wth Renforcement Learnng Byung-Gook Km, Yu Zhang, Mhaela van der Schaar, and Jang-Won Lee Samsung Electroncs, Suwon, Korea Department of Electrcal Engneerng, UCLA, Los Angeles,
More informationA New Quality of Service Metric for Hard/Soft Real-Time Applications
A New Qualty of Servce Metrc for Hard/Soft Real-Tme Applcatons Shaoxong Hua and Gang Qu Electrcal and Computer Engneerng Department and Insttute of Advanced Computer Study Unversty of Maryland, College
More informationThe Load Balancing of Database Allocation in the Cloud
, March 3-5, 23, Hong Kong The Load Balancng of Database Allocaton n the Cloud Yu-lung Lo and Mn-Shan La Abstract Each database host n the cloud platform often has to servce more than one database applcaton
More informationBUSINESS PROCESS PERFORMANCE MANAGEMENT USING BAYESIAN BELIEF NETWORK. 0688, dskim@ssu.ac.kr
Proceedngs of the 41st Internatonal Conference on Computers & Industral Engneerng BUSINESS PROCESS PERFORMANCE MANAGEMENT USING BAYESIAN BELIEF NETWORK Yeong-bn Mn 1, Yongwoo Shn 2, Km Jeehong 1, Dongsoo
More informationRequIn, a tool for fast web traffic inference
RequIn, a tool for fast web traffc nference Olver aul, Jean Etenne Kba GET/INT, LOR Department 9 rue Charles Fourer 90 Evry, France Olver.aul@nt-evry.fr, Jean-Etenne.Kba@nt-evry.fr Abstract As networked
More informationProfit-Aware DVFS Enabled Resource Management of IaaS Cloud
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 0, Issue, No, March 03 ISSN (Prnt): 694-084 ISSN (Onlne): 694-0784 www.ijcsi.org 37 Proft-Aware DVFS Enabled Resource Management of IaaS Cloud
More informationPerformance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application
Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdo-dong,
More informationPeriod and Deadline Selection for Schedulability in Real-Time Systems
Perod and Deadlne Selecton for Schedulablty n Real-Tme Systems Thdapat Chantem, Xaofeng Wang, M.D. Lemmon, and X. Sharon Hu Department of Computer Scence and Engneerng, Department of Electrcal Engneerng
More informationDesign and Development of a Security Evaluation Platform Based on International Standards
Internatonal Journal of Informatcs Socety, VOL.5, NO.2 (203) 7-80 7 Desgn and Development of a Securty Evaluaton Platform Based on Internatonal Standards Yuj Takahash and Yoshm Teshgawara Graduate School
More information= (2) T a,2 a,2. T a,3 a,3. T a,1 a,1
A set of tools for buldng PostgreSQL dstrbuted databases n bomedcal envronment. M. Cavaller, R. Prudentno, U. Pozzol, G. Ren IRCCS E. Medea, Bosso Parn (LC), Italy. E-mal: gren@bp.lnf.t Abstract PostgreSQL
More informationResource Management and Organization in CROWN Grid
Resource Management and Organzaton n CROWN Grd Jnpeng Hua, Tanyu Wo, Yunhao Lu Dept. of Computer Scence and Technology, Behang Unversty Dept. of Computer Scence, Hong Kong Unversty of Scence & Technology
More informationFor example, you might want to capture security group membership changes. A quick web search may lead you to the 632 event.
Audtng Wndows & Actve Drectory Changes va Wndows Event Logs Ths document takes a lghtweght look at the steps and consderatons nvolved n settng up Wndows and/or Actve Drectory event log audtng. Settng up
More informationA Design Method of High-availability and Low-optical-loss Optical Aggregation Network Architecture
A Desgn Method of Hgh-avalablty and Low-optcal-loss Optcal Aggregaton Network Archtecture Takehro Sato, Kuntaka Ashzawa, Kazumasa Tokuhash, Dasuke Ish, Satoru Okamoto and Naoak Yamanaka Dept. of Informaton
More informationMining Multiple Large Data Sources
The Internatonal Arab Journal of Informaton Technology, Vol. 7, No. 3, July 2 24 Mnng Multple Large Data Sources Anmesh Adhkar, Pralhad Ramachandrarao 2, Bhanu Prasad 3, and Jhml Adhkar 4 Department of
More informationResource Scheduling in Desktop Grid by Grid-JQA
The 3rd Internatonal Conference on Grd and Pervasve Computng - Worshops esource Schedulng n Destop Grd by Grd-JQA L. Mohammad Khanl M. Analou Assstant professor Assstant professor C.S. Dept.Tabrz Unversty
More informationNetwork Security Situation Evaluation Method for Distributed Denial of Service
Network Securty Stuaton Evaluaton Method for Dstrbuted Denal of Servce Jn Q,2, Cu YMn,2, Huang MnHuan,2, Kuang XaoHu,2, TangHong,2 ) Scence and Technology on Informaton System Securty Laboratory, Bejng,
More informationEfficient Project Portfolio as a tool for Enterprise Risk Management
Effcent Proect Portfolo as a tool for Enterprse Rsk Management Valentn O. Nkonov Ural State Techncal Unversty Growth Traectory Consultng Company January 5, 27 Effcent Proect Portfolo as a tool for Enterprse
More informationAn Energy-Efficient Data Placement Algorithm and Node Scheduling Strategies in Cloud Computing Systems
2nd Internatonal Conference on Advances n Computer Scence and Engneerng (CSE 2013) An Energy-Effcent Data Placement Algorthm and Node Schedulng Strateges n Cloud Computng Systems Yanwen Xao Massve Data
More informationA role based access in a hierarchical sensor network architecture to provide multilevel security
1 A role based access n a herarchcal sensor network archtecture to provde multlevel securty Bswajt Panja a Sanjay Kumar Madra b and Bharat Bhargava c a Department of Computer Scenc Morehead State Unversty
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems
More informationOverview of monitoring and evaluation
540 Toolkt to Combat Traffckng n Persons Tool 10.1 Overvew of montorng and evaluaton Overvew Ths tool brefly descrbes both montorng and evaluaton, and the dstncton between the two. What s montorng? Montorng
More informationLinear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits
Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.
More informationCourse outline. Financial Time Series Analysis. Overview. Data analysis. Predictive signal. Trading strategy
Fnancal Tme Seres Analyss Patrck McSharry patrck@mcsharry.net www.mcsharry.net Trnty Term 2014 Mathematcal Insttute Unversty of Oxford Course outlne 1. Data analyss, probablty, correlatons, vsualsaton
More informationDynamic Scheduling of Emergency Department Resources
Dynamc Schedulng of Emergency Department Resources Junchao Xao Laboratory for Internet Software Technologes, Insttute of Software, Chnese Academy of Scences P.O.Box 8718, No. 4 South Fourth Street, Zhong
More informationPower Consumption Optimization Strategy of Cloud Workflow. Scheduling Based on SLA
Power Consumpton Optmzaton Strategy of Cloud Workflow Schedulng Based on SLA YONGHONG LUO, SHUREN ZHOU School of Computer and Communcaton Engneerng Changsha Unversty of Scence and Technology 960, 2nd Secton,
More informationJ. Parallel Distrib. Comput. Environment-conscious scheduling of HPC applications on distributed Cloud-oriented data centers
J. Parallel Dstrb. Comput. 71 (2011) 732 749 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. ournal homepage: www.elsever.com/locate/pdc Envronment-conscous schedulng of HPC applcatons
More informationSangam - Efficient Cellular-WiFi CDN-P2P Group Framework for File Sharing Service
Sangam - Effcent Cellular-WF CDN-P2P Group Framework for Fle Sharng Servce Anjal Srdhar Unversty of Illnos, Urbana-Champagn Urbana, USA srdhar3@llnos.edu Klara Nahrstedt Unversty of Illnos, Urbana-Champagn
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More information