The evolution of grid technologies has brought to the world a loosely coupled environment that enables flexible integration among heterogeneous systems. On building a service-oriented architecture for grid systems, more and more research is focused on service composition, in which workflow and simulation techniques have shown great potential. Simulation of services' interaction is important since the services ecosystem is unstable and in continuous evolution. However, there is a lack in the research of services' simulation, especially models and methods for simulating interactions between composite services. In this paper a workflow simulation method based on interactive events is proposed to fulfil this requirement. By introducing an event submodel in the workflow meta-model, the event interaction pattern is achieved from both the build-time and run-time perspectives. With an example simulated in the prototype system developed according to our method, the advantages of our method in model verification and QoS evaluation for service composition are also highlighted
{"title":"Interactive-Event-Based Workflow Simulation in Service Oriented","authors":"Yanchong Zheng, Yushun Fan, Wei Tan","doi":"10.1109/GCC.2006.53","DOIUrl":"https://doi.org/10.1109/GCC.2006.53","url":null,"abstract":"The evolution of grid technologies has brought to the world a loosely coupled environment that enables flexible integration among heterogeneous systems. On building a service-oriented architecture for grid systems, more and more research is focused on service composition, in which workflow and simulation techniques have shown great potential. Simulation of services' interaction is important since the services ecosystem is unstable and in continuous evolution. However, there is a lack in the research of services' simulation, especially models and methods for simulating interactions between composite services. In this paper a workflow simulation method based on interactive events is proposed to fulfil this requirement. By introducing an event submodel in the workflow meta-model, the event interaction pattern is achieved from both the build-time and run-time perspectives. With an example simulated in the prototype system developed according to our method, the advantages of our method in model verification and QoS evaluation for service composition are also highlighted","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"37 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":"128879744","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 cooperative event detection system for video sensor grid, which called VECON, is designed and implemented. The structure and work principle of VECON are discussed and the event definition language and the multiple event relationship diagram of VECON system are emphasized. A general framework is constructed for the cooperative event detection based on multi-agent technique. Finally, VECON is primarily validated via experiments
{"title":"VECON: a Cooperative Event Detection System for Video Sensor Grid","authors":"Weidong Bao, Jiangfeng Wang, Wei Zhao, Maojun Zhang","doi":"10.1109/GCC.2006.97","DOIUrl":"https://doi.org/10.1109/GCC.2006.97","url":null,"abstract":"A cooperative event detection system for video sensor grid, which called VECON, is designed and implemented. The structure and work principle of VECON are discussed and the event definition language and the multiple event relationship diagram of VECON system are emphasized. A general framework is constructed for the cooperative event detection based on multi-agent technique. Finally, VECON is primarily validated via experiments","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"84 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":"132553471","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 the market-oriented grid system, the price management of grid resources is a challenging undertaking as most resources are interdependent. So we discuss the dependent relations among grid resources, and build a "price influence model" which reflects the price dependence of resources. Furthermore, a price-adjusting strategy based on the "price influence model" is proposed. The strategy focuses on adjusting the unreasonable prices of partial resources, so as to achieve equilibrium prices of all resources. Finally, we illustrate the utility of our work by one example
{"title":"A Grid Resource Price-adjusting Strategy Based on Price Influence Model","authors":"Lulai Yuan, Guosun Zeng, Wei Wang","doi":"10.1109/GCC.2006.6","DOIUrl":"https://doi.org/10.1109/GCC.2006.6","url":null,"abstract":"In the market-oriented grid system, the price management of grid resources is a challenging undertaking as most resources are interdependent. So we discuss the dependent relations among grid resources, and build a \"price influence model\" which reflects the price dependence of resources. Furthermore, a price-adjusting strategy based on the \"price influence model\" is proposed. The strategy focuses on adjusting the unreasonable prices of partial resources, so as to achieve equilibrium prices of all resources. Finally, we illustrate the utility of our work by one example","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":"128546341","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}
Just as the Web is shifting its focus from information and communication and emphasizes the need to reuse of knowledge as a huge distributed knowledge base, the semantic grid in which information and services are given well-defined meaning extends the current grid to enable software agents, users, and programs to work in cooperation. How to process the different sources of information, in particular, to combine a variety of sources of knowledge to assist users with effective reasoning or collaborative problem-solving, is one of great barrier in realizing the above vision. Against this background, we propose a knowledge fusion and integration approach based on statistical decision theory and Bayesian analysis for the semantic grid
{"title":"Knowledge Fusion in Semantic Grid","authors":"Xiaoqing Zheng, Zhaohui Wu, Huajun Chen","doi":"10.1109/GCC.2006.55","DOIUrl":"https://doi.org/10.1109/GCC.2006.55","url":null,"abstract":"Just as the Web is shifting its focus from information and communication and emphasizes the need to reuse of knowledge as a huge distributed knowledge base, the semantic grid in which information and services are given well-defined meaning extends the current grid to enable software agents, users, and programs to work in cooperation. How to process the different sources of information, in particular, to combine a variety of sources of knowledge to assist users with effective reasoning or collaborative problem-solving, is one of great barrier in realizing the above vision. Against this background, we propose a knowledge fusion and integration approach based on statistical decision theory and Bayesian analysis for the semantic grid","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"32 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":"128096447","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}
Chun-tian Cheng, Zhijie Li, Fei-xue Huang, Zhendong Cui
This paper presents an economic-based resource allocation algorithm - mix optimization algorithm to meet user requirements in proportional resource sharing grid environment. The mix optimization algorithm is targeted to minimize two objectives, i.e., competing users 'processing cost and competing users' executing time with budget and deadline constraints, using multi-objective programming method. After establishing evaluating function of the optimal problem, a method similar to alpha-method is introduced to determine weight coefficients which define the relative importance of different optimization objective. The experimental results show that mix optimization algorithm leads to more efficient resource allocation than algorithms with single optimal goal (time optimization and cost optimization)
{"title":"Resource allocation based on multi-objective programming in economy grid: design and performance evaluation","authors":"Chun-tian Cheng, Zhijie Li, Fei-xue Huang, Zhendong Cui","doi":"10.1109/GCC.2006.81","DOIUrl":"https://doi.org/10.1109/GCC.2006.81","url":null,"abstract":"This paper presents an economic-based resource allocation algorithm - mix optimization algorithm to meet user requirements in proportional resource sharing grid environment. The mix optimization algorithm is targeted to minimize two objectives, i.e., competing users 'processing cost and competing users' executing time with budget and deadline constraints, using multi-objective programming method. After establishing evaluating function of the optimal problem, a method similar to alpha-method is introduced to determine weight coefficients which define the relative importance of different optimization objective. The experimental results show that mix optimization algorithm leads to more efficient resource allocation than algorithms with single optimal goal (time optimization and cost optimization)","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"32 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":"133392806","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}
Shaowen Wang, Eric Shook, Anand Padmanabhan, R. Briggs, L. Pearlman
The Modular Information Provider (MIP) has been developed to systematically aggregate multiple sources of information for grid information services (GIS). MIP undertakes the challenge of mapping information from a large number of sources to information services with minimal human intervention. MIP addresses such mappings using a modular approach to achieve interoperability among grid environments. MIP can be customized in a straightforward way to a specific Grid environment or information schema. Current MIP implementation is based on Globus MDS4 and the XML version of GLUE Schema 1.2. The design of MIP aims to address the shortcomings that exist in current grid information providers (e. g., the generic information provider) as well as to support Web service-based GIS. Our modular approach has been developed to ease maintenance and management of grid information systems by automatically aggregating information sources and providing appropriate pieces of information to GIS based on predefined information schemas. Upon installation, MIP is configured to set up only necessary modules, which minimizes memory usage
{"title":"Developing the Modular Information Provider (MIP) to Support Interoperable Grid Information Services","authors":"Shaowen Wang, Eric Shook, Anand Padmanabhan, R. Briggs, L. Pearlman","doi":"10.1109/GCC.2006.38","DOIUrl":"https://doi.org/10.1109/GCC.2006.38","url":null,"abstract":"The Modular Information Provider (MIP) has been developed to systematically aggregate multiple sources of information for grid information services (GIS). MIP undertakes the challenge of mapping information from a large number of sources to information services with minimal human intervention. MIP addresses such mappings using a modular approach to achieve interoperability among grid environments. MIP can be customized in a straightforward way to a specific Grid environment or information schema. Current MIP implementation is based on Globus MDS4 and the XML version of GLUE Schema 1.2. The design of MIP aims to address the shortcomings that exist in current grid information providers (e. g., the generic information provider) as well as to support Web service-based GIS. Our modular approach has been developed to ease maintenance and management of grid information systems by automatically aggregating information sources and providing appropriate pieces of information to GIS based on predefined information schemas. Upon installation, MIP is configured to set up only necessary modules, which minimizes memory usage","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"74 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":"123463111","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}
Hybrid search, which combines the flooding and DHT techniques, has been employed for efficient content-locating in peer-to-peer (P2P) systems. Choosing a flooding or a DHT subjects to the population of desired data. However, existing studies summarizes the popularity only based on local information, or does not take into account the dynamic factor of P2P systems. Thus, the users suffer from long search latency when performing hybrid search due to inaccurate estimations of the resource popularity. In this paper, we propose a popularity biased hybrid search method in systems. Our model allows the P2P systems dynamically detect the content popularity, and accurately make a decision of search methods. In this way, our work effectively reduces the query traffic cost and response time. The result our trace-driven simulations report shows that our model outperforms existing approaches in search efficiency
{"title":"Popularity Biased Hybrid Search in P2P Systems","authors":"X. Shi, Jinsong Han","doi":"10.1109/GCC.2006.72","DOIUrl":"https://doi.org/10.1109/GCC.2006.72","url":null,"abstract":"Hybrid search, which combines the flooding and DHT techniques, has been employed for efficient content-locating in peer-to-peer (P2P) systems. Choosing a flooding or a DHT subjects to the population of desired data. However, existing studies summarizes the popularity only based on local information, or does not take into account the dynamic factor of P2P systems. Thus, the users suffer from long search latency when performing hybrid search due to inaccurate estimations of the resource popularity. In this paper, we propose a popularity biased hybrid search method in systems. Our model allows the P2P systems dynamically detect the content popularity, and accurately make a decision of search methods. In this way, our work effectively reduces the query traffic cost and response time. The result our trace-driven simulations report shows that our model outperforms existing approaches in search efficiency","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"180 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":"128814436","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}
Much recent work has focused on improving AQM performance through expediting response time. In this paper we explore the impact of propagation delay and topology on AQM, discuss the question "faster the AQM controller responds, better it is?" We show that sometimes the fast responsive AQM controller leads to reduced link utilization and higher queue oscillations. Using simulations, we conclude that the performance of AQM is related to the network topology, propagation delay and the AQM schemes adopted by contemporaneous routers. Conservative scheme, such as PI, will be reassuring in uncertain network environment
{"title":"Does Fast Responsive AQM Scheme Always Do Better","authors":"Ming Liu, Wen-hua Dou","doi":"10.1109/GCC.2006.40","DOIUrl":"https://doi.org/10.1109/GCC.2006.40","url":null,"abstract":"Much recent work has focused on improving AQM performance through expediting response time. In this paper we explore the impact of propagation delay and topology on AQM, discuss the question \"faster the AQM controller responds, better it is?\" We show that sometimes the fast responsive AQM controller leads to reduced link utilization and higher queue oscillations. Using simulations, we conclude that the performance of AQM is related to the network topology, propagation delay and the AQM schemes adopted by contemporaneous routers. Conservative scheme, such as PI, will be reassuring in uncertain network environment","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":"129986323","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, we construct four DRBL-based diskless Linux PC clusters and install Globus Toolkit and Condor scheduler on the master node of each cluster. All diskless clusters can be merged into a powerful computing environment. To utilize the computing power, we propose a jobs allocation strategy for application execution. We use HPL to conduct some performance evaluations and analyze those data to form a formula for jobs allocation. The information server will calculate the value of computing power based on our formula and find the most appropriate cluster to execute the job. It can make our large computing environment that can execute the jobs in a more efficient way
{"title":"A Jobs Allocation Strategy for Multiple DRBL Diskless Linux Clusters with Condor Schedulers","authors":"Chao-Tung Yang, Ping-I Chen, Sung-Yi Chen, Hao-Yu Tung","doi":"10.1109/GCC.2006.10","DOIUrl":"https://doi.org/10.1109/GCC.2006.10","url":null,"abstract":"In this paper, we construct four DRBL-based diskless Linux PC clusters and install Globus Toolkit and Condor scheduler on the master node of each cluster. All diskless clusters can be merged into a powerful computing environment. To utilize the computing power, we propose a jobs allocation strategy for application execution. We use HPL to conduct some performance evaluations and analyze those data to form a formula for jobs allocation. The information server will calculate the value of computing power based on our formula and find the most appropriate cluster to execute the job. It can make our large computing environment that can execute the jobs in a more efficient way","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":"126408864","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}
Energy constraint is important issues in wireless sensor networks. This paper proposed a strategy for optimizing the placement of mobile sensor nodes, and energy metric of communication is presented for energy efficiency. The strategy can meet coverage and energy requirements, providing flexibility and adaptability for different energy constraints. Dijkstra's algorithm is utilized to obtain the optimal paths from which energy metric is derived. Dynamic power management is used to optimize the transition of sleep states and serve system energy. Collaborative sensing mechanism is adopted in the network for mobile target tracking. During collaborative tracking procedure, tradeoff between coverage and energy consumption is achieved by optimizing both metrics and adjusting the metric weight of optimization. Simulations of mobile target tracking are executed to verify that energy-efficiency is enhanced by deployment optimization strategy and dynamic power management mechanism
{"title":"Collaborative Deployment Optimization and Dynamic Power Management in Wireless Sensor Networks","authors":"Xue Wang, Junjie Ma, Sheng Wang","doi":"10.1109/GCC.2006.36","DOIUrl":"https://doi.org/10.1109/GCC.2006.36","url":null,"abstract":"Energy constraint is important issues in wireless sensor networks. This paper proposed a strategy for optimizing the placement of mobile sensor nodes, and energy metric of communication is presented for energy efficiency. The strategy can meet coverage and energy requirements, providing flexibility and adaptability for different energy constraints. Dijkstra's algorithm is utilized to obtain the optimal paths from which energy metric is derived. Dynamic power management is used to optimize the transition of sleep states and serve system energy. Collaborative sensing mechanism is adopted in the network for mobile target tracking. During collaborative tracking procedure, tradeoff between coverage and energy consumption is achieved by optimizing both metrics and adjusting the metric weight of optimization. Simulations of mobile target tracking are executed to verify that energy-efficiency is enhanced by deployment optimization strategy and dynamic power management mechanism","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"14 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":"115355503","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
扫码关注我们
求助内容：
应助结果提醒方式：