Research on the Resource Sharing Among Hierarchically Distributed Virtual Enterprises Based on Grid System

Transcription

1 Send Orders for Reprnts to The Open Cybernetcs & Systemcs Journal, 204, 8, Open Access Research on the Resource Sharng Among Herarchcally Dstrbuted Vrtual Enterprses Based on Grd System Hongbo Wang* School of Traffc and Logstcs, Central South Unersty of Forestry and Technology, Changsha, Hunan, Chna Abstract: In the rtual manufacturng process based on grd technology, user and resource proder share resource and serce connected through dfferent rtual enterprses. In order to realze the target, rtual enterprse wll manage the enterprses n ts lower leel, and then the herarchcally dstrbuted enronment wll be formed. The resource proder and rtual enterprse should achee the agreement on the strategy of resource sharng, such as the quantty, type and proporton of resource sharng. Therefore the users n the rtual enterprses n lower leel could get access to the resource of the upper leel to achee the common am. The problem of allocatng resources among herarchcally dstrbuted rtual enterprses s the focus, at the same tme, the sutable proporton of sharng resource s also dscussed. In addton, under the specfc proporton condton, a new resource sharng scheme s put forward. Compared wth some other resource sharng method, the effecteness of sharng resource s erfed by usng smulaton software. The most effecte and sutable resource sharng method among herarchcally dstrbuted enterprses s explored. Keywords: Grd system, herarchcal dstrbuton, resource allocaton and sharng, rtual enterprse.. INTRODUCTION Wth the number of rtual enterprses n the grd ncreasng, the effecte management orented to rtual enterprses s greatly needed []. Accordng to the organzaton style of rtual enterprses, there are four models whch are monadc, herarchy, allance and hybrd. Herarchcal rtual enterprse model s commonly adopted n enterprse operaton. Under ths model, rtual enterprses realze ther ams through managng the sub-leel rtual enterprses, especally the resource sharng problem. Resource proder establshes a seres of serce leel agreement to make the resource porton allocated to dfferent rtual enterprse specfc. Under ths resource allocaton strategy, effecte and far resource utlzaton s realzed through prorty orderng among rtual enterprses. The followng three aspects are the focus of the paper. The frst s to construct herarchcal grd enronment orented to rtual enterprses based on resource sharng strategy. The second, a soluton s proded to sole the resource sharng problem under the enronment of herarchcally dstrbuted rtual enterprses [2]. The last, dfferent resource allocatng schemes are dscussed and compared, and then suggeston wll be put forward to make the decson of managers more sutable and useful. In the research work, some mportant ponts are noled, for example, the related works of resource allocatng, the system model of herarchcally dstrbuted rtual enterprses, the algorthm orented to the key pont of resource sharng, the suggeston on establshng the framework of resource allocaton, and the method and the process of smulaton. *Address correspondence to ths author at the School of Traffc and Logstcs, Central South Unersty of Forestry and Technology, Changsha, Hunan, Chna; 40004; E-mal: wanghongbocs@63.com In ths artcle, the research focus s on the problem of resource allocaton n the herarchcally dstrbuted rtual enterprse grd. Through seres of serce agreement proded by resource owner, resource share allocated to dfferent rtual enterprse are determned. Under the resource allocaton strategy, an nner sharng strategy s proded to make eery rtual enterprse utlze the resource effectely and farly by prorty orderng. Emphass s placed on the followng three ponts:. Based on resource sharng strategy, the herarchcal rtual enterprse network s constructed. 2. A soluton s put forward to sole the resource sharng problem under herarchcally dstrbuted rtual enterprse enronment. 3. Surey about the scheme of resource allocaton wll be conducted, suggeston wll be proded. In the followng part, the related research work about resource allocaton under grd enronment s proded, the systematcal model of herarchcally dstrbuted rtual enterprse s determned, an algorthm to sole the problem of resource sharng s made clear, the suggeston on constructng the resource allocaton framework s put forward ncludng resource allocaton scheme among resource allocaton mddleware, and at last authentc result wll be produced through software smulaton. 2. RELATED RESEARCH STATUS The update research on grd technology s focused on the resource schedulng and protecton among rtual enterprse under grd enronment [3]. Many experts mplant a new framework nto the resource schedulng based on sharng strategy as part of SHINX schedulng system. In the framework, resource s utlzed and managed effectely through adustng the resource usage or prorty of resource requrement [4]. Other experts propose suggeston on re X/4 204 Bentham Open

