A Hadoop Job Scheduling Model Based on Uncategorized Slot

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "A Hadoop Job Scheduling Model Based on Uncategorized Slot"

Transcription

1 Journl of Communctons Vol. 10, No. 10, October 2015 A Hdoop Job Schedulng Model Bsed on Unctegored Slot To Xue nd Tng-tng L Deprtment of Computer Scence, X n Polytechnc Unversty, X n , Chn Eml: Abstrct As Job schedulng s becomng n mportnt prt of Hdoop frmework t present, job schedulng model bsed on unctegored ws reserched on ths pper. It could elmnte the lmtton of Job Tsk type nd ddn t dstngush between Mp nd Reduce ny more, however there ws only one type of left whch could be ssgned to execute the Mp tsks nd to run the Reduce tsks. By doptng Reduce dynmc prttonng, t cn rele swtchng smoothly the between two types of tsks, menwhle, compred wth the FIFO lgorthm whch need dstngush the type of, the expermentl result shows tht the model not only mproves the resources utlton nd betters lod blncng, but lso enhnces the prllelsm of tsks nd shortens the executon tme of the Job Tsks. Index Terms Dynmc prttonng lgorthms, Hdoop, job schedulng lgorthms, MpReduce I. INTRODUCTION Wth the hgh-speed development of the Internet nd the rpd growth of customer number, the mount of dt growth rte lso presents exponentl growth, whch mkes Bg Dt become the most populr serch term currently. Fcng such lrge mount of dt, the trdtonl pproch cnnot hndle t wth the d of exstng tools or technques. Along wth the rpd development of softwre technology, dstrbuted pltforms hve sprung up. In numerous dstrbuted processng pltforms, Apche Hdoop [1], due to the powerful dstrbuted computng frmework of MpReduce, s by fr the most ctve nd wdely used pltform. By doptng the de of dvde nd conquer, MpReduce s knd of low cost nd hgh effcency pproch. It connects lrge number of low-cost PC ech other formed cluster to del wth mss dt storge nd nlyss. In nutshell, the trdtonl processng s replced by dstrbuted processng n the feld of bg dt processng. Hdoop pltform hdes the underlyng mplementton detls for developers. In ths pltform, you only need to wrte the Mp nd the Reduce functons ccordng to the Mnuscrpt receved My 24, 2015; revsed September 23, Ths work ws supported by the Chn's Ntonl Development nd Reform Commsson (NDRC) nd Hgh-tech ndustrlton projects (Shnx NDRC [2009] no. 1365); X'n Polytechnc Unversty doctorl reserch strt-up fund (BS0725). Correspondng uthor eml: do: /jcm demnd, whch gretly smplfes the development of dstrbuted pplctons. As result, mny cloud opertors begn usng Hdoop, whch mkes the number of users nd ctve frequency constntly rsng; therefore the performnce of Hdoop pltform promoton s more nd more mportnt. In the study of Hdoop, job schedulng s lwys key pont of the reserch. Ths rtcle puts forwrd new knd of Hdoop job schedulng model. The remnder of ths pper s orgned s follows: Secton II revews the relted work. Secton III descrbes the lgorthm nd mplementton of job schedule model bsed on unctegored. Experment nd performnce nlyss re studed n Secton IV. Secton V, concludes the work of ths pper nd outlnes the future work. II. RELATED WORK In order to smplfy the resources llocton, Hdoop dopts the model bsed on the resources. Slot s the bsc unt of the msson n the MpReduce, whch s from the mult-dmensonl resources (CPU, MM, IO, etc.) to one dmensonl n TskTrcker node. Although there hs been mny schedulng lgorthms, none hve unfed resource llocton model. When the Mp tsks run, t tkes up the Mp. Whle the Reduce tsks execute, t occupy the Reduce. In other words, the two dfferent types of occupy ther own resources respectvely nd no shrng consderton. On TskTrcker node confgurton, ech node hs two Mp s nd one Reduce by defult, nd the Mp s only responsble for the Mp tsks nd the Reduce s only responsble for executng the Reduce tsk, whch lrgely decrese the tsk prllelsm nd resources utlton. Hdoop pltform possesses three lgorthms of schedulng, FIFO Scheduler [2], Fr Scheduler [3] nd Cpcty Scheduler [4]. The defult schedulng lgorthm s FIFO n ths pltform. In ddton, numerous of schedulng lgorthms re comng nto beng. For exmple, Dely Scheduler [5], whch s bsed on enhncng dt loclty; Dynmc Proportonl Scheduler [6], whch s bsed on user preferences nd chngng the wy of tsk llocton proporton nd dynmc prorty; Constrnt-Bsed Scheduler [7], whch s bsed on dedlne of Rel-tme; [8] proposed schedulng lgorthm whch consders when the tsk scheduler cn't choose the Dt-locl tsk whether t llows to ssgn the Non-locl tsk or not; [9] proposed schedulng lgorthm 2015 Journl of Communctons 778

