One of the challenges facing us in a wide area sensor network (WASN) is how to transfer real-time data produced by sensors quickly and safely to authentic users. In this paper, we propose a solution which is based on both sensor agent which is used to dividing WASN and random number ID encryption. By setting a sensor agent node, we group the sensors according to their geographical condition, and we also grant the agent node some administration privilege to manage the sensors. By selecting a random number for a sensor's ID, we encrypt the data to be transferred. Experiment results shows that our approach is timesaving and has a better locating performance
{"title":"A Safe, Quick and Scalable Solution to Data Flow Transfer in Wide Area Network of Sensors","authors":"Zhendong Yan, Jianfeng Xu, Z. Dou","doi":"10.1109/GCC.2006.18","DOIUrl":"https://doi.org/10.1109/GCC.2006.18","url":null,"abstract":"One of the challenges facing us in a wide area sensor network (WASN) is how to transfer real-time data produced by sensors quickly and safely to authentic users. In this paper, we propose a solution which is based on both sensor agent which is used to dividing WASN and random number ID encryption. By setting a sensor agent node, we group the sensors according to their geographical condition, and we also grant the agent node some administration privilege to manage the sensors. By selecting a random number for a sensor's ID, we encrypt the data to be transferred. Experiment results shows that our approach is timesaving and has a better locating performance","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"4 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":"114280931","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}
Content-based publish/subscribe systems as a cooperation and integration middleware are gaining increasing popularity due to its loose coupling and scalable integration capability. Recently Web-based collaboration develops very fast. RDF as a standard for information exchange in the semantic Web and RDF Site Summary (RSS) based on RDF is becoming popular on the web, however the RSS systems based on pull architecture do not scale well because the websites hosting the popular RSS feeds face high loads imposed by active polling and clients don't detect updates in time. It needs a novel architecture as publish/subscribe system to improve its scalability and efficiency. However existing publish/subscribe systems only have the simple subscription mechanism, and lack of supporting the RDF data. In the paper we introduce a scalable semantic publish/subscribe system for efficient dissemination of the RSS documents. Our system adopts RDF and OWL ontology language to understand the semantic of events. We also propose a highly efficient event matching algorithm based on RDF graph. The prototype of SPS (semantic publish/subscribe system) was developed to selectively disseminate the RSS documents, and the performance tests demonstrated its efficiency and scalability
{"title":"A Semantic Publish/subscribe System for Selective Dissemination of the RSS Documents","authors":"Jiangang Ma, Gang Xu, Jinling Wang, Tao Huang","doi":"10.1109/GCC.2006.19","DOIUrl":"https://doi.org/10.1109/GCC.2006.19","url":null,"abstract":"Content-based publish/subscribe systems as a cooperation and integration middleware are gaining increasing popularity due to its loose coupling and scalable integration capability. Recently Web-based collaboration develops very fast. RDF as a standard for information exchange in the semantic Web and RDF Site Summary (RSS) based on RDF is becoming popular on the web, however the RSS systems based on pull architecture do not scale well because the websites hosting the popular RSS feeds face high loads imposed by active polling and clients don't detect updates in time. It needs a novel architecture as publish/subscribe system to improve its scalability and efficiency. However existing publish/subscribe systems only have the simple subscription mechanism, and lack of supporting the RDF data. In the paper we introduce a scalable semantic publish/subscribe system for efficient dissemination of the RSS documents. Our system adopts RDF and OWL ontology language to understand the semantic of events. We also propose a highly efficient event matching algorithm based on RDF graph. The prototype of SPS (semantic publish/subscribe system) was developed to selectively disseminate the RSS documents, and the performance tests demonstrated its efficiency and scalability","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"19 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":"121587435","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}
The bulk synchronous parallelism (BSP) model is useful in developing scalable software for parallel computation. To adapt the BSP model to the grid environment, the BSP-G, a BSP development library based on the services of Globus Toolkit has been proposed. In this paper, we further the work of BSP-G and introduce an agent assisted ServiceBSP model. The agent in this model could make a QoS-aware selection of computational services and monitor the status of those services. During the selection phase, the agent can handle the diversity of QoS information of services by referring to an ontology repository of quality of service (QoS). An experiment shows that the agent could provide users with satisfied supersteps by selecting Grid services on QoS demand
{"title":"Agent Assisted ServiceBSP Model in Grids","authors":"Junqiang Zhu, W. Tong, Xiaojie Dong","doi":"10.1109/GCC.2006.24","DOIUrl":"https://doi.org/10.1109/GCC.2006.24","url":null,"abstract":"The bulk synchronous parallelism (BSP) model is useful in developing scalable software for parallel computation. To adapt the BSP model to the grid environment, the BSP-G, a BSP development library based on the services of Globus Toolkit has been proposed. In this paper, we further the work of BSP-G and introduce an agent assisted ServiceBSP model. The agent in this model could make a QoS-aware selection of computational services and monitor the status of those services. During the selection phase, the agent can handle the diversity of QoS information of services by referring to an ontology repository of quality of service (QoS). An experiment shows that the agent could provide users with satisfied supersteps by selecting Grid services on QoS demand","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"30 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":"122302801","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}
Di Zheng, Jun Wang, Weihong Han, Yan Jia, Peng Zou
Recent advances in wireless network and the mobile computing devices are affecting how software deployment is being performed. Therefore, to the component-based applications, the deployment of the components should be suited to the user needs, the resources of the terminal and the surrounding environment. Usually we use the component-based middleware to deploy the components, however, the existing component-based middleware do not take charge of the context information. In this paper, we put forward a context-aware middleware for the just-in-time deployment of the component-based applications supporting the context-aware adaptation. In this middleware we provide a set of components being able to collect and analyze the context information and when relevant changes occur, the context-aware components will be notified to apply its adaptation process dynamically. Furthermore, the context-aware infrastructure is separated from the context-aware applications better so as to make the deployment of the context-aware components to be more transparent
{"title":"Towards A Context-Aware Middleware for Deploying Component-Based Applications in Pervasive Computing","authors":"Di Zheng, Jun Wang, Weihong Han, Yan Jia, Peng Zou","doi":"10.1109/GCC.2006.92","DOIUrl":"https://doi.org/10.1109/GCC.2006.92","url":null,"abstract":"Recent advances in wireless network and the mobile computing devices are affecting how software deployment is being performed. Therefore, to the component-based applications, the deployment of the components should be suited to the user needs, the resources of the terminal and the surrounding environment. Usually we use the component-based middleware to deploy the components, however, the existing component-based middleware do not take charge of the context information. In this paper, we put forward a context-aware middleware for the just-in-time deployment of the component-based applications supporting the context-aware adaptation. In this middleware we provide a set of components being able to collect and analyze the context information and when relevant changes occur, the context-aware components will be notified to apply its adaptation process dynamically. Furthermore, the context-aware infrastructure is separated from the context-aware applications better so as to make the deployment of the context-aware components to be more transparent","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"5 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":"128134284","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 technologies enable large-scale sharing of resources within formal or informal consortia of individuals and/or virtual organizations. In these settings, the discovery, characterization, and monitoring of resources, services, and computations can be challenging due to the considerable diversity, large numbers, dynamic behavior, and geographical distribution of the entities in which a user might be interested. Hence, information services are a vital part of any grid software infrastructure, providing fundamental mechanisms for discovery and monitoring, and thus for planning and adapting application behavior. This paper proposes a resource discovery system for grid computing with fault-tolerant capabilities starting from an SSI clustering operating system. The proposed system uses dynamic leader-determination and registration mechanisms to automatically recover from nodes and network failures. The system is centralized and uses dynamic (or soft-state) registration to detect and recover from failures. Provisional or backup leader determination provides tolerance and recovery in the event of the leader node failing. The system was tested against a control network modeled after existing grid computing resource discovery components, such as Globus monitoring and discovery system (MDS). In various failure scenarios, the proposed system showed better resilience and performance than the control system
{"title":"Extending an SSI Cluster for Resource Discovery in Grid Computing","authors":"Javier Echaiz, Jorge Ardenghi","doi":"10.1109/GCC.2006.43","DOIUrl":"https://doi.org/10.1109/GCC.2006.43","url":null,"abstract":"Grid technologies enable large-scale sharing of resources within formal or informal consortia of individuals and/or virtual organizations. In these settings, the discovery, characterization, and monitoring of resources, services, and computations can be challenging due to the considerable diversity, large numbers, dynamic behavior, and geographical distribution of the entities in which a user might be interested. Hence, information services are a vital part of any grid software infrastructure, providing fundamental mechanisms for discovery and monitoring, and thus for planning and adapting application behavior. This paper proposes a resource discovery system for grid computing with fault-tolerant capabilities starting from an SSI clustering operating system. The proposed system uses dynamic leader-determination and registration mechanisms to automatically recover from nodes and network failures. The system is centralized and uses dynamic (or soft-state) registration to detect and recover from failures. Provisional or backup leader determination provides tolerance and recovery in the event of the leader node failing. The system was tested against a control network modeled after existing grid computing resource discovery components, such as Globus monitoring and discovery system (MDS). In various failure scenarios, the proposed system showed better resilience and performance than the control system","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"52 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":"133827471","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}
Gnutella-like unstructured systems usually use flooding with a high number of TTL hops to probe as many peers as possible within a short period of time. However, this mechanism is very inefficient because it handles all queries identically no matter how popular the querying objects are, hence results in a great amount of unnecessary messages. Aiming at improving search efficiency, we propose MSSF, an efficient search mechanism using multiple small-scale floods with different flood sources for each query. Based on MSSF mechanism, three policies are introduced in determining the order of floods initiated: sync, sequence and parallel. The sync policy tries to effect the response time for a query, the sequence policy is designed to minimize the number of messages by seeking to probe the minimum number of peers necessary to obtain the desired number of results, and the parallel policy considers a trade-off between response time and query traffic
{"title":"Multiple Small-Scale Floods in Unstructured P2P Systems","authors":"Qi Zhao, Jingdong Xu, Yun He","doi":"10.1109/GCC.2006.64","DOIUrl":"https://doi.org/10.1109/GCC.2006.64","url":null,"abstract":"Gnutella-like unstructured systems usually use flooding with a high number of TTL hops to probe as many peers as possible within a short period of time. However, this mechanism is very inefficient because it handles all queries identically no matter how popular the querying objects are, hence results in a great amount of unnecessary messages. Aiming at improving search efficiency, we propose MSSF, an efficient search mechanism using multiple small-scale floods with different flood sources for each query. Based on MSSF mechanism, three policies are introduced in determining the order of floods initiated: sync, sequence and parallel. The sync policy tries to effect the response time for a query, the sequence policy is designed to minimize the number of messages by seeking to probe the minimum number of peers necessary to obtain the desired number of results, and the parallel policy considers a trade-off between response time and query traffic","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"8 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":"129337128","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}
Researchers have proved that the general computing capability of the mainstream programmable GPU (graph processing unit, the core of graphic card) is more powerful than that of the popular CPU (central processing unit) recently. In this paper, we attempt to develop such a desktop grid, in which the programmable GPUs' powerful general computing ability could be linked in. The hierarchical topology and benchmarks based scheduling algorithm are adopted in the grid to improve the efficiency of the desktop grid. We contrast the performances of GPUs general computing enabled and non-enabled desktop grid to prove the superiority of GPUs' linking supported by some simulation experiments
{"title":"Programmable GPUs: New General Computing Resources Available for Desktop Grids","authors":"Jian Wang, Aobing Sun, Yongbo Li, Haitao Liu","doi":"10.1109/GCC.2006.76","DOIUrl":"https://doi.org/10.1109/GCC.2006.76","url":null,"abstract":"Researchers have proved that the general computing capability of the mainstream programmable GPU (graph processing unit, the core of graphic card) is more powerful than that of the popular CPU (central processing unit) recently. In this paper, we attempt to develop such a desktop grid, in which the programmable GPUs' powerful general computing ability could be linked in. The hierarchical topology and benchmarks based scheduling algorithm are adopted in the grid to improve the efficiency of the desktop grid. We contrast the performances of GPUs general computing enabled and non-enabled desktop grid to prove the superiority of GPUs' linking supported by some simulation experiments","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"117 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":"133167181","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}
In multi-objective context, the evolutionary approach offers specific mechanisms such as Pareto selection, elitism and diversification. These techniques are proved to be efficient to characterize the Pareto front. However, their high computing time constitutes a major handicap for their expansion. The parallelization of multi-objective evolutionary algorithms (MOEAs) may be an efficient way to overcome this problem. This parallelization aims not only to achieve time saving by distributing the computational effort but also to get benefit from the algorithmic aspect by the cooperation between different populations and evolutionary schemes. In this paper we propose a new parallel multi-objective evolutionary algorithm with multi-front equitable distribution which is based on an elitist technique. Every population evolves differently on a processor and cooperates with the others to preserve genetic diversity and to obtain a set of diversified non dominated solutions
{"title":"Parallel Multi-Objective Evolutionary Algorithm with Multi-Front Equitable Distribution","authors":"Abdelbasset Essabri, M. Gzara, T. Loukil","doi":"10.1109/GCC.2006.68","DOIUrl":"https://doi.org/10.1109/GCC.2006.68","url":null,"abstract":"In multi-objective context, the evolutionary approach offers specific mechanisms such as Pareto selection, elitism and diversification. These techniques are proved to be efficient to characterize the Pareto front. However, their high computing time constitutes a major handicap for their expansion. The parallelization of multi-objective evolutionary algorithms (MOEAs) may be an efficient way to overcome this problem. This parallelization aims not only to achieve time saving by distributing the computational effort but also to get benefit from the algorithmic aspect by the cooperation between different populations and evolutionary schemes. In this paper we propose a new parallel multi-objective evolutionary algorithm with multi-front equitable distribution which is based on an elitist technique. Every population evolves differently on a processor and cooperates with the others to preserve genetic diversity and to obtain a set of diversified non dominated solutions","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"33 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":"117172149","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}
Efficient application scheduling is critical for achieving high performance in homogeneous computing environment. The application scheduling problem has been shown to be NP-complete. However, because of its key importance, this problem has been extensively studied and various algorithms have been proposed in the literatures. In this paper we present a novel algorithm based on list-scheduling and task-duplication on a bounded number of fully connected homogeneous machines. The algorithm is called fast duplication based on earliest finish time (FDEFT). In order to provide a robust and unbiased comparison with the related work, a parametric graph generator was designed to generate weighted directed acyclic graphs with various characteristics. The comparison study, based on both randomly generated graphs and the graphs of Gaussian elimination, shows that our scheduling algorithm significantly outperform on average all other excellent algorithms
{"title":"An Effective Scheduling Algorithm for Homogeneous System","authors":"Yipeng Zhou, Guangzhong Sun, Yunlian Jiang, Yinlong Xu","doi":"10.1109/GCC.2006.26","DOIUrl":"https://doi.org/10.1109/GCC.2006.26","url":null,"abstract":"Efficient application scheduling is critical for achieving high performance in homogeneous computing environment. The application scheduling problem has been shown to be NP-complete. However, because of its key importance, this problem has been extensively studied and various algorithms have been proposed in the literatures. In this paper we present a novel algorithm based on list-scheduling and task-duplication on a bounded number of fully connected homogeneous machines. The algorithm is called fast duplication based on earliest finish time (FDEFT). In order to provide a robust and unbiased comparison with the related work, a parametric graph generator was designed to generate weighted directed acyclic graphs with various characteristics. The comparison study, based on both randomly generated graphs and the graphs of Gaussian elimination, shows that our scheduling algorithm significantly outperform on average all other excellent algorithms","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"22 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":"124155577","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}
As grid computing becomes a reality, a resource broker is needed to manage and monitor available resources. This work presents a workflow-based computational resource broker whose main function is to match available resources with user requests and consider network information status during matchmaking. The resource broker provides a uniform interface for accessing available and the appropriate resources via user credentials. We utilize the NWS tool to monitor the network-related information and resources status. Also, we constructed a grid platform using Globus Toolkit that integrates the distributed resources of five universities in Taichung, Taiwan, where the resource broker is developed. As a result, the proposed broker provides secure and updated information about available resources and serves as a link to the diverse systems available in the grid
{"title":"A Workflow-based Computational Resource Broker with Information Monitoring in Grids","authors":"Chao-Tung Yang, Cheng-Fang Lin, Sung-Yi Chen","doi":"10.1109/GCC.2006.23","DOIUrl":"https://doi.org/10.1109/GCC.2006.23","url":null,"abstract":"As grid computing becomes a reality, a resource broker is needed to manage and monitor available resources. This work presents a workflow-based computational resource broker whose main function is to match available resources with user requests and consider network information status during matchmaking. The resource broker provides a uniform interface for accessing available and the appropriate resources via user credentials. We utilize the NWS tool to monitor the network-related information and resources status. Also, we constructed a grid platform using Globus Toolkit that integrates the distributed resources of five universities in Taichung, Taiwan, where the resource broker is developed. As a result, the proposed broker provides secure and updated information about available resources and serves as a link to the diverse systems available in the grid","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"82 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":"115412405","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
扫码关注我们
求助内容：
应助结果提醒方式：