2 386 The Open Cybernetcs & Systemcs Journal, 204, Volume 8 Hongbo Wang A H R U B C D I J K 40% R2 E F U3 U6 70% U7 30% U8 U5 U2 R3 R5 R6 G U4 R4 U User Resource roder V Vrtual Enterprse Fg. (). Herarchcal rtual enterprse nstance. source schedulng among rtual enterprses and ealuate the aggregated resource utlzaton. Another hot pont n grd technology research s the resource allocaton problem among many resource sources. Some experts are engaged n the research on the resource allocaton n multcluster system through analyss and smulaton amng at the nfluence of the change of some parameters such as the structure of resource and batch sze. In addton, there are some research works focused on the strategy of resource schedulng and selecton among many ponts, the protecton mechansm about grd resource allocaton [5]. 3. HIERARCHICAL VIRTUAL ENTERRISE MODEL 3.. Herarchcal Vrtual Enterprse Enronment Because many rtual enterprses dstrbuted n the grd enronment, the sharng serce among these rtual enterprses s absolutely necessary. One rtual enterprse can be dded nto many sub-enterprses to manage the resource effectely. Therefore, rtual enterprse can be regarded as a group of users, resource proders and sub-rtualenterprses. The structure of rtual enterprses s ust as Fg. () shows. A pont ncludes B, C and D. ont B also ncludes E and F. the structure can be ewed as an entty structure or logcal structure. There are user U, resource R and three sub-rtualenterprses B, C, and D ncluded n A. at the same tme, resource owner can prode the resource to many dfferent rtual enterprses. For example R3 prodes resource to D, I and G System Model. Vrtual enterprse model: there are user, resource owner and rtual enterprse n the grd system [6]. User s a termnal entty, whch submts msson to grd system and begns to operate by the resource n rtual enterprses. Resource owner allocates dfferent resource share to the user n rtual enterprse, whch s a rtual organzaton ntegratng users, resource owners and sub-rtual-enterprses share together to realze the target of the organzaton. Therefore, grd can be defned as G(U, R, V ). U stands for user group. R refers to resource owner group. V means rtual enterprse group n grd. The component of rtual enterprse A n Fg. () s as followng Table shows. The user group, resource proder group and sub-rtual enterprse group noled n rtual enterprse V can be represented as U, R, V. Vrtual enterprse V ( VE ) can be defned as (U, R, V ). Under the herarchcal rtual enterprse enronment, the followng termnologes are defned. arent rtual enterprse: f a rtual enterprse V s a chld node of V ', then V ' s the parent rtual enterprse of V, represented as parent (). Ancestor rtual enterprse: for a specfc rtual V, n the dstrbuton tree of rtual enterprse, all the rtual enterprses from node V to the root node are called as a ancestor rtual enterprse of V and represented as ancs(). Descendant rtual enterprse: n the dstrbuton tree of rtual enterprse, all the rtual enterprses, all the rtual enterprses from node V to the leaf rtual enterprse are the descendant rtual enterprses of V and represented as desc (). Root rtual enterprse: f a rtual enterprse V has no parent rtual enterprse, t s root rtual enterprse. Leaf rtual enterprse: f a rtual enterprse V has no chld rtual enterprse, t s a leaf rtual enterprse.

