2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)最新文献

筛选
英文 中文
A Service-Oriented Data Integration Architecture and the Integrating Tree 面向服务的数据集成体系结构和集成树
Guoshun Hao, Shilong Ma, J. Lv, Yuefei Sui
{"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}
引用次数: 2
A Checking Mechanism of Software Component Adaptation 一种软件组件适配的检测机制
Xiong Xie, Weishi Zhang
{"title":"A Checking Mechanism of Software Component Adaptation","authors":"Xiong Xie, Weishi Zhang","doi":"10.1109/GCC.2006.2","DOIUrl":"https://doi.org/10.1109/GCC.2006.2","url":null,"abstract":"Software component adaptation is widely recognized to be a crucial problem in component-based software engineering. In this paper, we focus on the signature level component adaptation such as names, parameters and propose a checking mechanism to find the signature level mismatch. A component model is designed firstly in mathematical specification which can give more details to find and adapt the signatures that have a mismatch with the user need. Some notations and definitions are given to help the checking of signature level mismatch and then a checking mechanism of signature level mismatch with the use of context-free expressions is proposed. Our proposal is based on the more details provided by the user, and is supported by dedicated algorithms. At last future work and limitation of the checking mechanism are discussed","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"2016 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":"132728313","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}
引用次数: 6
A Reflective Framework for Authentication in Grid Computing Environments 网格计算环境下的身份验证反射框架
Jingshu Chen, H. Wu, Qingyang Wang, Qingguan Wang, Xue-bin Chi
{"title":"A Reflective Framework for Authentication in Grid Computing Environments","authors":"Jingshu Chen, H. Wu, Qingyang Wang, Qingguan Wang, Xue-bin Chi","doi":"10.1109/GCC.2006.15","DOIUrl":"https://doi.org/10.1109/GCC.2006.15","url":null,"abstract":"A fundamental concern in building a secure grid computing environment is authentication of local and remote entities in the environment. The existing authentication technologies in the grid computing environments can effectively guarantee the valid authentication, but they cannot meet the demands of new security challenges in dynamic grid environment, such as flexibility, lightweight, and extensibility. In order to satisfy the security needs of the computational grid, we propose a reflective authentication framework which aims to improve the customizing ability of platform and adaptive ability in the open and dynamic grid environment","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":"114227000","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}
引用次数: 2
A User Satisfaction Level Based Multi-objective Optimization Method for Grid Task Scheduling 基于用户满意度的网格任务调度多目标优化方法
Xiaoyin Wang, Zhihui Du, Sanli Li
{"title":"A User Satisfaction Level Based Multi-objective Optimization Method for Grid Task Scheduling","authors":"Xiaoyin Wang, Zhihui Du, Sanli Li","doi":"10.1109/GCC.2006.21","DOIUrl":"https://doi.org/10.1109/GCC.2006.21","url":null,"abstract":"A user satisfaction level model, which focuses on the real feeling of grid users, is proposed in this paper. The model can integrate not only multiple-aspect demands of different grid users, but also their preferences in different aspects. An abstract user satisfaction level function and its properties are also defined in the model. Based on the model, an effective grid task scheduling algorithm Sat Opt is provided and a multivariate Gaussian function is chosen as the practical user satisfaction level function, The Sat Opt algorithm is a three-stage heuristic multi-objective optimization algorithm and it can achieve near ideal results. To validate the idea provided in this paper, a MetaService architecture which can provide an extensible and feasible implementation of the Sat Opt algorithm is designed. Experiment results show that the Sat Opt algorithm based on the user satisfaction level model can significantly improve the user satisfaction level compared with the related methods","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"50 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":"124026786","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}
引用次数: 2
A Grid Access Control Model Based on Dynamic Negotiating 基于动态协商的网格访问控制模型
Runlian Zhang, Xiaoshe Dong, Xiaonian Wu
{"title":"A Grid Access Control Model Based on Dynamic Negotiating","authors":"Runlian Zhang, Xiaoshe Dong, Xiaonian Wu","doi":"10.1109/GCC.2006.5","DOIUrl":"https://doi.org/10.1109/GCC.2006.5","url":null,"abstract":"The same grid user may have another identity in different domains, and same to grid resource which have been restored and maintained in different domains. It is a challenging task for executing grid jobs successfully to make the same user have the consistent privileges in grid. However, distributed characteristic of grid makes it difficult to define and maintain global privileges consistency. And dynamic characteristic of grid seriously threatens global privileges consistency defined in grid access control. This paper proposes a dynamic access control model embodying access policies and its dynamic negotiating. The model supports to define global privileges consistency and automatically resume consistency when conflict has occurred. We also describe a prototype implementation of this model and its performance","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"83 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":"123028878","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}
引用次数: 0
Secure Communication and Access Control for Web Services Container Web服务容器的安全通信和访问控制
Yu Peng, Quanyuan Wu
{"title":"Secure Communication and Access Control for Web Services Container","authors":"Yu Peng, Quanyuan Wu","doi":"10.1109/GCC.2006.85","DOIUrl":"https://doi.org/10.1109/GCC.2006.85","url":null,"abstract":"Security is a crucial aspect in any modern software system. It is uttermost important for secure communication and access control in in-house business applications which are couple over the Internet using Web services. This paper firstly creates Web services container for wrapping COTS components (in-house business applications) to Web services. Then, a Web services security framework (WSSF) is presented to offer an effective solution for secure communication and access control of Web services container. The proposed framework focuses on addressing problems in two aspects: (1) Web services secure communication, i.e., the ability to send security tokens as part of a SOAP message to authenticate users, to provide message integrity, and message confidentiality; (2) authorization and permission delegation, i. e., the ability to define dynamic permission, and to assign attribute-based role. Finally, the paper gives prototype system StarWebService and proves the feasibility and validity of WSSF framework","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"135 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":"132520156","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}
引用次数: 6
Modeling and Performance Analysis of Grid Task Scheduling Based on Composition and Reduction of Petri Nets 基于Petri网合成与约简的网格任务调度建模与性能分析
Yaojun Han, Xuemei Luo
{"title":"Modeling and Performance Analysis of Grid Task Scheduling Based on Composition and Reduction of Petri Nets","authors":"Yaojun Han, Xuemei Luo","doi":"10.1109/GCC.2006.62","DOIUrl":"https://doi.org/10.1109/GCC.2006.62","url":null,"abstract":"Task scheduling is one of the most important and difficult issues in grid computing environment. Although some algorithms for grid task scheduling were proposed, formal modeling and analysis for task scheduling in grid computing have not given more attention. In our previous work, a high-level timed Petri net to model the workflow of grid tasks was proposed. But it only focused on independent tasks. In this paper, we tackle the scheduling problem of task that consists of a set of communicating subtasks. First, an extended timed Petri net model (ETPN) for a subtask is constructed. In order to reduce the complexity of model and the state explosion problem in reachability analysis of Petri nets, a Petri net model for a task is gotten using composition and reduction of Petri nets. A construction algorithm for reachable task graph (RTG) of ETPN is given in this paper. Finally, we give the methods to verify the correctness of the grid task scheduling and analyze time performance of system by analyzing RTG of ETPN","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"1 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":"129954928","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}
引用次数: 10
A Bidirectional Query Chord System Based on Latency-Sensitivity 基于延迟敏感的双向查询弦系统
Jing Wang, Shoubao Yang, Leitao Guo
{"title":"A Bidirectional Query Chord System Based on Latency-Sensitivity","authors":"Jing Wang, Shoubao Yang, Leitao Guo","doi":"10.1109/GCC.2006.1","DOIUrl":"https://doi.org/10.1109/GCC.2006.1","url":null,"abstract":"The key issue in structured P2P (peer to peer) is to locate resources effectively. Chord is a kind of structured P2P system based on overlay network. However, Chord construction doesn't consider the real network situations. At the same time, the clockwise searching scheme of original Chord doesn't make good use of the anti-clockwise neighbors' information. All these increase the latency and cost of locating resources. A bidirectional Chord system based on latency-sensitivity is proposed to decrease the latency and cost of locating resources. This system partitions the nodes according to the latencies among these nodes and the landmarks to decrease the average response time. And by the means of bidirectional query algorithm on Chord, the search path length is reduced. Theoretical analysis and simulations show that the system decreases query-response time greatly","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"311 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":"128193912","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}
引用次数: 10
Resource and Bandwidth Allocation on a Computational Grid with Tree Topology 树状拓扑计算网格的资源和带宽分配
Shaoqiang Zhang, C. Ding, G. Hou
{"title":"Resource and Bandwidth Allocation on a Computational Grid with Tree Topology","authors":"Shaoqiang Zhang, C. Ding, G. Hou","doi":"10.1109/GCC.2006.82","DOIUrl":"https://doi.org/10.1109/GCC.2006.82","url":null,"abstract":"Grid computing systems (machines) pool together the resources of a heterogeneous collection of computing systems that are widely distributed, possibly around the globe, to create a virtual computing organization. Users can \"draw\" resources either from local or from remote computing resources to execute their jobs. We only consider such a system in tree networks, and study a basic allocation problem: given a set of jobs, each demanding bandwidth and a set of cumulative computing resources and yielding profits corresponding to different machines, determine which feasible subset of jobs yields the maximum total profit","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"2014 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":"127584052","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}
引用次数: 4
A Grid Task Scheduling Algorithm Based on QoS Priority Grouping 基于QoS优先级分组的网格任务调度算法
Fang Dong, Junzhou Luo, Lisha Gao, Liang Ge
{"title":"A Grid Task Scheduling Algorithm Based on QoS Priority Grouping","authors":"Fang Dong, Junzhou Luo, Lisha Gao, Liang Ge","doi":"10.1109/GCC.2006.7","DOIUrl":"https://doi.org/10.1109/GCC.2006.7","url":null,"abstract":"As the research of grid goes on, users demand increasingly high quality of task completion and high-quality scientific computing tasks continue to increase. This renders QoS a new problem that is to be considered in the grid scheduling algorithm. In this paper, a grid tasks scheduling strategy based on QoS priority grouping is proposed. In this algorithm, the deadline property of task, acceptation rate of tasks and makespan of systems are comprehensively considered. And QD-Sufferage, a grid task scheduling based on task priority grouping and deadline, is presented subsequently. The experiments show that the algorithm overweighs traditional algorithms a lot in makespan, throughout parameters","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"69 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":"115025280","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}
引用次数: 63
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信