ChinaGrid supporting platform (CGSP) is a core grid middleware developed for the construction of ChinaGrid. CGSP provides the infrastructure services and the sets of tools to facilitate the seamless use and management of distributed, heterogeneous resources. Execution management, an important function module in CGSP, enables applications to have coordinated access to underlying resources, regardless of their physical location or access mechanism. Execution management is concerned with the problems of instantiating and managing, to completion, units of work (jobs). In CGSP, we provide the execution managements of two categories of atomic job (legacy program job and hyper-service job) and two categories of composite job (workflow job and GridPPI job). In this paper, we will in detail describe the design architecture and key aspects of implementation of execution management in CGSP
{"title":"Execution Management in ChinaGrid Supporting Platform","authors":"Ruyue Ma, Xiangxu Meng, Shijun Liu, Yongwei Wu","doi":"10.1109/GCC.2006.42","DOIUrl":"https://doi.org/10.1109/GCC.2006.42","url":null,"abstract":"ChinaGrid supporting platform (CGSP) is a core grid middleware developed for the construction of ChinaGrid. CGSP provides the infrastructure services and the sets of tools to facilitate the seamless use and management of distributed, heterogeneous resources. Execution management, an important function module in CGSP, enables applications to have coordinated access to underlying resources, regardless of their physical location or access mechanism. Execution management is concerned with the problems of instantiating and managing, to completion, units of work (jobs). In CGSP, we provide the execution managements of two categories of atomic job (legacy program job and hyper-service job) and two categories of composite job (workflow job and GridPPI job). In this paper, we will in detail describe the design architecture and key aspects of implementation of execution management in CGSP","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"483 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127007441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Composition of grid services combines two or more grid services to achieve the desired computing goals, which is becoming important in application from electronic commerce to application interoperation. Numerous frameworks have been proposed for the grid service composition; however, the fundamental research about the essential semantic specification of grid service composition has not been addressed. The imbalance development between the theory and the industry will directly affect QoS (quality of grid service). Under this premise, we attempt to use the pi-calculus to depict the dynamic, concurrent and interactive characteristic of grid service composition. A novel grid service composition signature has been proposed in this paper. Furthermore, based on the expansion to the pi-calculus, we presented the algebraic foundation of the model and formally semantic specification for the dynamic binding and interactive concurrency of the grid service composition
{"title":"Specification for Concurrency and Communication Characteristic of Grid Service Composition using Pi-calculus","authors":"Jing Zhou, Guosun Zeng","doi":"10.1109/GCC.2006.87","DOIUrl":"https://doi.org/10.1109/GCC.2006.87","url":null,"abstract":"Composition of grid services combines two or more grid services to achieve the desired computing goals, which is becoming important in application from electronic commerce to application interoperation. Numerous frameworks have been proposed for the grid service composition; however, the fundamental research about the essential semantic specification of grid service composition has not been addressed. The imbalance development between the theory and the industry will directly affect QoS (quality of grid service). Under this premise, we attempt to use the pi-calculus to depict the dynamic, concurrent and interactive characteristic of grid service composition. A novel grid service composition signature has been proposed in this paper. Furthermore, based on the expansion to the pi-calculus, we presented the algebraic foundation of the model and formally semantic specification for the dynamic binding and interactive concurrency of the grid service composition","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116543708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We implemented a Web-based grid scheduling platform, which can model a system and simulate a scheduling method in grid computing. The scheduling platform is able to perform resource modeling, task modeling, algorithm compiling, simulation, and performance evaluation rapidly in a Web environment. The implemented scheduling platform can be applied as a foundation for grid research and can be used to analyze the efficiency of the scheduling algorithm
{"title":"A Web-based Toolkit for Scheduling Simulation Using GridSim","authors":"O. Kang, Sang-Seong Kang","doi":"10.1109/GCC.2006.22","DOIUrl":"https://doi.org/10.1109/GCC.2006.22","url":null,"abstract":"We implemented a Web-based grid scheduling platform, which can model a system and simulate a scheduling method in grid computing. The scheduling platform is able to perform resource modeling, task modeling, algorithm compiling, simulation, and performance evaluation rapidly in a Web environment. The implemented scheduling platform can be applied as a foundation for grid research and can be used to analyze the efficiency of the scheduling algorithm","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134240978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Huyin Zhang, Chanle Wu, Qing Xiong, Libing Wu, Gang Ye
This paper gives a definition of the communication overhead among nodes in task scheduling and resource management in grid environment, presents rules of building QoS routing tree based on the QoS routing algorithm, proposes grid heap-sort algorithm and QoS routing algorithm, and designs a scheme of grid task scheduling with the help of them. The results of its correlative experiment indicate that this design can guarantee quality of service in grid better
{"title":"Research on an Effective Mechanism of Task-scheduling in Grid Environment","authors":"Huyin Zhang, Chanle Wu, Qing Xiong, Libing Wu, Gang Ye","doi":"10.1109/GCC.2006.79","DOIUrl":"https://doi.org/10.1109/GCC.2006.79","url":null,"abstract":"This paper gives a definition of the communication overhead among nodes in task scheduling and resource management in grid environment, presents rules of building QoS routing tree based on the QoS routing algorithm, proposes grid heap-sort algorithm and QoS routing algorithm, and designs a scheme of grid task scheduling with the help of them. The results of its correlative experiment indicate that this design can guarantee quality of service in grid better","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134346735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web services are a new breed of Web applications. As the services published on Internet expand exponentially, finding them becomes more and more time-consuming. UDDI v2 has added a new feature, publisherAssersion, to express the relation between business entities in a UDDI repository center just like a hyperlink between Web pages. Thus, a Web service graph could be generated. This paper observes the new features of Web services first. The principles and algorithm for constructing a Web service graph is proposed and analyzed in detail. Using Web service graph for service discovery is elaborated then. Finally, it is shown from the simulated experiment that the Web service graph proposed in our paper is useful for composite Web service discovery
{"title":"Web Services as a Graph and Its Application for Service Discovery","authors":"Jianxun Liu, Lian Chao","doi":"10.1109/GCC.2006.98","DOIUrl":"https://doi.org/10.1109/GCC.2006.98","url":null,"abstract":"Web services are a new breed of Web applications. As the services published on Internet expand exponentially, finding them becomes more and more time-consuming. UDDI v2 has added a new feature, publisherAssersion, to express the relation between business entities in a UDDI repository center just like a hyperlink between Web pages. Thus, a Web service graph could be generated. This paper observes the new features of Web services first. The principles and algorithm for constructing a Web service graph is proposed and analyzed in detail. Using Web service graph for service discovery is elaborated then. Finally, it is shown from the simulated experiment that the Web service graph proposed in our paper is useful for composite Web service discovery","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131905351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Grid workflow is an important technique to implement cooperation of services in a grid. QoS allows for the selection and execution of grid workflow to better fulfil customer expectations. Before the execution of a workflow, users need to provide the QoS requirements, and then the workflow service evaluates the requirements and returns the evaluation results. This paper proposes a QoS negotiation protocol to support such negotiation process and also introduces the architecture of supporting software system
{"title":"A QoS Negotiation Protocol for Grid Workflow","authors":"Yong Wang, Li Wang, Chunming Hu","doi":"10.1109/GCC.2006.14","DOIUrl":"https://doi.org/10.1109/GCC.2006.14","url":null,"abstract":"Grid workflow is an important technique to implement cooperation of services in a grid. QoS allows for the selection and execution of grid workflow to better fulfil customer expectations. Before the execution of a workflow, users need to provide the QoS requirements, and then the workflow service evaluates the requirements and returns the evaluation results. This paper proposes a QoS negotiation protocol to support such negotiation process and also introduces the architecture of supporting software system","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125473507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We propose to use W3C Web services and recently emerging scientific workflow technologies for geospatial data processing in distributed and heterogeneous computation environments. The Web service technology provides platform independence and greater interoperability; the scientific workflow technology provides software reuse and visual programming. We demonstrate the feasibility of the proposed approach using storm dynamics tracking from weather radar data as an example. Technical details of algorithm development, Web services publishing, workflow composition and execution for the demonstrative example are discussed
{"title":"Tracking Dynamics of Geospatial Phenomena in Distributed and Heterogeneous Environments Using Scientific Workflow and Web Services Technologies","authors":"Jianting Zhang","doi":"10.1109/GCC.2006.95","DOIUrl":"https://doi.org/10.1109/GCC.2006.95","url":null,"abstract":"We propose to use W3C Web services and recently emerging scientific workflow technologies for geospatial data processing in distributed and heterogeneous computation environments. The Web service technology provides platform independence and greater interoperability; the scientific workflow technology provides software reuse and visual programming. We demonstrate the feasibility of the proposed approach using storm dynamics tracking from weather radar data as an example. Technical details of algorithm development, Web services publishing, workflow composition and execution for the demonstrative example are discussed","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"29 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113942030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A multiserver multiqueue (MSMQ) based scheduling system of the service grid system and a modeling and analysis method based on stochastic Petri net (SPN) are proposed. Due to the cost and resources consumed are different for difference grid service requests, the multiple priority queues are designed in the grid scheduler of the scheduling system. In order to promote the throughput, we propose a priority-based advanced shortest expected delay first scheduling algorithm (P-ASED) which consists of two steps: the first step is request selecting according to the priority of requests; and the second step is request dispatching according to the weighted average of the expected delay and relative queue length of service nodes. The simulation experiments verify that the proposed MSMQ-based scheduling system and the P-ASED algorithm can schedule the service request according to the priority and promote the throughput of the service grid system
{"title":"Modeling and Performance Analysis of a Priority-based Scheduling Scheme in Service Grid","authors":"Li Li, Fangchun Yang","doi":"10.1109/GCC.2006.61","DOIUrl":"https://doi.org/10.1109/GCC.2006.61","url":null,"abstract":"A multiserver multiqueue (MSMQ) based scheduling system of the service grid system and a modeling and analysis method based on stochastic Petri net (SPN) are proposed. Due to the cost and resources consumed are different for difference grid service requests, the multiple priority queues are designed in the grid scheduler of the scheduling system. In order to promote the throughput, we propose a priority-based advanced shortest expected delay first scheduling algorithm (P-ASED) which consists of two steps: the first step is request selecting according to the priority of requests; and the second step is request dispatching according to the weighted average of the expected delay and relative queue length of service nodes. The simulation experiments verify that the proposed MSMQ-based scheduling system and the P-ASED algorithm can schedule the service request according to the priority and promote the throughput of the service grid system","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"1 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131898450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yuedong Zhang, Zhenhua Song, Dingju Zhu, Zhuan Chen, Yuzhong Sun
Some popular computing technologies, such as ubiquitous computing, grid computing and thin-client computing, bring people to a much more distributed and pervasive computing environment. Based on these innovative technologies, a distributed virtual personal computing (DVPC) paradigm is coming into being. One of the fundamental challenges in the DVPC design is the virtually integrated but physically distributed desktop system. We proposed Redar, a remote desktop architecture for the DVPC. Redar integrates various user interfaces from diverse service nodes into one virtual desktop, and present the virtual desktop to the ultra-thin user client. The user interfaces currently supported by Redar include the application GUIs as well as the mobile storage interfaces. The key components in Redar are the GUI merger, the virtual desktop manager, the ultra-thin-client and the transport protocols. We have implemented Redar in a DVPC prototype system. According to our evaluation, Redar shows perfect display latency, storage I/O, overhead, scalability and robustness
{"title":"Redar: A Remote Desktop Architecture for the Distributed Virtual Personal Computing","authors":"Yuedong Zhang, Zhenhua Song, Dingju Zhu, Zhuan Chen, Yuzhong Sun","doi":"10.1109/GCC.2006.78","DOIUrl":"https://doi.org/10.1109/GCC.2006.78","url":null,"abstract":"Some popular computing technologies, such as ubiquitous computing, grid computing and thin-client computing, bring people to a much more distributed and pervasive computing environment. Based on these innovative technologies, a distributed virtual personal computing (DVPC) paradigm is coming into being. One of the fundamental challenges in the DVPC design is the virtually integrated but physically distributed desktop system. We proposed Redar, a remote desktop architecture for the DVPC. Redar integrates various user interfaces from diverse service nodes into one virtual desktop, and present the virtual desktop to the ultra-thin user client. The user interfaces currently supported by Redar include the application GUIs as well as the mobile storage interfaces. The key components in Redar are the GUI merger, the virtual desktop manager, the ultra-thin-client and the transport protocols. We have implemented Redar in a DVPC prototype system. According to our evaluation, Redar shows perfect display latency, storage I/O, overhead, scalability and robustness","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132457816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xindong You, G. Chang, Xueyao Chen, Cuihua Tian, Chuan Zhu
Providing fast, reliable and transparent access to data to all users within a community is one of the most crucial functions of data management in a grid environment. Replication strategies are regarded as one of the major optimization techniques for reducing access latency, improving data locality, and increasing robustness, scalability, and performance for the data grids. Compared with economy-based strategies implemented in OptorSim, utility-based strategies proposed in this paper, which make "buying" or replacement decision based on the utility model, achieve better performance in job execution cost and storage consumption with the same jobs being finished in three different type data grids. The simulation experiments also show that the larger the test data grid scale is, the more the job execution cost saved, which makes our method have a greater advantage in continuously growing data grids
{"title":"Utility-Based Replication Strategies in Data Grids","authors":"Xindong You, G. Chang, Xueyao Chen, Cuihua Tian, Chuan Zhu","doi":"10.1109/GCC.2006.96","DOIUrl":"https://doi.org/10.1109/GCC.2006.96","url":null,"abstract":"Providing fast, reliable and transparent access to data to all users within a community is one of the most crucial functions of data management in a grid environment. Replication strategies are regarded as one of the major optimization techniques for reducing access latency, improving data locality, and increasing robustness, scalability, and performance for the data grids. Compared with economy-based strategies implemented in OptorSim, utility-based strategies proposed in this paper, which make \"buying\" or replacement decision based on the utility model, achieve better performance in job execution cost and storage consumption with the same jobs being finished in three different type data grids. The simulation experiments also show that the larger the test data grid scale is, the more the job execution cost saved, which makes our method have a greater advantage in continuously growing data grids","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129891478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：