The existing DHT-based file storage systems are suffering problems of being restricted to exact match and lacking semantic-based query. To solve these problems, a DHT-based file storage system named FCAN is proposed. Mapping a document vector from semantic space to P2P space by FastMap, FCAN can effectively reduce the dimensions of it to implement semantic-based query without affecting the semantic integrality of this document. By clustering the nearest neighbors based on centroid, FCAN is further improved to reduce the redundant messages and search time. Simulations show that FCAN has not only higher recall and precision, but also fewer search time and redundant messages
{"title":"FCAN: A Structured P2P System Based on Content Query","authors":"Jing Wang, Shoubao Yang, Ying Gao, Leitao Guo","doi":"10.1109/GCC.2006.44","DOIUrl":"https://doi.org/10.1109/GCC.2006.44","url":null,"abstract":"The existing DHT-based file storage systems are suffering problems of being restricted to exact match and lacking semantic-based query. To solve these problems, a DHT-based file storage system named FCAN is proposed. Mapping a document vector from semantic space to P2P space by FastMap, FCAN can effectively reduce the dimensions of it to implement semantic-based query without affecting the semantic integrality of this document. By clustering the nearest neighbors based on centroid, FCAN is further improved to reduce the redundant messages and search time. Simulations show that FCAN has not only higher recall and precision, but also fewer search time and redundant messages","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":"130432655","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}
All resources of grid systems are connected by network and Ethernet-based TCP/IP is a widely used network in the grid systems. The TCP/IP is processed on a host CPU in computer systems and this imposes heavy loads on the host CPU. Recently TCP/IP offload engine (TOE) technology, which processes TCP/IP on a network adapter instead of the host CPU, has become an important approach to this problem. To adopt the TOE to computer systems successfully, it is necessary to develop a kernel module supporting the TOE. The TOE kernel module should provide the binary compatibility for the BSD socket interface, which is widely used in the most network programming, and support both of the TOE and the Ethernet-based NIC simultaneously. This paper proposes a TOE kernel module satisfying these requirements in the Linux systems. Experimental results also show that the TOE kernel module imposes little load on the host CPU
{"title":"An Efficient Linux Kernel Module supporting TCP/IP Offload Engine on Grid","authors":"Soo-Cheol Oh, Seongwoon Kim","doi":"10.1109/GCC.2006.27","DOIUrl":"https://doi.org/10.1109/GCC.2006.27","url":null,"abstract":"All resources of grid systems are connected by network and Ethernet-based TCP/IP is a widely used network in the grid systems. The TCP/IP is processed on a host CPU in computer systems and this imposes heavy loads on the host CPU. Recently TCP/IP offload engine (TOE) technology, which processes TCP/IP on a network adapter instead of the host CPU, has become an important approach to this problem. To adopt the TOE to computer systems successfully, it is necessary to develop a kernel module supporting the TOE. The TOE kernel module should provide the binary compatibility for the BSD socket interface, which is widely used in the most network programming, and support both of the TOE and the Ethernet-based NIC simultaneously. This paper proposes a TOE kernel module satisfying these requirements in the Linux systems. Experimental results also show that the TOE kernel module imposes little load on the host CPU","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"75 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":"130326624","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 resources having heterogeneous architectures, being geographically distributed and interconnected via unreliable network media, are at the risk of failure. Grid environment consists of unreliable resources; therefore, fault tolerant mechanisms can not be ignored. Some scientific jobs require long commitments of grid resources whose failures may not be overlooked. We need a flexible management of these failures by considering the failure of fault manager itself. In this paper we propose the concept of distributed management of failures without engaging the resources for this particular task exclusively. Resources performing the fault management may also participate in serving the long running user jobs. Each sub-job of the main user job is inspected by an individual resource. In case of failure inspector resource takes over in place of inspected resource. Contributions of this paper are: elimination of single point of failure and proposed concept's ability to be integrated with variety of grid middleware
{"title":"Distributed Fault Management for Computational Grids","authors":"M. Affaan, M.A Ansari","doi":"10.1109/GCC.2006.39","DOIUrl":"https://doi.org/10.1109/GCC.2006.39","url":null,"abstract":"Grid resources having heterogeneous architectures, being geographically distributed and interconnected via unreliable network media, are at the risk of failure. Grid environment consists of unreliable resources; therefore, fault tolerant mechanisms can not be ignored. Some scientific jobs require long commitments of grid resources whose failures may not be overlooked. We need a flexible management of these failures by considering the failure of fault manager itself. In this paper we propose the concept of distributed management of failures without engaging the resources for this particular task exclusively. Resources performing the fault management may also participate in serving the long running user jobs. Each sub-job of the main user job is inspected by an individual resource. In case of failure inspector resource takes over in place of inspected resource. Contributions of this paper are: elimination of single point of failure and proposed concept's ability to be integrated with variety of grid middleware","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"34 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":"126271590","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}
Xiangfeng Luo, Ning Fang, Zhe Yang, Huizhe Xiao, Weimin Xu
The characteristics of scientific text topics discovery in e-science semantic grid environment is given firstly, and then a novel method about scientific text topics discovery is proposed. Thirdly the mean function of distances between topics to evaluate the scientific text topics discovery process is also presented. Finally, we adopt the texts of GCC2003 to prove that the proposed method has the ability in composition and decomposition as well as higher semantics; therefore the proposed method can provide researchers with more accurate knowledge services in e-science semantic grid environment and has bright future
{"title":"Scientific Text Topics Discovery for e-science Semantic Grid Environment","authors":"Xiangfeng Luo, Ning Fang, Zhe Yang, Huizhe Xiao, Weimin Xu","doi":"10.1109/GCC.2006.84","DOIUrl":"https://doi.org/10.1109/GCC.2006.84","url":null,"abstract":"The characteristics of scientific text topics discovery in e-science semantic grid environment is given firstly, and then a novel method about scientific text topics discovery is proposed. Thirdly the mean function of distances between topics to evaluate the scientific text topics discovery process is also presented. Finally, we adopt the texts of GCC2003 to prove that the proposed method has the ability in composition and decomposition as well as higher semantics; therefore the proposed method can provide researchers with more accurate knowledge services in e-science semantic grid environment and has bright future","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"2 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":"128120416","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}
Chunqing Wu, Xiangquan Shi, Xuejun Yang, Jinshu Su
Network processors are becoming a predominant feature in the field of network hardware due to its high performance and flexibility. The performance of network processor mainly depends on its architecture. This paper studied the parallel architecture and multithread mechanism in network processor. We discussed reasons of thread stalls and the principle of hiding latencies caused by various stalls using multithread mechanism. Lastly, we present the test results based on analyzing the relationship of active thread number and the performance of network processor
{"title":"The Impact of Parallel and Multithread Mechanism on Network Processor Performance","authors":"Chunqing Wu, Xiangquan Shi, Xuejun Yang, Jinshu Su","doi":"10.1109/GCC.2006.91","DOIUrl":"https://doi.org/10.1109/GCC.2006.91","url":null,"abstract":"Network processors are becoming a predominant feature in the field of network hardware due to its high performance and flexibility. The performance of network processor mainly depends on its architecture. This paper studied the parallel architecture and multithread mechanism in network processor. We discussed reasons of thread stalls and the principle of hiding latencies caused by various stalls using multithread mechanism. Lastly, we present the test results based on analyzing the relationship of active thread number and the performance of network processor","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"3 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":"115339278","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 streaming video over the Internet becomes increasingly popular, cost-effective caching of these large multimedia documents has become of utmost importance. For large media objects, such as a 2-hour video, treating the whole video as a single Web object for caching is not appropriate. The paper presents reservation-based caching algorithms to evaluate a segment-based buffer management approach for off-line scheduling and caching in polynomial time. The cache admission and replacement policies decide when, where and for how long videos will be cached. Requests for videos are available a priori
{"title":"Network-based Caching Algorithms for Reservation-based Multimedia Systems","authors":"B. Veeravalli, Zeng Zeng, N. Gupta, Guoguang Jia","doi":"10.1109/GCC.2006.66","DOIUrl":"https://doi.org/10.1109/GCC.2006.66","url":null,"abstract":"As streaming video over the Internet becomes increasingly popular, cost-effective caching of these large multimedia documents has become of utmost importance. For large media objects, such as a 2-hour video, treating the whole video as a single Web object for caching is not appropriate. The paper presents reservation-based caching algorithms to evaluate a segment-based buffer management approach for off-line scheduling and caching in polynomial time. The cache admission and replacement policies decide when, where and for how long videos will be cached. Requests for videos are available a priori","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"2 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":"123891729","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 this paper, through utilizing the complementarity of CC and SSE-CMM, we map CC to SSE-CMM, and present a new evaluation strategy for security systems and products: CCS_SE-CMM_CS. The following quantitative analysis is shown that CCS_SE-CMM_CS not only can decrease evaluation expensive, time-consuming and arduous, but also can make the results of evaluation based on CCS_SE-CMM_CS have inheritance, that is to say, the evaluation results of TOE have relation with the same engineering team, the forgoing systems developed by analogous engineering process. More important, the new evaluation strategy has a reasonable time frame, and responds well to the market demands of developers and consumers, as well as improve the evaluation efficiency
{"title":"A New Evaluation Strategy Based on Combining CC and SSE-CMM for Security Systems and Products","authors":"Tan Liang, Ming-Tian Zhou","doi":"10.1109/GCC.2006.12","DOIUrl":"https://doi.org/10.1109/GCC.2006.12","url":null,"abstract":"In this paper, through utilizing the complementarity of CC and SSE-CMM, we map CC to SSE-CMM, and present a new evaluation strategy for security systems and products: CCS_SE-CMM_CS. The following quantitative analysis is shown that CCS_SE-CMM_CS not only can decrease evaluation expensive, time-consuming and arduous, but also can make the results of evaluation based on CCS_SE-CMM_CS have inheritance, that is to say, the evaluation results of TOE have relation with the same engineering team, the forgoing systems developed by analogous engineering process. More important, the new evaluation strategy has a reasonable time frame, and responds well to the market demands of developers and consumers, as well as improve the evaluation efficiency","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":"127398435","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 computing infrastructures embody a cost-effective computing paradigm that virtualises heterogeneous system resources to meet the dynamic needs of critical business and scientific applications. These applications range from batch processes and long-running tasks to more real-time and even transactional applications. Grid schedulers aim to make efficient use of grid resources in a cost-effective way, while satisfying the quality-of-service requirements of the applications. Scheduling in such a large-scale, dynamic and distributed environment is a complex undertaking. In this paper, we propose an approach to grid scheduling which abstracts over the details of individual applications and aims to provide a globally optimal schedule, while having the ability to dynamically adjust to varying workload demands using various capacity planning techniques. Our model places particular emphasis on the stochastic and unpredictable nature of the grid, leading to a more accurate reflection of the state of the grid and hence more efficient and accurate scheduling decisions
{"title":"Stochastic Workflow Scheduling with QoS Guarantees in Grid Computing Environments","authors":"Ali Afzal, J. Darlington, A. McGough","doi":"10.1109/GCC.2006.89","DOIUrl":"https://doi.org/10.1109/GCC.2006.89","url":null,"abstract":"Grid computing infrastructures embody a cost-effective computing paradigm that virtualises heterogeneous system resources to meet the dynamic needs of critical business and scientific applications. These applications range from batch processes and long-running tasks to more real-time and even transactional applications. Grid schedulers aim to make efficient use of grid resources in a cost-effective way, while satisfying the quality-of-service requirements of the applications. Scheduling in such a large-scale, dynamic and distributed environment is a complex undertaking. In this paper, we propose an approach to grid scheduling which abstracts over the details of individual applications and aims to provide a globally optimal schedule, while having the ability to dynamically adjust to varying workload demands using various capacity planning techniques. Our model places particular emphasis on the stochastic and unpredictable nature of the grid, leading to a more accurate reflection of the state of the grid and hence more efficient and accurate scheduling decisions","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"47 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":"126627213","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}
Data integration is the problem of combining data residing at distributed sources. Despite its importance, there is no universal architecture available because of the limitations of available technologies. The emerging of SOA and the application of ontology provide a new starting point for solving the problem. By making use of services and ontology technology, the paper presents a novel architecture: the system heterogeneity is solved by services; the global model is constituted by two levels of ontologies to solve the semantic heterogeneity, to provide the semantic reasoning, to facilitate the query, and to make automatic query answering. Key features and the anatomy of the architecture are provided in the paper, the comparisons with related work are also given. Based on the architecture, a formal integrating tree model of data integration is presented. By studying the tree, many related problems can be studied in depth and quantitatively
{"title":"A Service-Oriented Data Integration Architecture and the Integrating Tree","authors":"Guoshun Hao, Shilong Ma, J. Lv, Yuefei Sui","doi":"10.1109/GCC.2006.20","DOIUrl":"https://doi.org/10.1109/GCC.2006.20","url":null,"abstract":"Data integration is the problem of combining data residing at distributed sources. Despite its importance, there is no universal architecture available because of the limitations of available technologies. The emerging of SOA and the application of ontology provide a new starting point for solving the problem. By making use of services and ontology technology, the paper presents a novel architecture: the system heterogeneity is solved by services; the global model is constituted by two levels of ontologies to solve the semantic heterogeneity, to provide the semantic reasoning, to facilitate the query, and to make automatic query answering. Key features and the anatomy of the architecture are provided in the paper, the comparisons with related work are also given. Based on the architecture, a formal integrating tree model of data integration is presented. By studying the tree, many related problems can be studied in depth and quantitatively","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"279 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":"134344097","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}
Service-computing is the computing paradigm that utilizes services as building blocks for developing applications or solutions. Because simplicity of services, applications, and their interaction are critical for low cost and high productivity of service-computing, this paper tries to explore a proper bound of the simplicity. By proving that any Turing machine is equivalent to the interaction product of three generalized finite automata, we show that the services can be as simple as generalized finite automata, and their interaction can be as simple as interaction product. Since generalized finite automata are equivalent to finite automata which are intuitively very simple, and interaction product is an interaction mechanism imposing few constraints on its components, this result is generally helpful in distributed-system designs for achieving low cost and high productivity
{"title":"Approaching Simple and Powerful Service-Computing","authors":"Xingwu Liu, Zhiwei Xu","doi":"10.1109/GCC.2006.30","DOIUrl":"https://doi.org/10.1109/GCC.2006.30","url":null,"abstract":"Service-computing is the computing paradigm that utilizes services as building blocks for developing applications or solutions. Because simplicity of services, applications, and their interaction are critical for low cost and high productivity of service-computing, this paper tries to explore a proper bound of the simplicity. By proving that any Turing machine is equivalent to the interaction product of three generalized finite automata, we show that the services can be as simple as generalized finite automata, and their interaction can be as simple as interaction product. Since generalized finite automata are equivalent to finite automata which are intuitively very simple, and interaction product is an interaction mechanism imposing few constraints on its components, this result is generally helpful in distributed-system designs for achieving low cost and high productivity","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"76 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":"132522353","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
扫码关注我们
求助内容：
应助结果提醒方式：