2 Journl of Communctons Vol. 10, No. 10, October 2015 whch s bsed on the number of Mp tsk node nd dt sheet replcton mode; LATE [10] (Longest Approxmte Tme to End) nd SAMR [11] (Self-dptve MpReduce Schedulng Algorthm), whch re bsed on under heterogeneous envronment how to mprove the schedulng effcency; [12] nd [13] proposed schedulng lgorthm whch re bsed on job types clssfyng nd the lod dynmc of heterogeneous; [14] proposed schedulng lgorthm whch s bsed on the dptve node cpcty; [15] proposed schedulng lgorthm whch s bsed on mtchng rules; beyond bove, the scheduler bsed on the ntellgent lgorthm nd smulted nnelng lgorthm [16] nd rtfcl fsh lgorthm [17] nd genetc lgorthm [18]; etc. however ll of these schedulng lgorthm don t consder from the resources llocton model, ther tsk schedulng strtegy s to dstngush the type. Ths pper presents schedulng model bsed on unctegored, usng only one type of resource. The cn be ether ssgned to run the Mp tsk or the Reduce tsk, mprovng the utlton rte of nd tsks prllelsm nd resources utlton. III. SCHEDULING MODEL BASED ON UNCATEGORIZED SLOT In the schedulng model bsed on unctegored, resources model expressed by one knd of, whch cn run both of the Mp tsks nd Reduce tsk, specfc llocte wht knd of ccordng to the executon of job progress nd the tsk scheduler s shown n Fg. 1. The key problem of schedulng model bsed on unctegored s how to mke the n smooth swtchng between two dfferent types of tsks. Becuse the demnd resources for the Mp tsks nd the Reduce tsks re dfferent, so we need to desgn the unfed resources representton model. Accordng to the bove resons we need to do followng four steps: 1) schedulng model relted defntons; 2) resources model representton; 3) dynmc prttonng; 4) schedulng lgorthm mplementton. TskTrcker 1 tsk tsk JobTrcker tsk Fg. 1. Tsk llocton model bsed on unctegored. A. Schedulng Model Relted Defntons TskTrcker 2 Becuse of the Reduce tsk nput source dt s from the Mp phse output dt, so the Reduce phse hs dt dependences wth the Mp phse. When the Mp tsk process s completed, the dt buffer storge to the locl dsk to next sortng work. In the schedulng model to dstngush the type, R s sttc vlue nd represents the number of Reduce s. The prtton functon dvded the dt nto R peces of dt blocks then R represents the number of Reduce Tsks nd ech Reduce tsk shufflng mddle results of dt submtted to the correspondng Reduce functon. The MpReduce dt flow s shown n Fg. 2. Fg. 2. MpReduce dt flow. In the unctegored model, the ntl vlue of R s 1. Becuse the vlue of R wll chnge long wth the number of s ssgned to the Reduce tsk, ths wll chnge the drecton of dt flow whch ws generted by the Mp tsk. In order to blnce ech drecton of dt flow nd dt skew stuton doesn t pper, so we need to get resources nformton nd dt through Gngl n job runtme. Gngl s n open source cluster montorng softwre, whch cn montor nd dsply vrous knds of sttus nformton n the cluster nodes, such s CPU, Memory, hrd dsk utlton, I/O worklod, Network trffc stuton, etc. Becuse Gngl does lttle to the consumpton of computng resources nd whch s fully comptble wth Hdoop, so deploy RRDTool nd gmetd 2015 Journl of Communctons 779

3 Journl of Communctons Vol. 10, No. 10, October 2015 whch summry of cluster resources on the JobTrcker node nd deploy gmond whch collecton of ech node resources on the TskTrcker node s very convenent. We cn defne the concept of the rte rto of Mp nd Reduce from the nformton collected bove. Gettng the S m whch s totl nternl dt output per unt tme n the Mp phse nd the S r whch s the mount of dt processed per unt tme n Reduce phse, so s the speed rto. Prmeter s the key determnnts of the whether to execute the Mp tsks or the Reduce tsks. s r (1) In cse the ntermedte dt to be covered by runnng too mny Mp tsks or processng speed too slow by runnng too mny Reduce tsks, we hve to defne two vrble prmeters, whch re the rnge of, LowLmt (LL) [19] nd UpperLmt (UL), through the two prmeters to djust the number of whch execute dfferent types of tsks. B. Slot Resources Model Representton In the process of tsk executon, not only the Mp phse nd the Reduce phse demnd for dfferent resources, but lso the chld n the process demnds for dfferent resources too t sme tme. Such s, copy the block of dt mnly usng the network I/O nd dsk I/O resources t the begnnng of the Reduce phse nd n the process of the shuffle. Then the CPU s the mn use of resources n the process of the Reduce phse. So we cn control the resources by chngng vrous prmeters. In the followng three equtons, set R represents the model of the wth fve dmensons group resources, represents the elements n the resources model, represents correspondng element weght vlue of resources. s R { CPU, MM, Dsk, IO, DskIO } (2) 5 1 m (3) 5 1 (4) 1 s vlue wll dynmc chnge n the dfferent phse of job executon long wth the hstorcl sttstcs of JobTrcker nd the current mplementton. Here ntroduce Dynmc Stblty Control (DSC) [19], whch djust the number of TskTrcker s ccordng to the node lod nd the vlue dynmclly. C. Reduce Dynmc Prttonng In the sme job, the dt dependences between Mp tsks nd Reduce tsks mnly dsplys n the mddle of the block dt block replcton. The Reduce tsk cn be scheduled fter the completon of certn percentge of the Mp tsks, so n unctegored model tsk executon s stll dvded nto Mp phse nd Reduce phse. When hs been processed the Mp tsk then request tsk scheduler ssgned new tsk, the scheduler llocte the to Mp tsk or Reduce tsk ccordng to the work of mplementton. If the node llocted Reduce tsk, the went nto the Reduce phse, whch drectly cuse the R vlue nd the drecton of ntermedte dt flow chnge. For ech tsk, the frst step s smplng {key, vlue} of the dt nd estblshng n ndex tree B-tree, s shown n Fg. 3. Not lef node represents the key "bytepth", whle ech lef node represents the former two key "bytespth", nd the rnge of the prtton number s sved n the lef node, t the men tme, the sme prefx key ws ssgned to the sme lef node. lef node Fg. 3. A prtton ndex tree. / A B C A B C BA BB BC For key, the process of prtton: 1) judge the frst byte of the key, then fnd the not lef node of frst lyer; 2) ccordng to the second byte of the key, ech lef node my correspond to multple smplng (.e., multple r), then compre wth ech smples one by one nd determne whch r cn be ssgned to. In the cse of not dstngush the, the ntl vlue of R s 1, nd ts vlue wll chnge long wth the number of Reduce tsks. Here s the desgn of dynmc Hsh functon H(R): H( key) key MOD R (5) The vlue of R s synchronous, whch cn chnge wth the number of dstrbuton to the Reduce tsk, so the number of prttons nd rnge wll chnge ccordngly. The whole model s dvded nto four stges: ntl, splt, merge nd recovery stge. The ntl stge: smplng the dt n the process of Mp tsk executon, nd ccordng to the smple pont estblsh B-ndex tree. After certn percentge of the Mp tsk, frmework utomtclly ssgned to the Reduce tsk. Due to the ntl vlue of R s 1, so there s only one executng Reduce tsk, n other words, ll the smplng re ped to the ntervl {, } of ths r, s shown n Fg. 4: Fg. 4. The ntl prtton. prtton 2015 Journl of Communctons 780

