In this paper, we propose a novel scheme that can be used to build high performance and high available database cluster. This scheme employs a middleware approach, which can replicate the databases on the server nodes of a cluster and keep them consistent during the fly. Read-one-write-all strategy is used to execute the read only queries of the concurrent transactions in parallel so as to improve performance. Compared with other replication schemes, such as PostGreSQL-R, this scheme does not need to consider the underlying details of database management system, and thus has the advantages of flexibility and portability. The simulation results show that this method yields better performance than traditional database replication techniques and lower abort rate
{"title":"Middleware Based High Performance and High Available Database Cluster","authors":"Zhiyuan Shao, Hai Jin","doi":"10.1109/GCC.2006.60","DOIUrl":"https://doi.org/10.1109/GCC.2006.60","url":null,"abstract":"In this paper, we propose a novel scheme that can be used to build high performance and high available database cluster. This scheme employs a middleware approach, which can replicate the databases on the server nodes of a cluster and keep them consistent during the fly. Read-one-write-all strategy is used to execute the read only queries of the concurrent transactions in parallel so as to improve performance. Compared with other replication schemes, such as PostGreSQL-R, this scheme does not need to consider the underlying details of database management system, and thus has the advantages of flexibility and portability. The simulation results show that this method yields better performance than traditional database replication techniques and lower abort rate","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"85 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":"123603947","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}
Chunming Gao, Rongsheng Liu, Yan Song, Huowang Chen
This paper proposes a tool for formal verification of Web services composition based on an extended pi-calculus with type system and the conversion between BPEL and pi-calculus. This tool integrates three kinds of formal verification techniques, including open bisimulation, properties checking based on modal mu-calculus and the compatibility checking of composite Web services based on pi-calculus. With the combination checking techniques, the properties that service composition orchestration holds at abstract control flow level are checked, which achieve more completely validity checking about the orchestration. To check automatically, the automatic conversion between BPEL4WS and pi-calculus is introduced to this tool, and also the error slice for the orchestration are automatically marked. Further more, a novel method for discovering and matching web services is proposed, which is under the guidance of checking Web services compatibility
{"title":"A Model Checking Tool Embedded into Services Composition Environment","authors":"Chunming Gao, Rongsheng Liu, Yan Song, Huowang Chen","doi":"10.1109/GCC.2006.11","DOIUrl":"https://doi.org/10.1109/GCC.2006.11","url":null,"abstract":"This paper proposes a tool for formal verification of Web services composition based on an extended pi-calculus with type system and the conversion between BPEL and pi-calculus. This tool integrates three kinds of formal verification techniques, including open bisimulation, properties checking based on modal mu-calculus and the compatibility checking of composite Web services based on pi-calculus. With the combination checking techniques, the properties that service composition orchestration holds at abstract control flow level are checked, which achieve more completely validity checking about the orchestration. To check automatically, the automatic conversion between BPEL4WS and pi-calculus is introduced to this tool, and also the error slice for the orchestration are automatically marked. Further more, a novel method for discovering and matching web services is proposed, which is under the guidance of checking Web services compatibility","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":"126947524","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}
Resource scheduling is a fundamental issue in achieving high performance on computational grids. In this paper, we concentrate on parallel resource scheduling problems for hierarchical resource scheduling architecture of computational grids, and propose a stochastic reward nets (SRN) based performability evaluation framework for evaluating the performability of resource scheduling algorithms for computational grid with resource unavailability. Within the proposed framework, performability model of hierarchical resource scheduling is constructed, 36 combinations of 6 global job scheduling algorithms and 6 local processor allocation algorithms are specified in the uniform performability model, and performability metrics are derived
{"title":"Performability Evaluation of Resource Scheduling Algorithms for Computational Grids","authors":"Yang Qu, Chuang Lin, Yajuan Li, Zhiguang Shan","doi":"10.1109/GCC.2006.70","DOIUrl":"https://doi.org/10.1109/GCC.2006.70","url":null,"abstract":"Resource scheduling is a fundamental issue in achieving high performance on computational grids. In this paper, we concentrate on parallel resource scheduling problems for hierarchical resource scheduling architecture of computational grids, and propose a stochastic reward nets (SRN) based performability evaluation framework for evaluating the performability of resource scheduling algorithms for computational grid with resource unavailability. Within the proposed framework, performability model of hierarchical resource scheduling is constructed, 36 combinations of 6 global job scheduling algorithms and 6 local processor allocation algorithms are specified in the uniform performability model, and performability metrics are derived","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"66 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":"114922168","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}
With the increase in size, complexity, and heterogeneity of grid computing environments, we argue that, in addition to performance metrics, the resource allocation algorithms should be designed for robustness. That is, they should have the ability to maintain performance under a wide variety of operating conditions. Although robustness is easy to define, there are no widely used metrics for this property. We introduce the concept of robustness and present an analysis technique to determine the robustness of a resource allocation. As the main contributions of the paper, we present a mathematical description of a metric for the robustness of a resource allocation with respect to a specific disturbance. Simulation results prove the efficiency and applicability of our algorithms
{"title":"Modelling Robust Resource Allocation for Grid Computing","authors":"Zhimin Tian, Yang Yang, Zhengli Zhai","doi":"10.1109/GCC.2006.63","DOIUrl":"https://doi.org/10.1109/GCC.2006.63","url":null,"abstract":"With the increase in size, complexity, and heterogeneity of grid computing environments, we argue that, in addition to performance metrics, the resource allocation algorithms should be designed for robustness. That is, they should have the ability to maintain performance under a wide variety of operating conditions. Although robustness is easy to define, there are no widely used metrics for this property. We introduce the concept of robustness and present an analysis technique to determine the robustness of a resource allocation. As the main contributions of the paper, we present a mathematical description of a metric for the robustness of a resource allocation with respect to a specific disturbance. Simulation results prove the efficiency and applicability of our algorithms","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":"128401689","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}
EunJoung Byun, Hongsoo Kim, SungJin Choi, C. Hwang
Peer to peer (P2P) grid computing is an Internet-based parallel computing paradigm to achieve tremendous computing power by voluntary peers. Since peers are not dedicated to a system, peers are free to leave and join autonomously during computation in this computing environment. A scheduling mechanism must cover the volatility of peers to support a reliable P2P grid computing system. Most existing P2P grid computing systems, however, suffer from blocked job execution and delayed makespan because they do not consider the volatile features of peers in the scheduling procedure. In order to improve system reliability, we propose a probabilistic observation prediction (POP) -based EA scheduling mechanism supporting three advanced scheduling policies: loose time constraint policy (LTCP), strict time constraint policy (STCP), and hybrid time constraint policy (HTCP). LTCP is for general use, STCP aims at minimizing makespan, and HTCP attempts to improve efficiency, and performance-to-cost ratio. All policies are based on stochastic modeling of peer state transition while endeavoring to manage the volatile features of peers
{"title":"Probabilistic Observation Prediction Model based E4 Scheduling Mechanism in Peer to Peer Grid Computing","authors":"EunJoung Byun, Hongsoo Kim, SungJin Choi, C. Hwang","doi":"10.1109/GCC.2006.74","DOIUrl":"https://doi.org/10.1109/GCC.2006.74","url":null,"abstract":"Peer to peer (P2P) grid computing is an Internet-based parallel computing paradigm to achieve tremendous computing power by voluntary peers. Since peers are not dedicated to a system, peers are free to leave and join autonomously during computation in this computing environment. A scheduling mechanism must cover the volatility of peers to support a reliable P2P grid computing system. Most existing P2P grid computing systems, however, suffer from blocked job execution and delayed makespan because they do not consider the volatile features of peers in the scheduling procedure. In order to improve system reliability, we propose a probabilistic observation prediction (POP) -based EA scheduling mechanism supporting three advanced scheduling policies: loose time constraint policy (LTCP), strict time constraint policy (STCP), and hybrid time constraint policy (HTCP). LTCP is for general use, STCP aims at minimizing makespan, and HTCP attempts to improve efficiency, and performance-to-cost ratio. All policies are based on stochastic modeling of peer state transition while endeavoring to manage the volatile features of peers","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":"116273953","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}
A distributed dynamic collaboration approach built in peer-to-peer (P2P) architecture is presented to acquire, transmit and process information in wireless sensor networks (WSNs). Several practically feasible measures of energy consumption and information utility was introduced in collaborative signal processing (CSP) for nodes selection. Then we introduce a target tracking method and present a simple but robust algorithm to integrate the results from multiple nodes. Furthermore, we introduce a progressive fusion tracking strategy based on P2P collaborative signal processing (P2P-CSP) mechanism. Finally, we illustrate an indoor tracking experiment, as well as compare the energy consumption and time delay of P2P- CSP and client/server mechanism. Experimental results verify that the proposed algorithm is a scalable, progressive, energy-efficient and robust way for target tracking
{"title":"Peer-to-Peer Collaborative Signal Processing for Target Tracking in Wireless Sensor Networks","authors":"Xue Wang, Sheng Wang","doi":"10.1109/GCC.2006.69","DOIUrl":"https://doi.org/10.1109/GCC.2006.69","url":null,"abstract":"A distributed dynamic collaboration approach built in peer-to-peer (P2P) architecture is presented to acquire, transmit and process information in wireless sensor networks (WSNs). Several practically feasible measures of energy consumption and information utility was introduced in collaborative signal processing (CSP) for nodes selection. Then we introduce a target tracking method and present a simple but robust algorithm to integrate the results from multiple nodes. Furthermore, we introduce a progressive fusion tracking strategy based on P2P collaborative signal processing (P2P-CSP) mechanism. Finally, we illustrate an indoor tracking experiment, as well as compare the energy consumption and time delay of P2P- CSP and client/server mechanism. Experimental results verify that the proposed algorithm is a scalable, progressive, energy-efficient and robust way for target tracking","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"39 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":"128132969","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 level agreements (SLAs) are currently one of the major research topics in grid computing. Among many system components for supporting of SLA-aware grid jobs, the SLA mapping mechanism receives important positions. It is responsible for assigning sub-jobs of the workflow to grid resource in a way that meet the user's deadline and as cheap as possible. With the distinguished workload and resource characteristics, mapping a heavy communication workflow within SLA context defines an unfamiliar problem and need a specific method to be solved. This paper presents the mapping algorithm, which can cope with the problem. Performance measurements deliver evaluation results on the quality and efficiency of the method
{"title":"Network-based resource allocation for Grid Computing within an SLA context","authors":"D. Quan, D. Hsu","doi":"10.1109/GCC.2006.67","DOIUrl":"https://doi.org/10.1109/GCC.2006.67","url":null,"abstract":"Service level agreements (SLAs) are currently one of the major research topics in grid computing. Among many system components for supporting of SLA-aware grid jobs, the SLA mapping mechanism receives important positions. It is responsible for assigning sub-jobs of the workflow to grid resource in a way that meet the user's deadline and as cheap as possible. With the distinguished workload and resource characteristics, mapping a heavy communication workflow within SLA context defines an unfamiliar problem and need a specific method to be solved. This paper presents the mapping algorithm, which can cope with the problem. Performance measurements deliver evaluation results on the quality and efficiency of the method","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":"130175047","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}
Choong-Hyun Sun, Youngwoong Han, Minseong Kim, G. Yi
The bioinformatics field confronts exponential growth of data and increasing problem complexity. Recent progress in computing and data grid are highlighted as an approach to handle these situations. The simplified usage of grid computing resources and the fault-tolerance of large data placement in bioinformatics analysis are the main keys for taking advantage of grid technology. For the purpose of achieving grid computing jobs, we have already provided a model of problem solving environment for integrated bioinformatics solution on grid supporting process manager. Here we have additionally developed BioGrid problem solving environment (BioGridPSE) as an updated version that guarantees both the completion of computational jobs and data placement jobs in the grid and supports flexible process design for bioinformatics analysis, user customized interface generation, and programmable data parsing. The efficiency and usability of BioGridPSE have been tested with high-throughput and complex bioinformatics analysis such as whole genome global alignment
{"title":"BioGridPSE: Integrated Solution for Bioinformatics Analysis Using Computing and Data Grid","authors":"Choong-Hyun Sun, Youngwoong Han, Minseong Kim, G. Yi","doi":"10.1109/GCC.2006.33","DOIUrl":"https://doi.org/10.1109/GCC.2006.33","url":null,"abstract":"The bioinformatics field confronts exponential growth of data and increasing problem complexity. Recent progress in computing and data grid are highlighted as an approach to handle these situations. The simplified usage of grid computing resources and the fault-tolerance of large data placement in bioinformatics analysis are the main keys for taking advantage of grid technology. For the purpose of achieving grid computing jobs, we have already provided a model of problem solving environment for integrated bioinformatics solution on grid supporting process manager. Here we have additionally developed BioGrid problem solving environment (BioGridPSE) as an updated version that guarantees both the completion of computational jobs and data placement jobs in the grid and supports flexible process design for bioinformatics analysis, user customized interface generation, and programmable data parsing. The efficiency and usability of BioGridPSE have been tested with high-throughput and complex bioinformatics analysis such as whole genome global alignment","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"61 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":"130984956","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}
With the development of grid techniques and the growing complexity of grid applications, reasoning the temporal properties of grid application to ensure its reliability is becoming more and more critical. In this work, two decomposition approaches are proposed to improve the performance of the temporal reasoning of complex grid applications. The proposed approaches are implemented in our GridPiAnalyzer for equipment grid. Results show that our approach can reduce both CPU time and memory cost compared to using traditional formal verification algorithm alone due to the exponential reduction of system state space
{"title":"Aspect Oriented Region Analysis for Efficient Grid Application Reasoning","authors":"Ke Xu, Yuexuan Wang, Cheng Wu","doi":"10.1109/GCC.2006.31","DOIUrl":"https://doi.org/10.1109/GCC.2006.31","url":null,"abstract":"With the development of grid techniques and the growing complexity of grid applications, reasoning the temporal properties of grid application to ensure its reliability is becoming more and more critical. In this work, two decomposition approaches are proposed to improve the performance of the temporal reasoning of complex grid applications. The proposed approaches are implemented in our GridPiAnalyzer for equipment grid. Results show that our approach can reduce both CPU time and memory cost compared to using traditional formal verification algorithm alone due to the exponential reduction of system state space","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":"131144338","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}
Bo Cao, Yongwei Wu, Guangwen Yang, Jia Liu, Jianjin Jiang
In this paper, we propose a new scheduling algorithm with economic theory, called black Scholes market (BSM) algorithm for a class of dynamic jobs (DJ). BSM is based on the classic option pricing theory in investment - black Scholes pricing model. The algorithm could meet the needs of dynamic flow jobs and select server to provide specific service through simulating an irrational market. Compared with dynamic weighted round robin (DWRR) and dynamic statistical random (DSR) scheduling algorithms, BSM algorithm achieves a better performance in long time scheduling and the best average delay rate in different maximum job arrival rates. And from view of the stability, BSM is also much better than the other two algorithms
本文利用经济学理论提出了一类动态作业(DJ)的调度算法black Scholes market (BSM)算法。BSM是在经典期权定价理论的基础上建立的投资- black Scholes定价模型。该算法通过模拟一个不合理的市场，可以满足动态流作业的需求，选择服务器提供特定的服务。与动态加权轮询调度算法(DWRR)和动态统计随机调度算法(DSR)相比，BSM算法具有较好的长时间调度性能和不同最大作业到达率下的最佳平均延迟率。从稳定性来看，BSM算法也明显优于其他两种算法
{"title":"BSM: A scheduling algorithm for dynamic jobs based on economics theory","authors":"Bo Cao, Yongwei Wu, Guangwen Yang, Jia Liu, Jianjin Jiang","doi":"10.1109/GCC.2006.34","DOIUrl":"https://doi.org/10.1109/GCC.2006.34","url":null,"abstract":"In this paper, we propose a new scheduling algorithm with economic theory, called black Scholes market (BSM) algorithm for a class of dynamic jobs (DJ). BSM is based on the classic option pricing theory in investment - black Scholes pricing model. The algorithm could meet the needs of dynamic flow jobs and select server to provide specific service through simulating an irrational market. Compared with dynamic weighted round robin (DWRR) and dynamic statistical random (DSR) scheduling algorithms, BSM algorithm achieves a better performance in long time scheduling and the best average delay rate in different maximum job arrival rates. And from view of the stability, BSM is also much better than the other two algorithms","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"95 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":"133258911","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
扫码关注我们
求助内容：
应助结果提醒方式：