3 Research on the Resource Sharng Among Herarchcally Dstrbuted The Open Cybernetcs & Systemcs Journal, 204, Volume Table. The components of rtual enterprses A n Fg. (). Vrtual Enterprse (V) User ( U ) Resource ( R ) Sub-rtual Enterprse ( V ) A {U} {R()} {B,C,D} B {R2(40%)} { E, F } C D {U3} {R3(), R5()} E {U2,U5} {R4()} F {R4()} {G} G {U4} {R3()} Mddle rtual enterprse: f a rtual enterprse s not a root rtual enterprse, nor leaf rtual enterprse, t s a mddle rtual enterprse. 2. Resource sharng strategy model: n the artcle, from resource sharng perspecte, the operaton strategy between resource proder and ther rtual enterprse s consdered. The resource sharng strategy of resource proder r s reflected by the maxmal resource share t prodes rtual enterprse V. The shared resource s represented as share(r, ). The resource sharng strategy s a serce leel agreement establshed between resource proder and rtual enterprse. In Fg. (), R3 prodes resource to D, resource to G, and resource to I. The share of resource s reflected by the percentage of all resources of resource owner. For the schedulng polcy of space sharng, the share reflects the number of processor dstrbuted to rtual enterprse. For the schedulng polcy of tme sharng, t reflects the percentage of the total processng capacty dstrbuted to rtual enterprse. 3. Workng model: ob heren refers to a batch of msson, composed by many ndependent mssons. In order to achee the results, mssons must be completed before the deadlne. 4. THE RESOURCE SHARING IN HIERARCHI- CAL VIRTUAL ENTERRISE Vrtual enterprse can allocate the operaton work to chld rtual enterprse to achee ts purpose. The resource proder of rtual enterprse allows the users n descendant rtual enterprse to use ts resource, as long as the sharng strategy s not destroyed [7]. Because users hae access to the resource n the rtual enterprses tself and the ancestor rtual enterprses, and the allocaton of resource n resource mddleware has become a problem. Suppose the resource capacty n upper rtual enterprse s better than that n the lower one. The users n lower layer are wllng to utlze the resource n upper layer; t wll reduce the QOS of the users of rtual enterprse n upper layer and cause nald resource use. Therefore, to the soluton to the problem of resource allocaton n herarchcal rtual enterprses s ery mportant for protectng the farness and effecteness [8]. In order to sole the problem, the followng two ponts should be pad more emphass, whch are nternal resource sharng strategy and resource allocaton strategy. The nternal resource sharng strategy shows the number of resources preferentally allocated to specfc rtual enterprse users. So n resource allocatng scheme, the frst thng s to select prorty resources. A heurstc algorthm s presented to sole the resource sharng problem wth a new resource allocaton framework and plan. 4.. A Far Resource Allocaton roblem Job s produced from users and sent to rtual enterprse. Suppose user prodes ob wth posson process, wth arral rate as ( ). The aerage processng rate of eery resource ( proder s u ). The followng Fg. (2) descrbes the structure of rtual enterprse A n Fg. () wth the aboe mentoned elements. (2) 40% (5) (2) () (4) () (3) 6 (3) (5) (4) Fg. (2). The structure of rtual enterprse A n Fg. (). The ob arral rate of rtual enterprse can be calculated from the ob arral rate of users noled. If two ndependent process appears wth rate of and 2, respectely, then the total rate s + 2. Therefore, the ob arral rate