4 Journl of Communctons Vol. 10, No. 10, October 2015 The splt phse: wth the development of tsk executon, the mount of dt hve ncresed n the Mp phse nd the ccumulton of ntermedte dt, forcng us to dd R x Reduces, t ths tme R x s wll be selected to execute Reduce tsks. In order to cheve the copy of the ntermedte dt block, the scheduler wll dd R x smple ponts nd then splt the orgnl prtton. The selecton of smplng ponts s on the bss of the sorted mddle dt nd then dvded nto R x eqully, thus tppng pont s the new smple pont. As shown n Fg. 5, three new smple ponts d, h, t ws dded, nd the orgnl ntervl ws dvded nto four prts {, d}, {d, h}, {h, t}, {t, }, s result ech ntervl correspondng pece of ntermedte dt. Strtng Reduce tsk tkes up, t the men tme, copy the Mp results n the correspondng secton of the dt, n ths wy scheduler swtches prt of Mp tsks to the Reduce tsk. fnshng operton of Reduce phse. D. Implementton As schedulng model hs been defned n the prevous, the lst problem s the tmng of strtng the Reduce tsk. Due to the smlrty of dt n the sme job, so tht we cn ssess the rest tsks by the resources whch hve been operted the mssons. Usng the celng LL nd lower lmt UL of prmeter, f lrge thn UL, for the current llocton tsk, f lower thn LL, for the current llocton tsk, somewhere n between, contnued n ccordnce wth the dstrbuton of tsk type before. Flowchrt s shown n Fg. 8. d h t r/m prtton >UL [LL,UL] <LL Fg. 5. Dvde prtton. contnue Fg. 8. flowchrt of entrety Tsk llocton. Fg. 6. Prtton merge. prtton 1 h prtton t prtton 4 The merge phse: when the Reduce phse process to be fnshed or lrger thn the UL, wll be ssgned to Mp tsk or other Reduce tsk, result n the current operton of wll ccordngly, so we need to decrese the smplng ponts nd merge ntervl dt. As shown n Fg. 6, when removng the smple pont d, reducng R to 3, mergng ntervl {, d} nd {d, h} to ntervl {, h}, correspondng wll ped to new ntervl perod of {, h} block of dt, these led to to be relesed the request of other tsks. Fg. 7. Prtton recovery. prtton The recovery phse: s the lst job executon s completed, smple pont s d to ero, nd R s reset to the ntl vlue 1, so ll smll ntervls merge nto bg ntervl, s shown n Fg. 7, the wll del wth the fnl Algorthm1: schedulng bsed on unctegored Begn 1: Determne the number of s ccordng to the node lod nd the vlue of ; 2: Allocte the Mp tsk for ll the s; 3: If (Mp phse completed more thn set threshold or less thn the LL) { 4: Allocte the tsk; 5: Select the free ; 6 R + 1, dd the smplng ponts, dynmc prttonng dvson; } 7: else f ( s greter thn the UL) { 8: Allocte the Mp tsk; 9: Select the free ; 10: R - 1, the smplng pont, dynmc prttonng merge; } 11: else ( between LL nd UL) 12: contnue; 13: end IV. EXPERIMENT AND RESULTS E. Expermentl Envronment Expermentl envronment s Hdoop cluster, whch s mde up of nne compute nodes nd these nodes dstrbuton on the two hosts, one contnng the nme node nd four dt nodes, the other nclude the remnng nodes. Two hosts v ggbt swtches nterconnected, s 2015 Journl of Communctons 781

5 Journl of Communctons Vol. 10, No. 10, October 2015 shown n Tble I, Tble II nd Tble III. the fluctutons re n smll rnge, untl the completon of job schedulng nd the recovery of the ntl vlue of the number. TABLE I: EXPERIMENT ENVIRONMENT Verson Fle system Test progrm Schedulng model Dt Hdoop1.1.2 HDFS Sort progrm FIFO/unctegored model Use RndomWrter rndomly generted TABLE II: JOBTRACKER NODE CONFIGURATION CPU OS Kernel Memory Intel Xeon(R)CPU 2 Ubuntu12.04 Lnux generc 4G TABLE III: TASKTRACKER NODE CONFIGURATION CPU OS Kernel Memory Intel Xeon(R)CPU 2 Ubuntu12.04 Lnux generc 2G Fg. 10. Slot number on unctegored model. Unctegored mproves resources utlton cn lso be reflected n the mprovement of job executon tme. Under the dfferent dt se (MB), two knds of schedulng model executon tme contrst n the sortng test hs been shown n Fg. 11. In the proposed schedulng model, job selecton strtegy s consstent wth the FIFO, except no dstngush type. In Fg. 11 we cn see unctegored schedulng model s fster thn the FIFO schedulng n executon tme. Ths s becuse when unctegored schedulng model s schedulng wth hgher prllelsm of tsks, more s cn be prtcpte n the tsk, thus mprovng the executon effcency s nevtble. Some Common Mstkes The Gngl nstlled n the cluster s to montor ech TskTrcker node nd the JobTrcker node, menwhle, ccordng to the montorng sttstcs [19], t wll set the UL to 0.8 nd set the LL to 0.6 nd ntl set to 0.2. F. Results Anlyss At frst two models for the utlton of resources by the number of s n the process of job executon re mesured. As contrst, to dstngush the n the model, we choose the most typcl nd wdely used FIFO lgorthm. Fg. 9. Slot number on FIFO model. The s number vres wth job executng under dfferent se of clusters s shown n Fg. 9 nd Fg. 10. The Grde x represents dfferent scle of dt. Fg. 9 llustrtes t the Mp phse of one tsk, the number of Mp s ncrese t frst nd then decrese, when the Mp tsk executon s fnshed, Mp s decrese to ntl vlue, nd then phse strt nd the trend s s sme s the bove. Obvously the Mp phse nd the Reduce phse resources s under stte of overlod, so the resources lod n the whole process s not blnced, whle n the two stges of coheson resources utlton rte s very low. Fg. 10 shows the s number chnges n the unctegored model. In Fg. 10, durng the entre process of executon, the chnge tendency of the number s dfferent from Fg. 9 under dfferent scle of dt, whle 2015 Journl of Communctons Fg. 11. executon tme contrst n two models. V. CONCLUSION Ths pper proposes Hdoop job schedulng model bsed on unctegored. Ths model cn elmnte the lmtton of the on the tsks nd tsks n tsk llocton, whch mkes the ssgned to ny types of tsk nd t not only cn mprove the resources utlton nd tsk prllelsm, but lso shorten the executon tme of the operton. For future work, we wll contnue on studyng the performnce stblty of module Job schedulng s well s 782

