Previous distributed anomaly detection efforts have operated on summary statistics gathered from each node. This has the advantage that the audit trail is limited in size since event sets can be succinctly represented. While this minimizes the bandwidth consumed and helps scale the detection to a large number of nodes, it limits the infrastructure's ability to identify the source of anomalies. We describe three optimizations that together allow fine-grained tracking of the sources of anomalous activity in a Grid, thereby facilitating precise responses. We demonstrate the scheme's scalability in terms of storage and network bandwidth overhead with an implementation on nodes running BOINC. The results generalize to other types of Grids as well.
{"title":"Fine-grained tracking of Grid infections","authors":"Ashish Gehani, Basim Baig, Salman Mahmood, Dawood Tariq, Fareed Zaffar","doi":"10.1109/GRID.2010.5697969","DOIUrl":"https://doi.org/10.1109/GRID.2010.5697969","url":null,"abstract":"Previous distributed anomaly detection efforts have operated on summary statistics gathered from each node. This has the advantage that the audit trail is limited in size since event sets can be succinctly represented. While this minimizes the bandwidth consumed and helps scale the detection to a large number of nodes, it limits the infrastructure's ability to identify the source of anomalies. We describe three optimizations that together allow fine-grained tracking of the sources of anomalous activity in a Grid, thereby facilitating precise responses. We demonstrate the scheme's scalability in terms of storage and network bandwidth overhead with an implementation on nodes running BOINC. The results generalize to other types of Grids as well.","PeriodicalId":6372,"journal":{"name":"2010 11th IEEE/ACM International Conference on Grid Computing","volume":"32 1","pages":"73-80"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89329560","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}
Pub Date : 2010-10-01DOI: 10.1109/GRID.2010.5697889
Ramon Bertran Monfort, Y. Becerra, David Carrera, Vicencc Beltran, Marc González, X. Martorell, J. Torres, E. Ayguadé
Virtualized infrastructure providers demand new methods to increase the accuracy of the accounting models used to charge their customers. Future data centers will be composed of many-core systems that will host a large number of virtual machines (VMs) each. While resource utilization accounting can be achieved with existing system tools, energy accounting is a complex task when per-VM granularity is the goal. In this paper, we propose a methodology that brings new opportunities to energy accounting by adding an unprecedented degree of accuracy on the per-VM measurements. We present a system -which leverages CPU and memory power models based in performance monitoring counters (PMCs)- to perform energy accounting in virtualized systems. The contribution of this paper is twofold. First, we show that PMC-based power modeling methods are still valid on virtualized environments. And second, we introduce a novel methodology for accounting of energy consumption in virtualized systems. In overall, the results for an Intel® Core™ 2 Duo show errors in energy estimations below the 5%. Such approach brings flexibility to the chargeback models used by service and infrastructure providers. For instance, we show that VMs executed during the same amount of time, present more than 20% differences in energy consumption even only taking into account the consumption of the CPU and the memory.
{"title":"Accurate energy accounting for shared virtualized environments using PMC-based power modeling techniques","authors":"Ramon Bertran Monfort, Y. Becerra, David Carrera, Vicencc Beltran, Marc González, X. Martorell, J. Torres, E. Ayguadé","doi":"10.1109/GRID.2010.5697889","DOIUrl":"https://doi.org/10.1109/GRID.2010.5697889","url":null,"abstract":"Virtualized infrastructure providers demand new methods to increase the accuracy of the accounting models used to charge their customers. Future data centers will be composed of many-core systems that will host a large number of virtual machines (VMs) each. While resource utilization accounting can be achieved with existing system tools, energy accounting is a complex task when per-VM granularity is the goal. In this paper, we propose a methodology that brings new opportunities to energy accounting by adding an unprecedented degree of accuracy on the per-VM measurements. We present a system -which leverages CPU and memory power models based in performance monitoring counters (PMCs)- to perform energy accounting in virtualized systems. The contribution of this paper is twofold. First, we show that PMC-based power modeling methods are still valid on virtualized environments. And second, we introduce a novel methodology for accounting of energy consumption in virtualized systems. In overall, the results for an Intel® Core™ 2 Duo show errors in energy estimations below the 5%. Such approach brings flexibility to the chargeback models used by service and infrastructure providers. For instance, we show that VMs executed during the same amount of time, present more than 20% differences in energy consumption even only taking into account the consumption of the CPU and the memory.","PeriodicalId":6372,"journal":{"name":"2010 11th IEEE/ACM International Conference on Grid Computing","volume":"1 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91328574","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}
Pub Date : 2010-10-01DOI: 10.1109/GRID.2010.5697985
M. Mezmaz, Y. Kessaci, Young Choon Lee, N. Melab, E. Talbi, Albert Y. Zomaya, D. Tuyttens
Task scheduling algorithms are designed mostly with the sole goal of minimizing makespan (completion time). Almost all research works related to this kind of algorithms do not pay much attention to energy consumption.
{"title":"A parallel island-based hybrid genetic algorithm for precedence-constrained applications to minimize energy consumption and makespan","authors":"M. Mezmaz, Y. Kessaci, Young Choon Lee, N. Melab, E. Talbi, Albert Y. Zomaya, D. Tuyttens","doi":"10.1109/GRID.2010.5697985","DOIUrl":"https://doi.org/10.1109/GRID.2010.5697985","url":null,"abstract":"Task scheduling algorithms are designed mostly with the sole goal of minimizing makespan (completion time). Almost all research works related to this kind of algorithms do not pay much attention to energy consumption.","PeriodicalId":6372,"journal":{"name":"2010 11th IEEE/ACM International Conference on Grid Computing","volume":"40 1","pages":"274-281"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75645545","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}
Pub Date : 2010-10-01DOI: 10.1109/GRID.2010.5697967
A. Hutanu, Gabrielle Allen, T. Kosar
Visualization of remote data needs software that is fundamentally designed for distributed processing and high-speed networks. Motivated by and following the requirements of a distributed visualization application, this article describes the design and implementation of a fast and configurable remote data access system called eavivdata. Because wide-area networks may have a high latency, the remote data access system uses an architecture that effectively hides latency. Four remote data access architectures are analyzed and the results show that an architecture that combines bulk and pipeline processing is the best solution for high-throughput remote data access. The resulting system, also supporting high-speed transport protocols and configurable remote operations, is up to 400 times faster than a comparable existing remote data access system.
{"title":"High-performance remote data access for remote visualization","authors":"A. Hutanu, Gabrielle Allen, T. Kosar","doi":"10.1109/GRID.2010.5697967","DOIUrl":"https://doi.org/10.1109/GRID.2010.5697967","url":null,"abstract":"Visualization of remote data needs software that is fundamentally designed for distributed processing and high-speed networks. Motivated by and following the requirements of a distributed visualization application, this article describes the design and implementation of a fast and configurable remote data access system called eavivdata. Because wide-area networks may have a high latency, the remote data access system uses an architecture that effectively hides latency. Four remote data access architectures are analyzed and the results show that an architecture that combines bulk and pipeline processing is the best solution for high-throughput remote data access. The resulting system, also supporting high-speed transport protocols and configurable remote operations, is up to 400 times faster than a comparable existing remote data access system.","PeriodicalId":6372,"journal":{"name":"2010 11th IEEE/ACM International Conference on Grid Computing","volume":"11 1","pages":"121-128"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89563770","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}
Pub Date : 2010-10-01DOI: 10.1109/GRID.2010.5697971
L. Costa, M. Ripeanu
Versatile storage systems aim to maximize storage resource utilization by supporting the ability to ‘morph’ the storage system to best match the application's demands. To this end, versatile storage systems significantly extend the deployment- or run-time configurability of the storage system. This flexibility, however, introduces a new problem: a much larger, and potentially dynamic, configuration space makes manually configuring the storage system an undesirable if not unfeasible task. This paper presents our initial progress towards answering the question: “How can we configure a distributed storage system (i.e., enable/disable its various optimizations and configure their parameters) with minimal human intervention?” We discuss why manually configuring the storage system is undesirable; present the success criteria for an automated configuration solution; propose a generic architecture that supports automated configuration; and, finally, instantiate this architecture into a first prototype, which controls the configuration of similarity detection optimizations in the MosaStore distributed storage system. Our evaluation results demonstrate that the prototype can provide performance close to the optimal configuration at the cost of minimal overhead.
{"title":"Towards automating the configuration of a distributed storage system","authors":"L. Costa, M. Ripeanu","doi":"10.1109/GRID.2010.5697971","DOIUrl":"https://doi.org/10.1109/GRID.2010.5697971","url":null,"abstract":"Versatile storage systems aim to maximize storage resource utilization by supporting the ability to ‘morph’ the storage system to best match the application's demands. To this end, versatile storage systems significantly extend the deployment- or run-time configurability of the storage system. This flexibility, however, introduces a new problem: a much larger, and potentially dynamic, configuration space makes manually configuring the storage system an undesirable if not unfeasible task. This paper presents our initial progress towards answering the question: “How can we configure a distributed storage system (i.e., enable/disable its various optimizations and configure their parameters) with minimal human intervention?” We discuss why manually configuring the storage system is undesirable; present the success criteria for an automated configuration solution; propose a generic architecture that supports automated configuration; and, finally, instantiate this architecture into a first prototype, which controls the configuration of similarity detection optimizations in the MosaStore distributed storage system. Our evaluation results demonstrate that the prototype can provide performance close to the optimal configuration at the cost of minimal overhead.","PeriodicalId":6372,"journal":{"name":"2010 11th IEEE/ACM International Conference on Grid Computing","volume":"68 1","pages":"201-208"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78950648","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}
Pub Date : 2010-10-01DOI: 10.1109/GRID.2010.5697953
S. Ostermann, R. Prodan, T. Fahringer
Scientific computing requires an ever-increasing number of resources to deliver results for growing problem sizes in a reasonable timeframe. In the last decade, while the largest research projects were able to afford expensive supercomputers, others were forced to opt for cheaper resources such as commodity clusters or computational Grids. Today, Cloud computing proposes an alternative by which resources are no longer hosted by the scientists' computational facilities, but leased from specialized data centers only when and for how long they are needed. In this paper, we analyze the problem of dynamic provisioning of Cloud resources to scientific workflows that do not have sufficient Grid resources available, as required by their computational demands. We propose and study four provisioning aspects that deal with the general leasing model encountered in today's commercial Cloud environments based on resource bulks, fuzzy descriptions, and hourly payment intervals: Cloud start, instance type, Grid rescheduling, and Cloud stop. We study the impact of our techniques to the overall execution time, overall cost, and cost per unit of saved time with respect to various instance types offered by the Amazon EC2.
{"title":"Dynamic Cloud provisioning for scientific Grid workflows","authors":"S. Ostermann, R. Prodan, T. Fahringer","doi":"10.1109/GRID.2010.5697953","DOIUrl":"https://doi.org/10.1109/GRID.2010.5697953","url":null,"abstract":"Scientific computing requires an ever-increasing number of resources to deliver results for growing problem sizes in a reasonable timeframe. In the last decade, while the largest research projects were able to afford expensive supercomputers, others were forced to opt for cheaper resources such as commodity clusters or computational Grids. Today, Cloud computing proposes an alternative by which resources are no longer hosted by the scientists' computational facilities, but leased from specialized data centers only when and for how long they are needed. In this paper, we analyze the problem of dynamic provisioning of Cloud resources to scientific workflows that do not have sufficient Grid resources available, as required by their computational demands. We propose and study four provisioning aspects that deal with the general leasing model encountered in today's commercial Cloud environments based on resource bulks, fuzzy descriptions, and hourly payment intervals: Cloud start, instance type, Grid rescheduling, and Cloud stop. We study the impact of our techniques to the overall execution time, overall cost, and cost per unit of saved time with respect to various instance types offered by the Amazon EC2.","PeriodicalId":6372,"journal":{"name":"2010 11th IEEE/ACM International Conference on Grid Computing","volume":"3 1","pages":"97-104"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89665264","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}
Pub Date : 2010-10-01DOI: 10.1109/GRID.2010.5697976
Dominic Battré, F. Brazier, K. Clark, M. Oey, A. Papaspyrou, Oliver Wäldrich, P. Wieder, W. Ziegler
The Web Services Agreement specification defines a normative language to formulate Service Level Agreements and a basic protocol to expose service-level descriptions, validate service-level requests, and come to an agreement. This protocol, often called “take-it-or-leave-it”, allows a service provider and a service consumer to decide whether to accept or reject a service offer. Although this approach is sufficient for a number of use cases, others exist with requirements for multi-step negotiation or the adaptation of an existing agreement. In this paper, we describe the Web Services Agreement Negotiation protocol, a proposal by the Open Grid Forum to extend the existing specification. This proposal is the result of combining various research activities that have been conducted to define protocols for negotiating service levels or to supersede the existing “take-it-or-leave-it” protocol. The main characteristics of this proposal are the multi-round negotiation capability, renegotiation capability, and compliance with the original specification.
{"title":"A proposal for WS-Agreement Negotiation","authors":"Dominic Battré, F. Brazier, K. Clark, M. Oey, A. Papaspyrou, Oliver Wäldrich, P. Wieder, W. Ziegler","doi":"10.1109/GRID.2010.5697976","DOIUrl":"https://doi.org/10.1109/GRID.2010.5697976","url":null,"abstract":"The Web Services Agreement specification defines a normative language to formulate Service Level Agreements and a basic protocol to expose service-level descriptions, validate service-level requests, and come to an agreement. This protocol, often called “take-it-or-leave-it”, allows a service provider and a service consumer to decide whether to accept or reject a service offer. Although this approach is sufficient for a number of use cases, others exist with requirements for multi-step negotiation or the adaptation of an existing agreement. In this paper, we describe the Web Services Agreement Negotiation protocol, a proposal by the Open Grid Forum to extend the existing specification. This proposal is the result of combining various research activities that have been conducted to define protocols for negotiating service levels or to supersede the existing “take-it-or-leave-it” protocol. The main characteristics of this proposal are the multi-round negotiation capability, renegotiation capability, and compliance with the original specification.","PeriodicalId":6372,"journal":{"name":"2010 11th IEEE/ACM International Conference on Grid Computing","volume":"9 1","pages":"233-241"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82129995","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}
Pub Date : 2010-10-01DOI: 10.1109/GRID.2010.5697948
Y. Tanimura, Hidetaka Koie, T. Kudoh, I. Kojima, Yoshio Tanaka
Performance assurance has become an important aspect in grid and cloud computing which provide services over the Internet, and Service Level Agreements (SLA) are frequently contracted between users and the service providers. However, the I/O performance of the storage or data access service is still provided on a best effort basis. Some distributed storage systems implement performance reservation, but the reservation is implemented inside of the storage and works in an adaptive manner. In order to promise performance guarantees to users, we propose a distributed storage system allowing application users to explicitly make an advanced and time-based reservation for I/O access and storage space. Thus the requested performance is guaranteed during the reserved time. This paper describes our proposed concept and the design architecture of the storage system, including the reservation interface, resource management and I/O control frameworks. Then it explains our prototype which implements a simple resource allocation strategy and I/O control of the storage network along the design. The experiment results using the prototype are also shown. They indicate that the reservation cost entailed only a low performance impact on users, and that the requested performance was achieved by the reservation feature.
{"title":"A distributed storage system allowing application users to reserve I/O performance in advance for achieving SLA","authors":"Y. Tanimura, Hidetaka Koie, T. Kudoh, I. Kojima, Yoshio Tanaka","doi":"10.1109/GRID.2010.5697948","DOIUrl":"https://doi.org/10.1109/GRID.2010.5697948","url":null,"abstract":"Performance assurance has become an important aspect in grid and cloud computing which provide services over the Internet, and Service Level Agreements (SLA) are frequently contracted between users and the service providers. However, the I/O performance of the storage or data access service is still provided on a best effort basis. Some distributed storage systems implement performance reservation, but the reservation is implemented inside of the storage and works in an adaptive manner. In order to promise performance guarantees to users, we propose a distributed storage system allowing application users to explicitly make an advanced and time-based reservation for I/O access and storage space. Thus the requested performance is guaranteed during the reserved time. This paper describes our proposed concept and the design architecture of the storage system, including the reservation interface, resource management and I/O control frameworks. Then it explains our prototype which implements a simple resource allocation strategy and I/O control of the storage network along the design. The experiment results using the prototype are also shown. They indicate that the reservation cost entailed only a low performance impact on users, and that the requested performance was achieved by the reservation feature.","PeriodicalId":6372,"journal":{"name":"2010 11th IEEE/ACM International Conference on Grid Computing","volume":"25 31","pages":"193-200"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91479569","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}
Pub Date : 2010-10-01DOI: 10.1109/GRID.2010.5697966
Ming Mao, Jie Li, M. Humphrey
Clouds have become an attractive computing platform which offers on-demand computing power and storage capacity. Its dynamic scalability enables users to quickly scale up and scale down underlying infrastructure in response to business volume, performance desire and other dynamic behaviors. However, challenges arise when considering computing instance non-deterministic acquisition time, multiple VM instance types, unique cloud billing models and user budget constraints. Planning enough computing resources for user desired performance with less cost, which can also automatically adapt to workload changes, is not a trivial problem. In this paper, we present a cloud auto-scaling mechanism to automatically scale computing instances based on workload information and performance desire. Our mechanism schedules VM instance startup and shut-down activities. It enables cloud applications to finish submitted jobs within the deadline by controlling underlying instance numbers and reduces user cost by choosing appropriate instance types. We have implemented our mechanism in Windows Azure platform, and evaluated it using both simulations and a real scientific cloud application. Results show that our cloud auto-scaling mechanism can meet user specified performance goal with less cost.
{"title":"Cloud auto-scaling with deadline and budget constraints","authors":"Ming Mao, Jie Li, M. Humphrey","doi":"10.1109/GRID.2010.5697966","DOIUrl":"https://doi.org/10.1109/GRID.2010.5697966","url":null,"abstract":"Clouds have become an attractive computing platform which offers on-demand computing power and storage capacity. Its dynamic scalability enables users to quickly scale up and scale down underlying infrastructure in response to business volume, performance desire and other dynamic behaviors. However, challenges arise when considering computing instance non-deterministic acquisition time, multiple VM instance types, unique cloud billing models and user budget constraints. Planning enough computing resources for user desired performance with less cost, which can also automatically adapt to workload changes, is not a trivial problem. In this paper, we present a cloud auto-scaling mechanism to automatically scale computing instances based on workload information and performance desire. Our mechanism schedules VM instance startup and shut-down activities. It enables cloud applications to finish submitted jobs within the deadline by controlling underlying instance numbers and reduces user cost by choosing appropriate instance types. We have implemented our mechanism in Windows Azure platform, and evaluated it using both simulations and a real scientific cloud application. Results show that our cloud auto-scaling mechanism can meet user specified performance goal with less cost.","PeriodicalId":6372,"journal":{"name":"2010 11th IEEE/ACM International Conference on Grid Computing","volume":"10 1","pages":"41-48"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77340886","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}
Pub Date : 2010-10-01DOI: 10.1109/GRID.2010.5697957
L. Field, R. Sakellariou
Grid information systems play a core role in today's production Grid Infrastructures. They provide a coherent view of the Grid services in the infrastructure while addressing the performance, robustness and scalability issues that occur in dynamic, large-scale, distributed systems. Quality metrics for Grid information systems are required in order to compare different implementations and to evaluate suggested improvements. This paper proposes the adoption of a quality metric, first used in the domain of Web search, to measure the quality of Grid information systems with respect to their information content. The application of this metric requires an understanding of the dynamic nature of Grid information. An empirical study based on information from the EGEE Grid infrastructure is carried out to estimate the frequency of change for different types of Grid information. Using this data, the proposed metric is assessed with regards to its applicability to measuring the quality of Grid information systems.
{"title":"How dynamic is the Grid? Towards a quality metric for Grid information systems","authors":"L. Field, R. Sakellariou","doi":"10.1109/GRID.2010.5697957","DOIUrl":"https://doi.org/10.1109/GRID.2010.5697957","url":null,"abstract":"Grid information systems play a core role in today's production Grid Infrastructures. They provide a coherent view of the Grid services in the infrastructure while addressing the performance, robustness and scalability issues that occur in dynamic, large-scale, distributed systems. Quality metrics for Grid information systems are required in order to compare different implementations and to evaluate suggested improvements. This paper proposes the adoption of a quality metric, first used in the domain of Web search, to measure the quality of Grid information systems with respect to their information content. The application of this metric requires an understanding of the dynamic nature of Grid information. An empirical study based on information from the EGEE Grid infrastructure is carried out to estimate the frequency of change for different types of Grid information. Using this data, the proposed metric is assessed with regards to its applicability to measuring the quality of Grid information systems.","PeriodicalId":6372,"journal":{"name":"2010 11th IEEE/ACM International Conference on Grid Computing","volume":"205 1","pages":"113-120"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76679809","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
扫码关注我们
求助内容：
应助结果提醒方式：