4 388 The Open Cybernetcs & Systemcs Journal, 204, Volume 8 Hongbo Wang of rtual enterprse V can be expressed as = # (u). V u"u V As the same, the resource processng rate of rtual enterprse V can be expressed as U V = # share(r,)u (r ). r"r V The focus of resource sharng s the allocaton of the processng rate of a rtual enterprse to ts descendent rtual enterprse to reduce the total watng tme [9]. If we defne the serce delered from rtual enterprse to ts descendent rtual enterprse as,, and then the serce processng rate of rtual enterprse wll ncrease,. The actual serce processng rate of rtual enterprse s a = #, $. {}"ancs() Suppose the actual serce processng rate and ob arral rate of rtual enterprse are a and, respectely, then for the users of, the watng tme s a ". The problem of sharng resource among rtual enterprses s to make $ mnmal. At the same the followng constrant #V a " condtons must be satsfed,.e. # = {}"desc(), 0 a?, ( ) Resource Sharng Decson The problem of rtual enterprse resource sharng s a nonlnear optmzaton problem [0]. A heurstc algorthm s proposed to sole the problem n the artcle. The frst step s the local optmzaton problem of the allocaton of the resource of rtual enterprse to ts descendent rtual enterprse. Suppose the actual serce rate of rtual enterprse s a. Actually, the problem s to decde, and eery, ( desc() ) to reduce the total watng tme ( a = 0). So to rtual enterprse, the resource sharng problem repre- sented as SHARE s to make & $%desc( ) + a "#, mnmal and satsfy the constrant condton $ =; 0. "#desc( ),, The program of the heurstc algorthm as Table 2 shows. The output of the algorthm s, of eery rtual enterprse, the ntal alue of whch s 0. The share allocated s represented as. Under the crcumstance of specfc, by the algorthm, the best rtual enterprse s found to reduce watng tme furthest. Table 2. Local optmzaton algorthm. Local-Far-share() Algorthm w, ( p) = : watng tme functon p" u a + # p, # + " ; For all n desc() do p, 0 ; T { } " desc( ); For all n T do " w, # w, ( p, + ) $ w, ( p, ); p p, ; Whle p<.0 do arg max " w, # T p, " p, + ; " w, # w, ( p, + ) $ w, ( p, ); p" p + ; Endwhle For all n T do a a + p, " ; The ntal alue of, s defned as " + #. By allocatng sharng resource, the watng tme decrement of rtual enterprse s represented as,. The algorthm s to select the rtual enterprse wth maxmal alue of, and update a.,, get the The algorthm of resource sharng s showed n followng Table 3. The algorthm Far-share() decdes the percentage of shared resource. At frst, the sharng problem orented to chld rtual enterprse s determned. If a rtual enterprse s leaf node n the herarchcal structure, t wll allocate all resources to tself. Otherwse, through the algorthm Localfar-share (), t allocate the resource to ts descendant rtual enterprse [].

5 Research on the Resource Sharng Among Herarchcally Dstrbuted The Open Cybernetcs & Systemcs Journal, 204, Volume Table 3. Resource sharng algorthm of rtual enterprse. Table 4. The allocaton alue. VE-share(G) Algorthm Return Sequence Decson Value G=(U,R,V) For each VE n V do ( u) =" u # U ; share( r, ) ( r) = " r # R Endfor For each root VE r V do Far-share(r); Far-share() algorthm For all chld VE n V do Far-share(); If V == then p,.0; a ; Else Local-far-share(); Endf The functon call and return of the functon Far_share () s showed n Fg. (3). The percentage of resource sharng n rtual enterprse s decded after the alue of descendant rtual enterprse s determned. In Table 4, n the frst column, all the functon calls are lsted n post order traersal way. In the second column, the allocaton alue, of eery functon return pont are lsted. 3.call 2.call Far_share(2) 4.return Far_share(4).call Far_share() 9.return 5.call 0.call Fg. (3). The functon call and return. 2.return Far_share(3) Far_share(5) 6.call 8.return.return 7.return Far_share(6) 4. Return Far_share(4) 4,4 7. Return Far_share(6) 6,6 8. Return Far_share(5) 5,5 5,6 9. Return Far_share(2) 2,2 2,4. Return Far_share(3) 3,3 2. Return Far_share(), 5. RESOURCE ALLOCATIONS IN VIRTUAL ENTERRISE 5.. The Allocaton Framework of Internal Resource n Vrtual Enterprse The allocaton framework [2] of nternal resource n rtual enterprse suggested n the artcle utlzes a collaborate mddleware system [3] orented to resource allocaton of rtual enterprse. There s a resource mddleware n eery rtual enterprse, whch masters all the strategy of rtual enterprse and allocates eery msson delered by rtual enterprse users. At the same tme, t prodes the strategy nformaton for resource mddleware of other rtual enterprse. () Submt ob. When a user submts a ob, at frst, t should know the nformaton about the ob and the rtual enterprse and submt the ob n accord wth the strategy to the mddleware. The aldaton of the ob s erfed by the strategy engneer of rtual enterprse n the mddleware. (2) Collect resource sharng nformaton. In order to prode the best resource for user, the mddleware collect resource sharng nformaton n ancestor rtual enterprse from strategy tree of rtual enterprse. User can get access to the resource n ancestor rtual enterprse, because to perform user s work s not only for rtual enterprse tself but for ancestor rtual enterprse. (3) Allocate resource. Based on resource sharng nformaton collected from other rtual enterprses, resource mddleware allocate the resource to specfc ob. Depended on the resource proder s dfferent capacty, msson can be dded to many resource proders. Acceptng t or not s dealt wth the local schedulng of resource proder. (4) Update sharng strategy. If a resource proder accepts a ob from mddleware. At frst, t wll erfy the aldaton of the ob. For example, rtual enterprse of the use should be one of the correspondng rtual enterprses or ts chld rtual enterprse. Through local schedulng algorthm, based on resource mddleware, resource proder updates the changng strategy. Eery resource proder has a local schedulng, whch accepts submtted msson and allocates msson by schedulng strategy. Local schedulng only accepts the msson satsfyng the requrements. The strategy controller communcates wth resource mddleware to acqure status nformaton,2,3 2,5,4 2,6,5,6