6 Journl of Communctons Vol. 10, No. 10, October 2015 the other modules n our unctegored schedulng. The system level prllelton nd schedulng lso wll be studed. REFERENCES [1] Apche Hdoop, Hdoop. (My 2015). [Onlne]. Avlble: [2] Chen He, Y. Lu, nd D. Swnson, Mtchmkng: A new schedulng technque, n Proc. IEEE Thrd Interntonl Conference on Cloud Computng Technology nd Scence, Nov. 2011, pp [3] M. Zhr, D. Borthkur, nd J. S. Srm, Job schedulng for mult-user MpReduce clusters, EECS Deprtment, Unversty of Clforn, [4] A. Rj, K. Kur, nd U. Dutt, Enhncement of hdoop clusters wth vrtulton usng the cpcty scheduler, n Proc. Thrd Interntonl Conference on Servces n Emergng Mrkets, 2012, pp [5] M. Zhr, D. Borthkur, nd J. S. Srm, Dely schedulng: A smple technque for chevng loclty nd frness n cluster schedulng, n Proc. 5th Europen Conference on Computer Systems, 2010, pp [6] T. Sndholm nd K. L, Dynmc proportonl shre schedulng n Hdoop, Job Schedulng Strteges for Prllel Processng, pp , [7] K. Kml nd K. Anynwu, Schedulng Hdoop jobs to meet dedlnes, n Proc. IEEE Interntonl Conference on Cloud Computng Technology nd Scence, 2012, pp [8] X. Zhng, Y. Feng, nd S. Feng, An effectve dt loclty wre tsk schedulng method for MpReduce frmework n heterogeneous envronments, n Proc. Interntonl Conference on Cloud nd Servce Computng, 2011, pp [9] Ibrhm, Mestro: Replc-wre schedulng for MpReduce, n Proc. IEEE/ACM Interntonl Symposum on Cluster, Cloud nd Grd Computng, 2012, pp [10] S. Selvlkshm nd S. Vnodkumr, Heurstc bsed heterogeneous longest pproxmte tme to end lgorthm of scentfc workflows n computtonl clouds, Interntonl Journl of Reserch n Advent Technology, vol. 2, no. 10, pp , Oct [11] Q. Chen, D. Zhng, M. Guo, Q. Deng, nd S. Guo, SAMR: A self-dptve schedulng lgorthm n heterogeneous envronment, n Proc. IEEE Interntonl Conference on Computer nd Informton Technology, 2010, pp [12] S. Ptl nd S. Deshmukh, Survey on tsk ssgnment technques n Hdoop, Interntonl Journl of Computer Applctons, pp , [13] J. Dhok, N. Mheshwr, nd V. Vrm, Lernng bsed opportunstc dmsson control lgorthm for s servce, n Proc. 3rd Ind Softwre Engneerng Conference, 2010, pp [14] W. K nd Z. Hou, A provennce-bsed dptve schedulng heurstc for prllel scentfc workflows n clouds, Journl of Grd Computng, vol. 10, no. 3, pp , Sept [15] C. Tn, H. Zhou, nd Y. He, A dynmc MpReduce scheduler for heterogeneous worklods, n Proc. Eghth Interntonl Conference on Grd nd Coopertve Computng, Aug. 2009, pp [16] E. Torbdeh, Cloud theory-bsed smulted nnelng pproch for schedulng n the two-stge ssembly flowshop, Advnces n Engneerng Softwre, pp , [17] G. S. Sdsvm nd D. Selvrj A novel prllel hybrd PSO-GA usng MpReduce to schedule jobs n Hdoop dt grds, n Proc. 2nd World Congress on Nture nd Bologclly Inspred Computng, Dec. 2010, pp [18] A. Beloglov, J. Abwjy, nd R. Buyy, Energy-wre resource llocton heurstcs for effcent mngement of dt centers for Cloud computng, Future Generton Computer Systems, vol. 28, pp , Apr [19] H. Mo, S. Hu, Z. Zhng, L. Xo, nd L. Run, A lod-drven tsk scheduler wth dptve DSC for MpReduce, n Proc. IEEE/ACM Interntonl Conference on Green Computng nd Communctons, Aug. 2011, pp To Xue ws born n Shnx Provnce, Chn, n He receved the B.S. degree n mechncl engneerng from the X 'n Jotong Unversty of Chn (XJTU), X 'n, n 1995 nd the M.S. degree n computer scence from the Northwest Unversty of Chn (NWU), X 'n, n 2000 nd the Ph.D. degree n computer softwre nd theory from the XJTU, n He s currently n Assocte Professor n the Computer Scence Dept t X n Polytechnc Unversty. Hs reserch nterests nclude Cloud Computng, Bg Dt nd Content-bsed Networkng. Tng-tng L ws born n Zhejng Provnce, Chn, n She receved the B.S. degree n network engneerng from the X n Polytechnc Unversty of Chn, X 'n, n She s currently pursung the M.S. degree wth the Deprtment of Computer Scence, X n Polytechnc Unversty. Her reserch nterests nclude Cloud Computng, Bg Dt nd Content-bsed Networkng Journl of Communctons 783

WiMAX DBA Algorithm Using a 2-Tier Max-Min Fair Sharing Policy

WiMAX DBA Algorithm Using a 2-Tier Max-Min Fair Sharing Policy WMAX DBA Algorthm Usng 2-Ter Mx-Mn Fr Shrng Polcy Pe-Chen Tseng 1, J-Yn Ts 2, nd Wen-Shyng Hwng 2,* 1 Deprtment of Informton Engneerng nd Informtcs, Tzu Ch College of Technology, Hulen, Twn pechen@tccn.edu.tw

More information

Optimal Pricing Scheme for Information Services

Optimal Pricing Scheme for Information Services Optml rcng Scheme for Informton Servces Shn-y Wu Opertons nd Informton Mngement The Whrton School Unversty of ennsylvn E-ml: shnwu@whrton.upenn.edu e-yu (Shron) Chen Grdute School of Industrl Admnstrton

More information

ALABAMA ASSOCIATION of EMERGENCY MANAGERS

ALABAMA ASSOCIATION of EMERGENCY MANAGERS LBM SSOCTON of EMERGENCY MNGERS ON O PCE C BELLO MER E T R O CD NCY M N G L R PROFESSONL CERTFCTON PROGRM .. E. M. CERTFCTON PROGRM 2014 RULES ND REGULTONS 1. THERE WLL BE FOUR LEVELS OF CERTFCTON. BSC,

