{"title":"Performance evaluation and modeling in Grid Resource Management","authors":"Yan-bing Liu, Yiwu Jian","doi":"10.1109/GCC.2006.71","DOIUrl":"https://doi.org/10.1109/GCC.2006.71","url":null,"abstract":"Grid resource management is regarded as an important component of a grid computing system. The resources in the grid are geographically distributed, heterogeneous in nature, owned by different individuals/organizations each having their own resource management policies and different access-and-cost models. Based on abstract owner model, this article proposes a new resource storage model called resource pool which couples geographically distributed resource together. Meanwhile, this paper uses queuing and global optimization theory as tools to emphasize on quantitative analysis for resource pool capacity. Consequently, some new analytic formula for practical computation is obtained. Furthermore, an algorithm for analytic formulas is introduced into global optimization to evaluate the performance","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":"114857498","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 New Task Duplication Based Multitask Scheduling Method","authors":"Kun He, Yong Zhao","doi":"10.1109/GCC.2006.13","DOIUrl":"https://doi.org/10.1109/GCC.2006.13","url":null,"abstract":"The paper addresses the problem of scheduling tasks represented by a directed acyclic graph (DAG) on distributed environments. Due to the task, communication and resource constraints, the resource matching and task scheduling is NP-hard, even though the number of resources is abounded and task duplication is allowed. A new method named interpersonal relationships evolution algorithm (IREA) is given. The priority rules used are new, relationship number, potentiality, weight and merge degree are defined for cluster's priority, and task potentiality for tasks' priority. The experimental results reveal IREA beats other five algorithms in terms of average performance, and it produces another optimal solution for the classic MJD benchmark","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"113 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":"126045038","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":"Towards Context-Aware Composition of Web Services","authors":"Nan Luo, Junwei Yan, Min Liu, Shuxin Yang","doi":"10.1109/GCC.2006.94","DOIUrl":"https://doi.org/10.1109/GCC.2006.94","url":null,"abstract":"Service composition is regarded as a primary approach to build an application in service-oriented computing (SOC). Current approaches for service composition may return back lots of invalid results because they neither take user's context into account nor lack effective verification mechanism. To tackle these problems, this paper presents a framework that enables context-aware composition of Web services. The framework performs capability matches and composes service flow based on goal-driven. Then, it filters out unsuitable compositions of matched services according to available context information. Furthermore, we model the composite service with Petri nets and validate its correctness. And a corresponding algorithm is introduced. Software agents are developed in the framework to effectively support context-aware requirements for applications in SOC","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"57 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":"130189146","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":"Network Coding for Peer-to-Peer Live Media Streaming","authors":"Yajie Liu, Yuxing Peng, Wenhua Dou, Bo Guo","doi":"10.1109/GCC.2006.65","DOIUrl":"https://doi.org/10.1109/GCC.2006.65","url":null,"abstract":"We propose a new scheme for peer-to-peer live media streaming that uses network coding. This scheme includes the grouping method of media data on the server side, the network coding and decoding policies on each peer node and the packet scheduling algorithm with multiple suppliers. Unlike other related scheme based on network coding, our scheme does not require any centralized knowledge of the network topology and nodes make decisions of how to propagate blocks of streaming data based only on local information. Simulation results show that under the same network conditions, our proposed scheme can decrease the average playback startup delays of peer nodes, or can improve the average playback qualities of peer nodes with predefined playback startup delay than that not using network coding at all","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"53 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":"122401038","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}
Kai Shen, Shoubao Yang, Minghua Tian, Pengzhan Liu
{"title":"Towards a Uniform Monitoring Framework Supporting Interoperability in Grid","authors":"Kai Shen, Shoubao Yang, Minghua Tian, Pengzhan Liu","doi":"10.1109/GCC.2006.93","DOIUrl":"https://doi.org/10.1109/GCC.2006.93","url":null,"abstract":"Many existing monitoring systems are not easily interoperable for the lack of consistency. A uniform monitoring framework is proposed to leverage interoperability. A consistent data provider is designed upon GMA producers to facilitate common information representation. Monitoring service agent and republishers are developed to facilitate the information distribution and aggregation. A prototype is implemented based on monitoring tools such as Ganglia, GridView, and PBS, etc. Experiments are given to show the good feasibility and scalability","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":"116387697","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 Resource Discovery Algorithm with Probe Feedback Mechanism Based on Advance Reservation","authors":"Jianqun Cui, Yanxiang He, Libing Wu, Fei Li","doi":"10.1109/GCC.2006.16","DOIUrl":"https://doi.org/10.1109/GCC.2006.16","url":null,"abstract":"Resource discovery is a challenging problem in grid computing because computational resources are large-scale geographically distributed. Traditional decentralized resource discovery algorithms often focus on the searching method in forwarding direction. Response message is just used to report the matching node or matching failure. In this paper, a new resource discovery algorithm is introduced. Under this mechanism, request message and corresponding response message may choose different path to destination node. So we add probe feedback mechanism in response message to rediscovery requested resource if the resource can't be found in forwarding path. It provides more chances to satisfy the request. Furthermore, if advance reservation is supported by environment, response message can return the node which can provide matching resource firstly in near future if there are still no suitable resources in rediscovery period. Simulation shows that it can improve the performance of resource discovery especially when the job size is large and turn-around time is not very important to users","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":"115481738","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 Application-Oriented On-Demand Scheduling Approach in the Computational Grid Environment","authors":"Zhengxiong Hou, Xingshe Zhou, Yunlan Wang","doi":"10.1109/GCC.2006.25","DOIUrl":"https://doi.org/10.1109/GCC.2006.25","url":null,"abstract":"There are many effective heuristic algorithms for scheduling in the computational grid, however most scheduling strategies have not consider how to effectively share abundant applications software, especially commercial applications software with limited licenses. In this paper, we propose an application-oriented on-demand scheduling approach. It is based on the static and near-real-time application-specific and system-specific information. The scheduling system on-demand intelligently reacts to diverse applications and situations on behalf of the end-users. The implementation and the experiments results show that it delivers good performance","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"222 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":"115515196","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 Root-fault Detection System of Grid Based on Immunology","authors":"Qian-Mu Li, Manwu Xu, Hong Zhang","doi":"10.1109/GCC.2006.17","DOIUrl":"https://doi.org/10.1109/GCC.2006.17","url":null,"abstract":"According to the immunology principles of bionics, a grid root-fault detection system is presented. In this paper event detection sequences are viewed as analogous to peptide. With the principle of positive selection in immunology, the system builds up its event database. And the behavior whose frequency is higher will be analyzed and processed first to improve the speed and effectiveness of fault detection. The experiment system implemented by this method shows a good diagnostic ability","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"7 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":"125481281","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":"Checkpoint Placement Algorithms for Mobile Agent System","authors":"Jin Yang, Jiannong Cao, Weigang Wu","doi":"10.1109/GCC.2006.35","DOIUrl":"https://doi.org/10.1109/GCC.2006.35","url":null,"abstract":"Checkpointing is a fault tolerance technique widely used in various types of computer systems. In checkpointing, an important issue is how to achieve a good trade-off between the recovery cost and the system performance. Excessive checkpointing would result in the performance degradation due to the high costly I/O operations during checkpointing. Equidistant and equicost are two well-known checkpointing strategies for addressing this issue. However, there is no study on these strategies catering for a mobile agent (MA) system, which has different characteristics with conventional systems. In this paper, based on an analysis of the behaviours of an MA system, we find that it can be modelled as a homogeneous discrete-parameter Markov chain, which is different from the models used in conventional systems. Therefore, the analytic methods and corresponding results for conventional systems cannot be adopted directly for an MA system. Based on our proposed model, we study the equidistant and equicost checkpointing strategies and propose checkpoint placement algorithms for MA systems. Through simulations we evaluate the performance of our proposed algorithms and the result shows that the equicost strategy based algorithm is most suitable for an MA system","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"17 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":"126889459","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":"DTuples: A Distributed Hash Table based Tuple Space Service for Distributed Coordination","authors":"Yi Jiang, Guangtao Xue, Zhaoqing Jia, Jinyuan You","doi":"10.1109/GCC.2006.41","DOIUrl":"https://doi.org/10.1109/GCC.2006.41","url":null,"abstract":"In this paper, we introduce a Linda (Carriero et al., 1989) like peer-to-peer tuple space middleware build on top of distributed hash table Tuples. With the help of DTuples, the development of the distributed cooperation and coordination task would be simplified. The decoupled style of tuple space (Carriero and Gelemter, 2001) model is useful in peer-to-peer environment. In the application level, the DTuples was used instead of the publish/subscribe model and message-passing model. In low level, the DTuples service can be used as cooperation middleware and context-aware middleware. The tuples in the DTuples are stored in distributed hash table based peer-to-peer tuple storage. In our current work, the in(), rd(), out() and copy-collect() primitives are supported. The eval() primitive will be added to D-Tuples in the future. In this paper, we present the key design concepts of DTuples","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"43 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":"116621309","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}