6 390 The Open Cybernetcs & Systemcs Journal, 204, Volume 8 Hongbo Wang such as present system utlzaton rate and sharng strategy, etc. In addton to takng responsblty of allocatng ob, resource mddleware takes charge of supersng the arral rate of user s ob. Wth the change of ob arre rate; the percentage of resource utlzaton also changes. Under ths condton, resource mddleware wll nform root rtual enterprse of updatng resource sharng. Then resource mddleware of root rtual enterprse calls the far-share algorthm showed n Table 3 and transfers the changed strategy to the resource mddleware of all the descendant rtual enterprses. When a resource proder ons or leaes rtual enterprse, otherwse the sharng strategy changes, the strategy updatng process wll happen Resource Allocaton Scheme Resource mddleware s n charge of many strateges and data structures correspondng to resource allocaton. Some strateges noled n resource mddleware of rtual enterprse V are as follows: share max : The maxmum of sharng resource proded by resource proder of rtual enterprse, whch s the sum of all the sharng resource proded by resource proder. share curr : The number of resources that are used by rtual enterprse at present. : The utlzaton percentage of resource that rtual, ' enterprse allocates to ts descendant rtual enterprse '. u, ' : The present resource usage of descendant rtual enterprse '. The resource allocaton algorthm of resource mddleware s showed n Table 5. At frst, the resource proder of rtual enterprse s chosen, and then the resource wll be terated among other ancestor rtual enterprses. The process of resource allocaton conssts of two phases: the allocaton based on nternal strategy and the one based on external strategy. In each whle cycle, resource usage strategy abdes by nternal sharng strategy (, ), eery rtual enterprse has a percentage of resource. Therefore, resource mddleware wll at frst allocate resource accordng to nternal sharng strategy. After the allocaton based on nternal strategy s done, the remanng submssons allocate resource wth external strategy, ust as the second whle cycle showed n Table 5. If all the sub-mssons are allocated successfully, the algorthm comes to the end and ob s accepted. If there s not enough resource for operaton, the allocated sub-mssons before wll be cancelled, ob wll be returned. Users can submt the returned ob agan, or resource mddleware can manage the watng sequence of those returned obs [4]. Table 5. Resource allocaton scheme. VE-wde-resource-allocaton(J,) Algorthm /* J=(, {l, l2 lp}, d) refers to a ob; stands for rtual enterprse*/ Task_ndex ; ; Whle " do Whle u, < p, do For each r R do (alloc,load) submt(j,task_ndex,r,); task_ndex task_ndex+alloc; u, u, +load; If task_ndex>p then return accept; endfor endwhle parent(); endwhle ; Whle " do Whle share curr share max < do For each r R do (alloc, load) submt(j,task_ndex,r,); Task_ndex task_ndex+alloc; share curr share curr +load; If task_ndex>p then return accept; endfor endwhle parent(); endwhle Cancel all allocated sub-tasks n the aboe. Return reect; 6. SIMULATION RESULT Heren, the resource allocaton scheme s smulated by grdsm toolkt [5]. Under three dfferent condtons, the smulaton result n herarchcal rtual enterprse s showed n Fg. (4). Fe knds of resource are used as Table 6 shows. In the frst and second stuaton, eery rtual enterprse has only one resource proder. Under the frst crcumstance, all resource proders hae dentcal resource capacty. Under the second crcumstance, the resource capacty of resource proders s dfferent (suppose R >R2 >R3 =R4 =R5). Under the thrd crcumstance, R and R3 proder all resources