More information

Irregular Repeat Accumulate Codes 1

Irregular Repeat Accumulate Codes 1 Irregulr epet Accumulte Codes 1 Hu Jn, Amod Khndekr, nd obert McElece Deprtment of Electrcl Engneerng, Clforn Insttute of Technology Psden, CA 9115 USA E-ml: {hu, mod, rjm}@systems.cltech.edu Abstrct:

More information

Incorporating Negative Values in AHP Using Rule- Based Scoring Methodology for Ranking of Sustainable Chemical Process Design Options

Incorporating Negative Values in AHP Using Rule- Based Scoring Methodology for Ranking of Sustainable Chemical Process Design Options 20 th Europen ymposum on Computer Aded Process Engneerng ECAPE20. Perucc nd G. Buzz Ferrrs (Edtors) 2010 Elsever B.V. All rghts reserved. Incorportng Negtve Vlues n AHP Usng Rule- Bsed corng Methodology

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

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

Research on performance evaluation in logistics service supply chain based unascertained measure

Research on performance evaluation in logistics service supply chain based unascertained measure Suo Junun, L Yncng, Dong Humn Reserch on performnce evluton n logstcs servce suppl chn bsed unscertned mesure Abstrct Junun Suo *, Yncng L, Humn Dong Hebe Unverst of Engneerng, Hndn056038, Chn Receved

More information

Vendor Rating for Service Desk Selection

Vendor Rating for Service Desk Selection Vendor Presented By DATE Using the scores of 0, 1, 2, or 3, plese rte the vendor's presenttion on how well they demonstrted the functionl requirements in the res below. Also consider how efficient nd functionl

More information

APPLICATION OF QUEUING THEORY TO DYNAMIC VEHICLE ROUTING PROBLEM Wei-Ning Chen, Kainan University Taiwan

APPLICATION OF QUEUING THEORY TO DYNAMIC VEHICLE ROUTING PROBLEM Wei-Ning Chen, Kainan University Taiwan GLOBAL JOURNAL OF BUSINESS RESEARCH VOLUME 3 NUMBER 009 APPLICATION OF QUEUING THEORY TO DYNAMIC VEHICLE ROUTING PROBLEM We-Nng Chen Knn Unersty Twn ABSTRACT In ths pper we eelope n nlyze ynmc moel of

More information

Small Business Cloud Services

Small Business Cloud Services Smll Business Cloud Services Summry. We re thick in the midst of historic se-chnge in computing. Like the emergence of personl computers, grphicl user interfces, nd mobile devices, the cloud is lredy profoundly

More information

Fuzzy Clustering for TV Program Classification

Fuzzy Clustering for TV Program Classification Fuzzy Clusterng for TV rogrm Clssfcton Yu Zhwen Northwestern olytechncl Unversty X n,.r.chn, 7007 yuzhwen77@yhoo.com.cn Gu Jnhu Northwestern olytechncl Unversty X n,.r.chn, 7007 guh@nwpu.edu.cn Zhou Xngshe

More information

Basics of Counting. A note on combinations. Recap. 22C:19, Chapter 6.5, 6.7 Hantao Zhang

Basics of Counting. A note on combinations. Recap. 22C:19, Chapter 6.5, 6.7 Hantao Zhang Bscs of Countng 22C:9, Chpter 6.5, 6.7 Hnto Zhng A note on comntons An lterntve (nd more common) wy to denote n r-comnton: n n C ( n, r) r I ll use C(n,r) whenever possle, s t s eser to wrte n PowerPont

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

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

DlNBVRGH + Sickness Absence Monitoring Report. Executive of the Council. Purpose of report

DlNBVRGH + Sickness Absence Monitoring Report. Executive of the Council. Purpose of report DlNBVRGH + + THE CITY OF EDINBURGH COUNCIL Sickness Absence Monitoring Report Executive of the Council 8fh My 4 I.I...3 Purpose of report This report quntifies the mount of working time lost s result of

More information

YOU FINALLY FINISHED YOUR FILM. NOW WHAT? Distributor...? Sales agent...? GOT IT: SELF DISTRIBUTION

YOU FINALLY FINISHED YOUR FILM. NOW WHAT? Distributor...? Sales agent...? GOT IT: SELF DISTRIBUTION YOU FINALLY FINISHED YOUR FILM. NOW WHAT? Dstrbutor...? Sles gent...? GOT IT: SELF DISTRIBUTION THE ADVANTAGES OF SELF DISTRIBUTION: A gurnteed openng n NY / LA prme theter nd you keep 100% of the boxoffce.

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

A New Task Scheduling Algorithm Based on Improved Genetic Algorithm

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

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Communication Networks II Contents

Communication Networks II Contents 8 / 1 -- Communcaton Networs II (Görg) -- www.comnets.un-bremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP

More information

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( ) Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +

More information

Resistive Network Analysis. The Node Voltage Method - 1

Resistive Network Analysis. The Node Voltage Method - 1 esste Network Anlyss he nlyss of n electrcl network conssts of determnng ech of the unknown rnch currents nd node oltges. A numer of methods for network nlyss he een deeloped, sed on Ohm s Lw nd Krchoff

More information

Vector Geometry for Computer Graphics

Vector Geometry for Computer Graphics Vector Geometry for Computer Grphcs Bo Getz Jnury, 7 Contents Prt I: Bsc Defntons Coordnte Systems... Ponts nd Vectors Mtrces nd Determnnts.. 4 Prt II: Opertons Vector ddton nd sclr multplcton... 5 The

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Fault tolerance in cloud technologies presented as a service

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 information

Helicopter Theme and Variations

Helicopter Theme and Variations Helicopter Theme nd Vritions Or, Some Experimentl Designs Employing Pper Helicopters Some possible explntory vribles re: Who drops the helicopter The length of the rotor bldes The height from which the

More information

Newton-Raphson Method of Solving a Nonlinear Equation Autar Kaw

Newton-Raphson Method of Solving a Nonlinear Equation Autar Kaw Newton-Rphson Method o Solvng Nonlner Equton Autr Kw Ater redng ths chpter, you should be ble to:. derve the Newton-Rphson method ormul,. develop the lgorthm o the Newton-Rphson method,. use the Newton-Rphson

More information

Unleashing the Power of Cloud

