A Resources Vrtualzaton Approach Supportng Unform Access to Heterogeneous Grd Resources 1 Cunhao Fang 1, Yaoxue Zhang 2, Song Cao 3 1 Tsnghua Natonal Labatory of Inforamaton Scence and Technology 2 Department of Computer Scence and Technology,Tsnghua Unversty 3 School of Software, Tsnghua Unversty 100084 Bejng, P. R. Chna fangch@tsnghua.edu.cn 1 Introducton Grd system has varous knds of resources such as computng resources, storage resources, nstrument resources, data resources, etc. However, because of the dfferences of formats, descrptons, structures, and access modes of these resources, grd computng fals to access these resources unformly and make full use of them. How to organze and manage all sorts of resources as a whole In Grd Envronment, and provde the upper applcaton wth coherent descrpton as well as unform access nterface s the problem of coherency access of dfferent resources In Grd Envronment. Resources vrtualzaton makes better use of the dynamc and dstrbuted resources under grd envronment. It s a proper method to solve the problem descrbed above. Web s a set of protocol warehouse defned by XML. Through protocols and standards such as SOAP,WSDL,UDDI,WSFL,BPEL4WS, t provdes unform regstry, dscovery, bndng, and ntegraton mechansm facng Internet. Web has become an mportant mechansm of resources mutual manpulaton underlyng extensve envronment. Ths research starts wth varous physcal resources In Grd Envronment, transforms and encapsulates varous resources nto s on the bass of Web technology, and further provdes upper applcatons wth unform resources through unform descrpton and management of these s. Based on ths, mult applcaton cases wth the same functon body are merged, dfferent functon bodes are analyzed, and s resource vew on the user functon layer s extracted n support of logc ntegraton process on the user end. The whole vrtualzaton archtecture conssts of three Vews and three Processes, as shown n Fg.1. * Ths paper s sponsored by Natonal Natural Scence Foundaton of Chna (NO. 90604027)
Resources Vew Abstract functonal relaton Abstract Abstract s Transform Vew Physcal Resources Vew s Cluster Data Component Devce s Cluster Functon Clusterng s Pool s Cluster Encapsulatng resources as s Component s Abstractng Devce Data Functon Classfcaton Specfcaton Fg. 1. Layered Archtecture of the Framework The remander of the paper s organzed as follows. Related defntons are presented n Secton 2. Secton 3 ntroduces n detal the process of resources vrtualzaton and organzaton, followed by concluson n Secton 4. 2. Some Defntons Grd system has varous knds of resources such as computng resources, storage resources, nstrument resources, data resources, etc. R refer to the resources pool, all resources n the grd system are n t. Suppose there are n knds of resources n the resources pool, they are R1, R2,, Rn. Defnton 1: Resource R =(Category, F, I, P ) Category s the knd of resource R ; F s the functonal descrpton of resource R ; I s the nterface of resource R (such as callng parameter and runnng results, etc.); P ndcates the usng polcy set of resource R. We use deputy mechansm to demonstrate dfferent knds of s through unformly. Wth regard to s, we have the followng defnton: Defnton 2: S = (Name,BaseInfo,Interface,Bndng,Functon, AD ) Name s dentfcaton; BaseInfo s basc non-behavor nformaton of the ncludng name, author, verson, manufacture, etc;
Interface s the nterface of S (such as callng parameter and runnng results, etc.); Bndng s bndng protocol set of the ; Functon s functon descrpton of the ; AD s applcaton doman of the. 3. Resources vrtualzaton and organzaton process As Fg. 1 shows, resources vrtualzaton and organzaton composes of three Vews and three Processes: Three Vews: 1) Physcal Resources Vew: ths vew refers to varous Grd resources and correspondng supportng tools (e.g. resource deployng tools). 2) s Transform Vew: ths vew ams to mplement the unform resources transform (to Web s format) and to organze the structure of transformed s Pool by analyzng, categorzng and managng these resources accordng to Functon Classfcaton Specfcaton (FCS). 3) Resource Vew: ths vew ams to provde users wth well-organzed s resource vews on the applcaton level through further mnng the semantc relatons of s, to support actve dscovery, composton on demand and other upper-layer applcatons. Three Processes: 1) nstancng process of Resources (Encapsulatng resources as s): As descrbed above, Web based on Internet protocol provdes us an mportant mechansm to realze resources mutual manpulaton underlyng extensve envronment. Thus, the frst step of resources vrtualzaton and organzaton process s to transform all resources nto s and pack them up n the format. Through unform descrpton and management of these s, unform resources are provded to upper applcaton. In ths process, we adopt component deputy mechansm. Durng the actve mplementaton process, we vew varous resource formats such as components, data and equpments as component deputes. Transferrng between these resources s converted nto requests and responds between component deputes (based on message mechansm). Resource R s transformed and encapsulated as a web s (denoted as S ) by mappng the nformaton of R to Web s Specfcaton.(e.g. mappng the R.F to the UDDI regstraton nformaton of S, mappng the R.I to the WSDL descrpton nformaton, mappng the R.P to the WSDL bndng nformaton, etc.). After that, a Agent s ntated to delegate the vrtual S. the Agent frst deploy the R entty nto the grd envronment accordng to the resource knd denoted by R.Category, when a callng request comes, the Agent calls resource R and encapsulate the callng results of resource entty to the message style of s S. Through the descrpton mappng and Agent mechansm, resource R s completely transformed to S.
We present the general process of resources nstancng as follows. Wth regard to resources, we drectly deploy them nto the grd envronment; wth regard to other resources, we can frstly deploy them nto the grd envronment through deputy mechansm, and then pack them up nto s. r Rset, 1 n If r WS then r R set Else Grds ( r deploy ( r )) R Endf set 2) Functon Clusterng Process of s: functon clusterng s to extract the functons of all components, and to consttute a functon categorzaton norm accordng to the relatonshp between dfferent functons. Based on the functon categorzaton norm, a set of s wth smlar functons are merged upon ths functon, and s demonstrated as an abstract. There are some related defntons: (1) Func(S ) s the functon extracton functon, ndcatng the extracted functon of S. (2) FS s the functon categorzaton norm. Intally, t s empty. Accordng to each, through functon extracton functon, extracted functon key words are made one tem of FS. Users are requred to defne relatonshps between dfferent functon key words. The clusterng flow s descrbed as followngs. (a) s pool drectory accordng to the FCS s setup. Each wll advertse ts functon n the drectory. (b) Based on the s pool drectory, a set of s wth smlar functons are merged upon a drectory tem, and are demonstrated as a cluster. (c) The whole cluster forms a net-shaped organzaton structure, whch sets the foundaton for dscovery and further organzaton. The general process of functon clusterng s descrbed as follows: s S n set, 1 If ( funcitem FS, map( Func ( s ), funcitem ) TRUE ) Then Else k k Cluster ( s, funcitem ) ; New( funcitem, m 1) ; funcitem m 1 Func ( s ); Cluster ( s, funcitem ) Endf k k
3) Abstractng and Functonal Relatons lnkng Process: After the above two processes, a set of s wth smlar functons are lnked to the same functon tem wth dentcal transferrng nterfaces and semantcs transferrng relatonshps. The relatonshps between s can be combnaton, nhertance, ncluson, equaton (replacement), callng, etc. Combnatons compose of gradaton, flatons, coalton, recurson, etc. No matter the relatonshp s combnaton, nhertance, ncluson, equaton, or transferrng, there are dfferent semantc relatonshps between these s. In order to better vrtualze resources, we organze up the semantc relatonshps between s to form up a herarchcal functon relatonshp network, namely functon semantcs Ontology and form the s resources vew on the applcaton semantcs level. There are some related defntons. (1)Abstract functon AS ( funcitem ) s, s, map( Func ( s ), funcitem ) TRUE k k (2)Semantc relatonshps between abstract s Let S and Sj be two dfferent sub s n A1, the relatonshps between them R has the same logc relatonshp wth functon sub set defned n Def 4. (3) functon semantcs Ontology functon semantcs ontology composes of three parts: a set of abstract s, ntegraton combnaton relatonshps between s, and nformaton sequences of ntegraton. Ontology =(A AS-subset,A Message,A Scenaro ) A AS-subet =(AS 1, AS 2,, AS n ) It s the abstract s subset cted n the ultmate actve combnaton layer. Ths actve s composed of s n ths subset. A Message =(M 1, M 2,, M n ) s a fnte set of messages. One message s composed of message type, message dspatcher, message recever, and message body. Message body ncludes message parameters and protocol-related data. Defntons of ths part s the same as the message defnton of WSDL. A Scenaro s the composton scheme of actve defned on abstract component subsets AS 1 and AS 2. It descrbes sequence relatonshps and controllng relatonshps of each abstract n AS. On the bases of the above defntons, the defnton process of semantcs relatonshps between abstract s are defned as follows: as ASset, funcitem, as AS( funcitem ),1 n, as, as AS 其中 1, j n j set, If ( Relaton( as, as ) TRUE ) Then j
Add( as, as j, Relaton ( as, as j ), Message ( as, as j) )to Ontology) Endf Wth the help of functon semantcs Ontology, we can further record users requrement analyss and re-composton results after functons decomposton. We use functon semantcs Ontology to defne the relatonshps between ths the sub-functons of decomposed. 4. Concluson In ths paper, we present a vrtualzaton archtecture consstng of three vews and three processes to organze and manage all sorts of resources as a whole In Grd Envronment, and provde the upper applcaton wth coherent descrpton as well as unform access nterface. Frst, varous physcal resources In Grd Envronment are transformed and encapsulated nto s on the bass of Web technology, and unform resources are provded for upper applcatons through unform descrpton and management of these s. Then by analyzng, dentfyng, classfyng, organzng, storng, and managng these transformed s (.e. Functon Clusterng Process of s), mult applcaton cases wth the same functon body are merged, and then the semantc relatonshps between s are further mned to better vrtualze resources. At last, we organze the semantc relatons among s to establsh a herarchcal functon relatonshp network, and form the s Resources Vew on the applcaton semantcs level. References 1. Zhang yaoxue, Fang cunhao. Actve s: Concepts, Archtecture and Implementaton [M]. Thomson Learnng, 2005 July. 2. Borensten, N., and Freed, N. (1993). MIME (Multpurpose Internet Mal Extensons) Part One: Mechansms for Specfyng and Descrbng the Format of Internet Message Bodes, RFC 1521 September. 3. Chan, S.W. K., and Frankln, J. (2003). Dynamc context generaton for natural language understandng: a multfaceted knowledge approach. IEEE Transactons on Systems, Man and Cybernetcs, Part A, 3(31), 23 41. 4. Hrstds,V., Papakonstantnou, Y., and Balmn, A. (2003). Keyword proxmty search on XML graphs. Proc. of the 19th Internatonal Conference on Data Engneerng, 5 8 March, (pp. 367 378). 5. Lawrence, S., Gles, C. L., and Fong, S. (2000). Natural language grammatcal nference wth recurrent neural networks. IEEE Transactons on Knowledge and Data Engneerng, 12(1), 126 140. 6. Meuller, A., Mundt, T., and Lndner, W. (2001). Usng XML to sem-automatcally derve user nterfaces. Second Internatonal Workshop on User Interfaces to Data Intensve Systems,May 31 to June 01.
7. Nakauch, K., Ishkawa, Y., Morkawa, H., and Aoyama, T. (2003). Peer-to-peer keyword search usng keyword relatonshp. Proc. of the CCGrd 2003. 3rd IEEE/ACM Internatonal Symposum on Cluster Computng and the Grd, 12 15 May, (pp. 359 366). 8. Ha, Z. G. (2000). A problem-orented and rule-based component repostory. The Journal of Systems and Software, 50, 201 208. 9. Fang, C. H., Zhang, Y. X., and Xu, K. G. (2003). An XML-based data communcaton soluton for program mnng. Intellgent Data Engneerng and Automated Learnng, 4th Internatonal Conference (pp. 569 575). Hong Kong, Berln Hedelberg: Sprnger-Verlag. 10. Zhang, Y. X., Fang, C. H., and Wang, Y. (2004). A feedback-drven onlne scheduler for processes wth mprecse computng. Journal of Software, 15(4), 616 623.