7 Research on the Resource Sharng Among Herarchcally Dstrbuted The Open Cybernetcs & Systemcs Journal, 204, Volume 8 39 to VE respectely, other resource proders allocate ther resource to correspondng rtual enterprse aeragely. Table 6. Resource Type The characterstcs of resource. erformance of rocessor (MIS) Number of rocessor R R R R R The ob of eery user s generated n the style of posson dstrbuton, wth the nternal arral tme of fe mnutes. The number of task n eery ob s a random number among 2 to 32. The scope of eery ob s from 00,000MIS to,000,000mis. The deadlne s beyond the aerage execute tme 20% to. The total number of ob submtted by eery user s 000. We wll compare ths scheme wth other resource allocaton schemes, ncludng least load frst, random method, round robn method. Least load frst method selects the resource proder wth least usage to access herarchcal rtual enterprse. Random and round robn method select resource proder n random and round robn respectely. If the ob of user can satsfy the deadlne, t wll be accepted and allocated to resource proder. After smulaton, the aerage receptance of rtual enterprse user s as Fg. (5) shows. Under the frst condton, eery resource proder has the same resource content. The receptance of VE s lower than that of other rtual enterprse, because ther resources are shared by other rtual enterprse users. On the contrary, the receptance of the users of VE 3, VE 4 and VE 5 s relately hgh because they can access the resource proder n hgher leel. Compared wth other allocaton scheme, VE n sharng scheme hae hgher receptance. Under the second condton, although the resource proder of VE has good performance, the receptance of VE n other schemes s stll low. The rtual enterprse user n sharng scheme shows comparately equal receptance. Under the thrd condton, more complex resource sharng strategy s smulated. Because there are many resource proder for VE 3, under other resource allocaton scheme condtons except for sharng scheme, VE 3 shows hgher receptance. The users n sharng scheme show the smlar receptance as the outcome on the far rght n Fg. (5) shows. Resource _ resource type_ U VE U VE U VE R2(R250) U4 U2 VE4 VE2 R2(R000 ) U5 VE5 R(R000 ) U3 VE3 R3(R000 ) U4 U2 VE4 VE2 R(R500) VE5 R2(R000) U5 VE3 U3 R3(R500) U4 VE2 VE3 R(R500) U2 VE4 VE5 R4(R000 ) R3(R000) U5 U3 R4(R000) R5(R000) R4(R500) R5(R500) R5(R500) R6(R750) Fg. (4). The smulaton enronment of rtual enterprses receptance_%_ Sharng scheme LLF Random Round Robn receptance_%_ Sharng scheme LLF Random Round Robn receptance_%_ Sharng scheme LLF Random Round Robn the number of VE users the number of VE users the number of VE users Fg. (5). The aerage receptance of rtual enterprse user under three dfferent condtons.