Unleashing the Power of Cloud Unleshing the Power of Cloud A Joint White Pper by FusionLyer nd NetIQ Copyright 2015 FusionLyer, Inc. All rights reserved. No prt of this publiction my be reproduced, stored in retrievl system, or trnsmitted,

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

A Programming Model for the Cloud Platform

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

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Enterprise Risk Management Software Buyer s Guide

Enterprise Risk Management Software Buyer s Guide Enterprise Risk Mngement Softwre Buyer s Guide 1. Wht is Enterprise Risk Mngement? 2. Gols of n ERM Progrm 3. Why Implement ERM 4. Steps to Implementing Successful ERM Progrm 5. Key Performnce Indictors

More information

Forecasting the Direction and Strength of Stock Market Movement

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

Performance analysis model for big data applications in cloud computing

Performance analysis model for big data applications in cloud computing Butist Villlpndo et l. Journl of Cloud Computing: Advnces, Systems nd Applictions 2014, 3:19 RESEARCH Performnce nlysis model for big dt pplictions in cloud computing Luis Edurdo Butist Villlpndo 1,2,

More information

Survey on Virtual Machine Placement Techniques in Cloud Computing Environment

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

AntiSpyware Enterprise Module 8.5

AntiSpyware Enterprise Module 8.5 AntiSpywre Enterprise Module 8.5 Product Guide Aout the AntiSpywre Enterprise Module The McAfee AntiSpywre Enterprise Module 8.5 is n dd-on to the VirusScn Enterprise 8.5i product tht extends its ility

More information

A heuristic task deployment approach for load balancing

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

A Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing

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

Use Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions.

Use Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions. Lerning Objectives Loci nd Conics Lesson 3: The Ellipse Level: Preclculus Time required: 120 minutes In this lesson, students will generlize their knowledge of the circle to the ellipse. The prmetric nd

More information

Open Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1

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

Network Configuration Independence Mechanism

Network Configuration Independence Mechanism 3GPP TSG SA WG3 Security S3#19 S3-010323 3-6 July, 2001 Newbury, UK Source: Title: Document for: AT&T Wireless Network Configurtion Independence Mechnism Approvl 1 Introduction During the lst S3 meeting

More information

ClearPeaks Customer Care Guide. Business as Usual (BaU) Services Peace of mind for your BI Investment

ClearPeaks Customer Care Guide. Business as Usual (BaU) Services Peace of mind for your BI Investment ClerPeks Customer Cre Guide Business s Usul (BU) Services Pece of mind for your BI Investment ClerPeks Customer Cre Business s Usul Services Tble of Contents 1. Overview...3 Benefits of Choosing ClerPeks

More information

A Load-Balancing Algorithm for Cluster-based Multi-core Web Servers

A 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

An Interest-Oriented Network Evolution Mechanism for Online Communities

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

Small Business Networking

Small Business Networking Why Network is n Essentil Productivity Tool for Any Smll Business TechAdvisory.org SME Reports sponsored by Effective technology is essentil for smll businesses looking to increse their productivity. Computer

More information

ORIGIN DESTINATION DISAGGREGATION USING FRATAR BIPROPORTIONAL LEAST SQUARES ESTIMATION FOR TRUCK FORECASTING

ORIGIN DESTINATION DISAGGREGATION USING FRATAR BIPROPORTIONAL LEAST SQUARES ESTIMATION FOR TRUCK FORECASTING ORIGIN DESTINATION DISAGGREGATION USING FRATAR BIPROPORTIONAL LEAST SQUARES ESTIMATION FOR TRUCK FORECASTING Unversty of Wsconsn Mlwukee Pper No. 09-1 Ntonl Center for Freght & Infrstructure Reserch &

More information

On the System Dynamics of the Logistic Risk of Marketing Channels

On the System Dynamics of the Logistic Risk of Marketing Channels 1194 JOURNAL OF SOFTWARE, VOL. 8, NO. 5, MAY 2013 On the System Dynmcs of the Logstc Rsk of Mrketng Chnnels Yng M School of Mngement, Wuhn Unversty of Technology, Wuhn, Chn Eml: myng331@163.com Fe Feng

More information

IWFMS: An Internal Workflow Management System/Optimizer for Hadoop

IWFMS: An Internal Workflow Management System/Optimizer for Hadoop IWFMS: An Internal Workflow Management System/Optmzer for Hadoop Lan Lu, Yao Shen Department of Computer Scence and Engneerng Shangha JaoTong Unversty Shangha, Chna lustrve@gmal.com, yshen@cs.sjtu.edu.cn

More information

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *

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

Improved SVM in Cloud Computing Information Mining

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

Models and Software for Urban and Regional Transportation Planning : The Contributions of the Center for Research on Transportation

Models and Software for Urban and Regional Transportation Planning : The Contributions of the Center for Research on Transportation Models nd Softwre for Urbn nd Regonl Plnnng : The Contrbutons of the Center for Reserch on Mchel Florn Aprl 2008 CIRRELT-2008-11 Models nd Softwre for Urbn Regonl Plnnng: The Contrbutons of the Center

More information

Lecture 3: Force of Interest, Real Interest Rate, Annuity

Lecture 3: Force of Interest, Real Interest Rate, Annuity Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and

More information

Lesson 28 Psychrometric Processes

Lesson 28 Psychrometric Processes 1 Lesson 28 Psychrometrc Processes Verson 1 ME, IIT Khrgpur 1 2 The specfc objectves of ths lecture re to: 1. Introducton to psychrometrc processes nd ther representton (Secton 28.1) 2. Importnt psychrometrc

More information

Dynamic Fleet Management for Cybercars

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

Texas Instruments 30X IIS Calculator

Texas Instruments 30X IIS Calculator Texas Instruments 30X IIS Calculator Keystrokes for the TI-30X IIS are shown for a few topcs n whch keystrokes are unque. Start by readng the Quk Start secton. Then, before begnnng a specfc unt of the

More information

Health insurance exchanges What to expect in 2014

Health insurance exchanges What to expect in 2014 Helth insurnce exchnges Wht to expect in 2014 33096CAEENABC 02/13 The bsics of exchnges As prt of the Affordble Cre Act (ACA or helth cre reform lw), strting in 2014 ALL Americns must hve minimum mount

More information

Health insurance marketplace What to expect in 2014

Health insurance marketplace What to expect in 2014 Helth insurnce mrketplce Wht to expect in 2014 33096VAEENBVA 06/13 The bsics of the mrketplce As prt of the Affordble Cre Act (ACA or helth cre reform lw), strting in 2014 ALL Americns must hve minimum

