{"title":"Solution of Large Scale Matrix Inversion on Cluster and Grid","authors":"Ling Shang, Zhijian Wang, S. Petiton, Feng Xu","doi":"10.1109/GCC.2008.18","DOIUrl":"https://doi.org/10.1109/GCC.2008.18","url":null,"abstract":"Large scale matrix inversion has been used in many domains and block-based Gauss-Jordan (G-J) algorithm as a classical method of large matrix inversion has become the focus of many researchers. Many people show us their parallel version of G-J. But the large parallel granularity in those algorithms restricts the performance of parallel block-based G-J algorithm, especially in the cluster environment consisting of PCs or workstations. This paper presents a fine-grained parallel G-J algorithm to settle the problem presented above. Experiments are made based on YML a framework which enables using different middleware to make large scale parallel computing for its feathers of components reuse, easy programmability for noncomputer professionals. Cluster and Grid environments are based on Grid'5000 platform, France. Experiments show us that the better performance of fine-grained parallel G-J algorithm and YML though overhead existing is a good solution for large scale parallel computing.","PeriodicalId":105165,"journal":{"name":"2008 Seventh International Conference on Grid and Cooperative Computing","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115227997","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}
Zhili Zhao, Ruisheng Zhang, Jiazao Lin, Ying Chen, Huajian Zhang, Lian Li
{"title":"An Improved Visual BPEL-Based Environment for Scientific Workflow","authors":"Zhili Zhao, Ruisheng Zhang, Jiazao Lin, Ying Chen, Huajian Zhang, Lian Li","doi":"10.1109/GCC.2008.88","DOIUrl":"https://doi.org/10.1109/GCC.2008.88","url":null,"abstract":"Scientists are increasingly using scientific workflow environment to manage large data sets and execute experiments on distributed resources. Scientific workflows have become an important mechanism for scientists to combine scientific data management, analysis, simulation, and visualization tasks. However, most of the environments don't fully hide the complexity of the underlying orchestration language and middleware. What's more, almost all environments only provide a graphical editor but do nothing to offer a programmatic environment to scientists with the knowledge of the programming. In this paper, we introduce an improved scientific workflow environment called SWFVD to solve these problems by isolating visual representation from translation visual representation to business process execution language (BPEL). Meanwhile, we add some tool support for scientist to deal with BPEL to make the whole environment more convenient. The prototype of SWFVD based on China gird supporting platform (CGSP) is also given and examplesfrom chemistry are presented.","PeriodicalId":105165,"journal":{"name":"2008 Seventh International Conference on Grid and Cooperative Computing","volume":"288 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125878814","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}
Ye Huang, Amos Brocco, P. Kuonen, M. Courant, B. Hirsbrunner
{"title":"SmartGRID: A Fully Decentralized Grid Scheduling Framework Supported by Swarm Intelligence","authors":"Ye Huang, Amos Brocco, P. Kuonen, M. Courant, B. Hirsbrunner","doi":"10.1109/GCC.2008.24","DOIUrl":"https://doi.org/10.1109/GCC.2008.24","url":null,"abstract":"Resource management and scheduling has proven to be one of the key topics for grid computing. Nowadays, the resource management field is subdivided into low-level and high-level approaches. While low-level resource management systems normally concern the scheduling activities within a single virtual organization, high-level schedulers focus on the large scale resources utilization with unstable resource availability, low reliability networks, multi-policies, multi-administrative domains, etc. In this paper, we propose a decentralized framework named SmartGRID to tackle high-level grid resource management and scheduling. Within the SmartGRID framework, swarm intelligence algorithms are used for resource discovery and monitoring, standard protocols and schemes are adopted for scheduler interoperability, and an embedded plugin mechanism is provided to utilize multi-type external scheduling strategies. With a clearly decoupled layered architecture, SmartGRID has been designed to be a generic and modular environment to support intelligent and interoperable grid resource management upon a volatile, dynamics, and heterogeneous grid computing infrastructure.","PeriodicalId":105165,"journal":{"name":"2008 Seventh International Conference on Grid and Cooperative Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115087253","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}
{"title":"A Design for Polygon Overlay Algorithm in the Simple Feature Model","authors":"Zhong Xie, Zi Ye, Liang Wu","doi":"10.1109/GCC.2008.41","DOIUrl":"https://doi.org/10.1109/GCC.2008.41","url":null,"abstract":"Most of the vector overlay operations are designed in the vector-topological model, which require the individual layers structured with full topology. It takes rather a long time to build the topology to each of the input data sets, and the output of the process is a new topological structured layer whose topology information seldom needed. In order to avoid the time-consuming topology building process and improve the efficiency of the vector overlay operations, some GIS platforms developed the spatial analysis operations making use of the OGC simple feature specification. The paper describes the vector overlay operations in simple feature model and takes the polygon intersection operation as an example to illustrate the design and implement of our algorithm. The main problem during the polygon overlay operation is the spurious polygons and 'coastline weave', which tends to arise when two lines are overlaid which are actually slightly different versions of a same line. The paper adopts an effectual decision strategy in line-intersection algorithm to provide a better solution to both the accuracy and efficiency of it, through focus on the problem of the successive entry-point or exit-point and the repeated intersection points, and the alternative searching of the intersected polygon. Performance tests show the presented polygon overlay algorithm provides good analysis performance in GIS, and this design lead to a better performance than the algorithm based on the topological model especially when the data quantity goes to large.","PeriodicalId":105165,"journal":{"name":"2008 Seventh International Conference on Grid and Cooperative Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122169212","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}
{"title":"A History-Based Motion Prediction Method for Mouse-Based Navigation in 3D Digital City","authors":"Xiaohong Zhang, Shengzhong Feng, Jianping Fan","doi":"10.1109/GCC.2008.8","DOIUrl":"https://doi.org/10.1109/GCC.2008.8","url":null,"abstract":"The speed of interactive rendering in digital city can be improved through effective data management, graphic technology, workload balance based on multi-processors and others. But if the object is not in memory when it is rendered, system performance drops abruptly. The history-based motion prediction method aims at high file hits and predicts the future motion according to the historical ones. The method produces better results when interpolation is added.","PeriodicalId":105165,"journal":{"name":"2008 Seventh International Conference on Grid and Cooperative Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124672725","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}
{"title":"REBAR: A Reliable and Energy Balanced Routing Algorithm for UWSNs","authors":"Jinming Chen, Xiaobing Wu, Guihai Chen","doi":"10.1109/GCC.2008.12","DOIUrl":"https://doi.org/10.1109/GCC.2008.12","url":null,"abstract":"In this paper, we propose a reliable and energy-efficient routing algorithm for underwater wireless sensor networks (UWSNs). We first use a sphere energy depletion model to analyze the energy consumption of nodes in UWSNs. We then extend the model by considering the node mobility in UWSNs. Our analysis is in accordance with the common view that although water flows might cause the underwater environment more dynamic, this instability can actually improve energy-efficiency. However, the nodes closer to the sink still tend to die early, causing network partition around the sink. Accordingly, we propose a Reliable and Energy BAlanced Routing algorithm (REBAR). We explore the tradeoff between packet delivery ratio and energy efficiency. We design an adaptive scheme for setting data propagation range in order to balance the energy consumption throughout the network. Multi-path routing is used to provide redundancy. We further extend REBAR to deal with possible routing voids in the network which could be common in UWSNs. Simulation results show that our protocol outperforms existing VBF-based approaches in terms of reliability and network lifetime.","PeriodicalId":105165,"journal":{"name":"2008 Seventh International Conference on Grid and Cooperative Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129841661","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}
{"title":"An Active-Drop Congestion Control Protocol in Peer-to-Peer Multicast Streaming","authors":"Weizhan Zhang, Q. Zheng, Yanze Lian, Yiqin Yu","doi":"10.1109/GCC.2008.71","DOIUrl":"https://doi.org/10.1109/GCC.2008.71","url":null,"abstract":"In this paper, an active-drop congestion control protocol for peer-to-peer multicast based on a layered video codec is presented, which is tailored toward support of live media delivery on peer-to-peer overlay. Especially, the protocol fully utilizes the characteristics of the peer-to-peer multicast, namely, the tree nodes cooperative relativity, heterogeneity support, and session flexibilities. It distinguishes itself from previous researches with the following innovations: (1) a weight allocation for peer nodes is introduced, which depends on the weighted location of the nodes in the media delivery tree. (2) Based on the weight allocation, an active-drop algorithm is executed which is beneficial for providing differentiate service for the peer-to-peer multicast. (3) Finally, a dynamic optimization of the tree construction is introduced when the active-drop strategy can not meet the quality requirement. The simulation results show that the proposed method provides an efficient congestion control on the context of peer-to-peer multicast with service differentiation.","PeriodicalId":105165,"journal":{"name":"2008 Seventh International Conference on Grid and Cooperative Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129896400","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}
{"title":"Agent-based Spatial Query Processing and Resource Management in Grid Environment","authors":"Yufei Bai, Xiujun Ma, Kunqing Xie, Ping Zhang, Xiong Li, Yixian Sun, Ke-Xin Li","doi":"10.1109/GCC.2008.117","DOIUrl":"https://doi.org/10.1109/GCC.2008.117","url":null,"abstract":"The cooperative task processing and resource management among autonomous and heterogeneous spatial database systems in a grid environment is a challenge work. In this paper, we propose a BDI agent framework to process spatial query and dynamically manage resource in a grid environment. The BDI rational engine and the FIPA Contract Net Interaction Protocol can help spatial query agents to dynamically select the optimum spatial resource agents to execute spatial query efficiently. Theme agents can learn the history records of resource which were visited in the past period, and then make a strategy of adjusting the distribution of spatial resource. Theme agents will call the proper resource agents to take the actual action to adjusting the spatial resource.","PeriodicalId":105165,"journal":{"name":"2008 Seventh International Conference on Grid and Cooperative Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123401884","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}
{"title":"Multi-Phase Efficient Service Composition","authors":"Zongxia Du, Wenyi Zhang","doi":"10.1109/GCC.2008.43","DOIUrl":"https://doi.org/10.1109/GCC.2008.43","url":null,"abstract":"There are always a number of services published or destroyed ceaselessly on the Internet, so how to make sure that the composite services are incessantly flexible, available and executed effectively has been one of the main focuses all the while. And the problem here is that the currently wide-adopted static composition pattern and the dynamic composition pattern sometimes can not give a satisfying performance in their flexibility or efficiency. So in this paper, a multi-phase lifecycle model of service composition will be presented to solve the problem mentioned above. Architecture is given to archive the multi-phase service composition model and modules are illuminated separately.","PeriodicalId":105165,"journal":{"name":"2008 Seventh International Conference on Grid and Cooperative Computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123520427","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}
{"title":"The Data Transfer Strategy Research on Distributed Mobile Environment","authors":"Yanxin Xue, Xiao-song Mao","doi":"10.1109/GCC.2008.92","DOIUrl":"https://doi.org/10.1109/GCC.2008.92","url":null,"abstract":"Network bandwidth and communication links are often leaping instability in the distributed mobile network environment, and network links exist continued even broken. How to provide a stable and reliable network access capability in this particular network environment is an urgent task to solve. This paper presents a data structure model in collaborative environment against unstable wireless network and heterogeneous enterprise applications environment, and designs the data transfer strategy and message format selection method for the model. The strategy effectively ensure the cooperation process and implementation efficiency of cooperation group members in the distributed mobile network environment.","PeriodicalId":105165,"journal":{"name":"2008 Seventh International Conference on Grid and Cooperative Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125731346","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}