8 392 The Open Cybernetcs & Systemcs Journal, 204, Volume 8 Hongbo Wang Table 7. The receptance and standard deaton of dfferent strateges under three condtons. Resource Allocaton Scheme The Frst Condton The Second Condton The Thrd Condton Sharng scheme Aerage receptance(%) LLF Random Round Robn Sharng scheme Standard deaton LLF Random Round Robn The aerage receptance and standard deaton n Fg. (5) s shown n Table 7. Compared wth other schemes, the sharng scheme has hgher receptance. At the same tme, the lower standard deaton also reflects ths scheme s comparately far. 7. CONCLUSION In ths paper, based on herarchcally dstrbuted rtual enterprses, a resource allocaton scheme s proded for realzng far resource sharng among these rtual enterprses. Under the specfc resource sharng strategy condtons, the nternal equal sharng strategy s put forward. The resource mddleware n rtual enterprse wll manage the strategy and the poston of rtual enterprses, so that they can collaborate wth one another to make effecte resource allocaton come true. From the result, t shows that the sharng scheme s comparately farer than other schemes and the practcal effect s better. CONFLICT OF INTEREST The author confrms that ths artcle content has no conflct of nterest. ACKNOWLEDGEMENTS Thanks for the support from Hunan pronce phlosophy and socal scence fund proect (3YBA358), hgh leel talents ntroducton proect of central south unersty of forestry and technology (038). REFERENCES [] J. u, and Y. Zhu, Research on the use of grd technology n rtual enterprse, Computer Integrated Manufacturng System, ol., no. 7, pp , [2] S. Venugopal, R. Buyya, and K. Ramamohanarao, A taxonomy of data grds for dstrbuted data sharng management and processng, ACM Computng Sureys, ol. 38, no., pp. -53, [3] Z. Lnng, The deelopment and research stuaton of grd technology, Modern Intellgence, ol. 25, no. 0, pp , [4] F. L, D. Shan, T. Ma, Research on the collaborate producton schedulng mode of rtual enterprse group based on mult-agent, Computer Applcaton Research, ol. 30, no. 6, pp , 203. [5] F. Wang, Y. Hou, J.Yang, Research on spatal data sharng and nteroperablty technology under grd enronment, Computer Scence, ol. 36, no., pp , [6] J. Zhang, D. Yang, The archtecture model of modern logstcs nformaton grd, System Smulaton Technology, ol., no. 3, pp , [7] A. Sulsto, G. odual, R. Buyya, and C. K. Tham, On ncorporatng dfferentated leels of network serce nto GrdSm, Future Generaton Computer Systems (FGCS), ol. 23, no. 4, pp , [8] Q. Zhao, and R. Xao, Research on game analyss and mechansm desgn of rtual enterprse nformaton sharng, Computer Integrated Manufacturng System, ol. 3, no. 8. pp , [9] B. Huang, N. Xao, and B. Lu, The desgn and realzaton of data access under grd enronment, Computer Engneerng and Scence, ol. 27, no. 3, pp. 3-5, [0] J. Sun, and Q. Sun, Dscusson on the nformaton organzaton and management under grd enronment, Modern Intellgence, no. 7, pp. 5-54, [] J. Xao, Y. Wang, and N. Zou, Research on the grd nformaton resource establshment and sharng, Intellgence Magazne, ol. 24, no. 0, pp. 2-4, [2] J.. Goux, S. Kulkarn, J. Lnderoth, and M. Yoder, An Enablng Framework for Master-Worker Applcatons on the Computatonal Grd, In: roc. 9th IEEE Symp. On Hgh erformance Dstrbuted Computng, 2000, IEEE ress. [3] X. Xe, G. He, and D. Zhou, The desgn and realzaton of manufacturng grd data resource ntegrated system by usng mddleware technology, Modern Manufacturng Engneerng, no. 4, pp , 20. [4] X. Wang, Research on the work flow modelng orented to grd montorng, Computer Technology and Deelopment, ol. 23, no. 8, pp , 203. [5] R. Buyya and M. Murshed, GrdSm: a toolkt for the modelng and smulaton of dstrbuted management and schedulng for Grd computng, Concurrency and Computaton: ractce and Experence, ol. 4, no. 3-5, pp , Receed: September 22, 204 Resed: Noember 30, 204 Accepted: December 02, 204 Hongbo Wang; Lcensee Bentham Open. Ths s an open access artcle lcensed under the terms of the Create Commons Attrbuton Non-Commercal Lcense ( lcenses/by-nc/3.0/) whch permts unrestrcted, non-commercal use, dstrbuton and reproducton n any medum, proded the work s properly cted.