More information

EasyMP Network Projection Operation Guide

EasyMP Network Projection Operation Guide EsyMP Network Projection Opertion Guide Contents 2 About EsyMP Network Projection Functions of EsyMP Network Projection... 5 Vrious Screen Trnsfer Functions... 5 Instlling the Softwre... 6 Softwre Requirements...6

More information

AN OPERATIONAL APPROACH FOR GROUND HANDLING MANAGEMENT AT AIRPORTS WITH IMPERFECT INFORMATION

AN OPERATIONAL APPROACH FOR GROUND HANDLING MANAGEMENT AT AIRPORTS WITH IMPERFECT INFORMATION 1 N OPERTIONL PPROCH FOR GROUN HNLING MNGEMENT T IRPORTS WITH IMPERFECT INFORMTION Slm Ftour Trbels (ENC) ftour_trbels-slm@hotml.com crlos lberto Nunes Cosenz (COPPE) cosenz@pep.ufrj.br Lus Gustvo Zely

More information

An Alternative Way to Measure Private Equity Performance

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

MULTI-CRITERIA DECISION AIDING IN PROJECT MANAGEMENT OUTRANKING APPROACH AND VERBAL DECISION ANALYSIS

MULTI-CRITERIA DECISION AIDING IN PROJECT MANAGEMENT OUTRANKING APPROACH AND VERBAL DECISION ANALYSIS Dorot Górec Deprtment of Econometrcs nd Sttstcs Ncolus Coperncus Unversty n Toruń MULTI-CRITERIA DECISION AIDING IN PROJECT MANAGEMENT OUTRANKING APPROACH AND VERBAL DECISION ANALYSIS Introducton A proect

More information

A Dynamic Load Balancing for Massive Multiplayer Online Game Server

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

Joint Opaque booking systems for online travel agencies

Joint Opaque booking systems for online travel agencies Jont Opque bookng systems for onlne trvel gences Mlgorzt OGOOWSKA nd Domnque TORRE Mrch 2010 Abstrct Ths pper nlyzes the propertes of the dvnced Opque bookng systems used by the onlne trvel gences n conjuncton

More information

Introducing Kashef for Application Monitoring

Introducing Kashef for Application Monitoring WextWise 2010 Introducing Kshef for Appliction The Cse for Rel-time monitoring of dtcenter helth is criticl IT process serving vriety of needs. Avilbility requirements of 6 nd 7 nines of tody SOA oriented

More information

Power Consumption Optimization Strategy of Cloud Workflow. Scheduling Based on SLA

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

Fuzzy Logic Based Anomaly Detection for Embedded Network Security Cyber Sensor

Fuzzy Logic Based Anomaly Detection for Embedded Network Security Cyber Sensor INL/CON-10-20411 PREPRINT Fuzzy Logc Bsed Anomly Detecton for Embedded Network Securty Cyber Sensor 2011 IEEE Symposum on Computtonl Intellgence n Cyber Securty Ondre Lnd Mlos Mnc Todd Vollmer Json Wrght

More information

Experiment 6: Friction

Experiment 6: Friction Experiment 6: Friction In previous lbs we studied Newton s lws in n idel setting, tht is, one where friction nd ir resistnce were ignored. However, from our everydy experience with motion, we know tht

More information

THREE-DIMENSIONAL ELASTIC AND ELASTO-PLASTIC FRICTIONAL CONTACT ANALYSIS OF TURBOMACHINERY BLADE ATTACHMENTS

THREE-DIMENSIONAL ELASTIC AND ELASTO-PLASTIC FRICTIONAL CONTACT ANALYSIS OF TURBOMACHINERY BLADE ATTACHMENTS JOURNAL OF THEORETICAL AND APPLIED MECHANICS 3,39,2001 THREE-DIMENSIONAL ELASTIC AND ELASTO-PLASTIC FRICTIONAL CONTACT ANALYSIS OF TURBOMACHINERY BLADE ATTACHMENTS Grzegorz Zbońsk Wesłw Ostchowcz Insttute

More information

In our example i = r/12 =.0825/12 At the end of the first month after your payment is received your amount in the account, the balance, is

In our example i = r/12 =.0825/12 At the end of the first month after your payment is received your amount in the account, the balance, is Payout annutes: Start wth P dollars, e.g., P = 100, 000. Over a 30 year perod you receve equal payments of A dollars at the end of each month. The amount of money left n the account, the balance, earns

More information

Portfolio approach to information technology security resource allocation decisions

Portfolio approach to information technology security resource allocation decisions Portfolio pproch to informtion technology security resource lloction decisions Shivrj Knungo Deprtment of Decision Sciences The George Wshington University Wshington DC 20052 knungo@gwu.edu Abstrct This

More information

QoS-based Scheduling of Workflow Applications on Service Grids

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

Resource Scheduling in Desktop Grid by Grid-JQA

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

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS 21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS

More information

AVR32723: Sensor Field Oriented Control for Brushless DC motors with AT32UC3B0256. 32-bit Microcontrollers. Application Note. Features.

AVR32723: Sensor Field Oriented Control for Brushless DC motors with AT32UC3B0256. 32-bit Microcontrollers. Application Note. Features. AVR7: Sensor Feld Orented Control for Brushless DC motors wth ATUCB056 Fetures Stndlone Spce Vector Modulton lbrry for AVR UC mcrocontroller. Prk nd Clrke mthemtcl trnsformton lbrry for AVR UC mcrocontroller.

More information

LITERATURE REVIEW: VARIOUS PRIORITY BASED TASK SCHEDULING ALGORITHMS IN CLOUD COMPUTING

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

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign

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

Mathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100

Mathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100 hsn.uk.net Higher Mthemtics UNIT 3 OUTCOME 1 Vectors Contents Vectors 18 1 Vectors nd Sclrs 18 Components 18 3 Mgnitude 130 4 Equl Vectors 131 5 Addition nd Subtrction of Vectors 13 6 Multipliction by

More information

Boolean Algebra. ECE 152A Winter 2012

Boolean Algebra. ECE 152A Winter 2012 Boolen Algebr ECE 52A Wnter 22 Redng Assgnent Brown nd Vrnesc 2 Introducton to Logc Crcuts 2.5 Boolen Algebr 2.5. The Venn Dgr 2.5.2 Notton nd Ternology 2.5.3 Precedence of Opertons 2.6 Synthess Usng AND,

More information

Reasoning to Solve Equations and Inequalities

Reasoning to Solve Equations and Inequalities Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing

More information

MAPP. MERIS level 3 cloud and water vapour products. Issue: 1. Revision: 0. Date: 9.12.1998. Function Name Organisation Signature Date

MAPP. MERIS level 3 cloud and water vapour products. Issue: 1. Revision: 0. Date: 9.12.1998. Function Name Organisation Signature Date Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller

More information

The Load Balancing of Database Allocation in the Cloud

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

Econ 4721 Money and Banking Problem Set 2 Answer Key

Econ 4721 Money and Banking Problem Set 2 Answer Key Econ 472 Money nd Bnking Problem Set 2 Answer Key Problem (35 points) Consider n overlpping genertions model in which consumers live for two periods. The number of people born in ech genertion grows in

More information

Graphs on Logarithmic and Semilogarithmic Paper

Graphs on Logarithmic and Semilogarithmic Paper 0CH_PHClter_TMSETE_ 3//00 :3 PM Pge Grphs on Logrithmic nd Semilogrithmic Pper OBJECTIVES When ou hve completed this chpter, ou should be ble to: Mke grphs on logrithmic nd semilogrithmic pper. Grph empiricl

More information

7.5. Present Value of an Annuity. Investigate

7.5. Present Value of an Annuity. Investigate 7.5 Present Value of an Annuty Owen and Anna are approachng retrement and are puttng ther fnances n order. They have worked hard and nvested ther earnngs so that they now have a large amount of money on

More information

Research of concurrency control protocol based on the main memory database

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

Quantity Oriented Resource Allocation Strategy on Multiple Resources Projects under Stochastic Conditions

Quantity Oriented Resource Allocation Strategy on Multiple Resources Projects under Stochastic Conditions Interntionl Conference on Industril Engineering nd Systems Mngement IESM 2009 My 13-15 MONTRÉAL - CANADA Quntity Oriented Resource Alloction Strtegy on Multiple Resources Projects under Stochstic Conditions

More information

A Secure Password-Authenticated Key Agreement Using Smart Cards

A Secure Password-Authenticated Key Agreement Using Smart Cards A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,

More information

Adaptive and Dynamic Load Balancing in Grid Using Ant Colony Optimization

Adaptive and Dynamic Load Balancing in Grid Using Ant Colony Optimization Sandp Kumar Goyal et al. / Internatonal Journal of Engneerng and Technology (IJET) Adaptve and Dynamc Load Balancng n Grd Usng Ant Colony Optmzaton Sandp Kumar Goyal 1, Manpreet Sngh 1 Department of Computer

More information

"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *

Research Note APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES * Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC

More information

Project Networks With Mixed-Time Constraints

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

Laddered Multilevel DC/AC Inverters used in Solar Panel Energy Systems

Laddered Multilevel DC/AC Inverters used in Solar Panel Energy Systems Proceedngs of the nd Internatonal Conference on Computer Scence and Electroncs Engneerng (ICCSEE 03) Laddered Multlevel DC/AC Inverters used n Solar Panel Energy Systems Fang Ln Luo, Senor Member IEEE

More information

Let us recall some facts you have learnt in previous grades under the topic Area.

Let us recall some facts you have learnt in previous grades under the topic Area. 6 Are By studying this lesson you will be ble to find the res of sectors of circles, solve problems relted to the res of compound plne figures contining sectors of circles. Ares of plne figures Let us

More information

Motivation. Eingebettete Systeme. Terms. Terms. Echtzeitverhalten und Betriebssysteme. 7. Ressourcen

Motivation. Eingebettete Systeme. Terms. Terms. Echtzeitverhalten und Betriebssysteme. 7. Ressourcen Motvaton Engebettete Systeme Echtzetverhalten und Betrebssysteme 7. Ressourcen 1 2 Terms A resource s any software structure that can be used by a process to advance ts executon, e.g. data structure, a

More information

Resource Sharing Models and Heuristic Load Balancing Methods for

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

Protocol Analysis. 17-654/17-764 Analysis of Software Artifacts Kevin Bierhoff

Protocol Analysis. 17-654/17-764 Analysis of Software Artifacts Kevin Bierhoff Protocol Anlysis 17-654/17-764 Anlysis of Softwre Artifcts Kevin Bierhoff Tke-Awys Protocols define temporl ordering of events Cn often be cptured with stte mchines Protocol nlysis needs to py ttention

More information

J. Parallel Distrib. Comput.

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

WEB DELAY ANALYSIS AND REDUCTION BY USING LOAD BALANCING OF A DNS-BASED WEB SERVER CLUSTER

WEB DELAY ANALYSIS AND REDUCTION BY USING LOAD BALANCING OF A DNS-BASED WEB SERVER CLUSTER Interntionl Journl of Computers nd Applictions, Vol. 9, No., 007 WEB DELAY ANALYSIS AND REDUCTION BY USING LOAD BALANCING OF A DNS-BASED WEB SERVER CLUSTER Y.W. Bi nd Y.C. Wu Abstrct Bsed on our survey

More information

Cost-based Scheduling of Scientific Workflow Applications on Utility Grids

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

Conferencing protocols and Petri net analysis

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

Operating Network Load Balancing with the Media Independent Information Service for Vehicular Based Systems

Operating Network Load Balancing with the Media Independent Information Service for Vehicular Based Systems CHI MA et l: OPERATING NETWORK LOAD BALANCING WITH THE MEDIA INDEPENDENT... Opertng Network Lod Blncng wth the Med Independent Inforton Servce for Vehculr Bsed Systes Ch M, End Fllon, Yunsong Qo, Brn Lee

More information

Treatment Spring Late Summer Fall 0.10 5.56 3.85 0.61 6.97 3.01 1.91 3.01 2.13 2.99 5.33 2.50 1.06 3.53 6.10 Mean = 1.33 Mean = 4.88 Mean = 3.

Treatment Spring Late Summer Fall 0.10 5.56 3.85 0.61 6.97 3.01 1.91 3.01 2.13 2.99 5.33 2.50 1.06 3.53 6.10 Mean = 1.33 Mean = 4.88 Mean = 3. The nlysis of vrince (ANOVA) Although the t-test is one of the most commonly used sttisticl hypothesis tests, it hs limittions. The mjor limittion is tht the t-test cn be used to compre the mens of only

More information