End-to-End QoS Support for a Medical Grid Service Infrastructure

Quality of Service support is an important prerequisite for the adoption of Grid technologies for medical applications. The GEMSS Grid infrastructure addressed this issue by offering end-to-end QoS in the form of explicit timeliness guarantees for compute-intensive medical simulation services. Within GEMSS, parallel applications installed on clusters or other HPC hardware may be exposed as QoS-aware Grid services for which clients may dynamically negotiate QoS constraints with respect to response time and price using Service Level Agreements. The GEMSS infrastructure and middleware is based on standard Web services technology and relies on a reservation based approach to QoS coupled with application specific performance models. In this paper we present an overview of the GEMSS infrastructure, describe the available QoS and security mechanisms, and demonstrate the effectiveness of our methods with a Grid-enabled medical imaging service.     

Enhancing Availability of Grid Computational Services to Ubiquitous Computing Applications

The Grid is an integrated infrastructure that can play the dual roles of a coordinated resource consumer as well as a donator in distributed computing environments. The enormous growth in the use of mobile and embedded devices in ubiquitous computing environment and their interaction with human beings produces a huge amount of data that need to be processed efficiently anytime anywhere. However, such devices often have limited resources in terms of CPU, storage, battery power, and communication bandwidth. Thus, there is a need to transfer ubiquitous computing application services to more powerful computational resources. In this paper, we investigate the use of the Grid as a candidate for provisioning computational services to applications in ubiquitous computing environments. In particular, we present a competitive model that describes the possible interaction between the competing resources in the Grid Infrastructure as service providers and ubiquitous applications as subscribers. The competition takes place in terms of quality of service (QoS) and cost offered by different Grid Service Providers (GSPs). We also investigate the job allocation of different GSPs by exploiting the noncooperativeness among the strategies. We present the equilibrium behavior of our model facing global competition under stochastic demand and estimate guaranteed QoS assurance level by efficiently satisfying the requirement of ubiquitous application. We have also performed extensive experiments over Distributed Parallel Computing Cluster (DPCC) and studied overall job execution performance of different GSPs under a wide range of QoS parameters using different strategies. Our model and performance evaluation results can serve as a valuable reference for designing appropriate strategies in a practical grid environment.     

HECTOR: Enabling Microarray Experiments over the Hellenic Grid Infrastructure

Biologists, medical experts, biochemical engineers and researchers working on DNA microarray experiments are increasingly turning on Grid computing with the scope of leveraging the Grid’s computing power, immense storage resources, and quality of service to the expedient processing of a wide range of datasets. In this paper we present a combined experience of grid application experts and bioinformatics scientists in deploying a pilot service enabling computationally efficient processing and analysis of data stemming from microarray experiments. This pilot service is accessible over the Hellenic portion of the EGEE grid and has been demonstrated in the scope of several public events. We highlight the process of grid application enablement, grid deployment challenges, as well as lessons learnt from a bi-annual effort to port and deploy a MATLAB DNA microarray application on a production grid. In addition to describing the parallelization of the application, we also emphasize on the development of a distributed federated database for storing and post-processing the results of the microarray experiments. Overall we believe that our experience could be proven valuable not only to microarray data scientists but also to other Grid users that intend to Grid-enable and deploy their applications.     

Introduce: An Open Source Toolkit for Rapid Development of Strongly Typed Grid Services

Service-oriented architectures and applications have gained wide acceptance in the Grid computing community. A number of tools and middleware systems have been developed to support application development using Grid Services architectures. Most of these efforts, however, have focused on low-level support for management and execution of Grid services, management of Grid-enabled resources, and deployment and execution of applications that make use of Grid services. Simple-to-use service development tools, which would allow a Grid service developer to leverage Grid technologies without needing to know low-level details, are becoming increasingly important for wider application of the Grid. In this paper, we describe an open-source, extensible toolkit, called Introduce, that supports easy development and deployment of Web Services Resource Framework (WSRF) compliant services. Introduce is designed to reduce the service development and deployment effort by hiding low level details of the Globus Toolkit and to enable the implementation of strongly typed services. In strongly typed services, a service produces and consumes data types that are well-defined and published in the Grid. This enables data-level syntactic interoperability so that clients and services can access and consume data elements programmatically and correctly. We expect that enabling strongly typed Grid services while lowering the difficulty of entry to the Grid via toolkits like Introduce will have a major impact to the success of the Grid and its wider adoption as a viable technology of choice in the commercial sector as well as in academic, medical, and government research.     

An optimization-based adaptive resource management framework for economic Grids: A switching mechanism

The application of Grid computing has been broadening day by day. An increasing number of users has led to the requirement of a job scheduling process, which can benefit them through optimizing their utility functions. On the other hand, resource providers are exploring strategies suitable for economically efficient resource allocation so that they can maximize their profit through satisfying more users. In such a scenario, economic-based resource management strategies (economic models) have been found to be compelling to satisfy both communities. However, existing research has identified that different economic models are suitable for different scenarios in Grid computing. The Grid application and resource models are typically very dynamic, making it challenging for a particular model for delivering stable performance all the time. In this work, our focus is to develop an adaptive resource management architecture capable of dealing with multiple models based on the models’ domains of strengths (DOS). Our preliminary results show promising outcomes if we consider multiple models rather than relying on a single model throughout the life cycle of a Grid.     

Brokering of risk‐aware service level agreements in grids

Service level agreements (SLAs) are facilitators for widening the commercial uptake of Grid technology. They provide explicit statements of expectation and obligation between service consumers and providers. However, without the ability to assess the probability that an SLA might fail, commercial uptake will be restricted, since neither party will be willing to agree. Therefore, risk assessment mechanisms are critical to increase confidence in Grid technology usage within the commercial sector. This paper presents an SLA brokering mechanism with risk assessment support, which evaluates the probability of SLA failure. WS‐Agreement and risk metrics are used to facilitate SLA creation between service consumers and providers within a typical Grid resource usage scenario. An evaluation is conducted to examine risk models, the performance of the broker's implementation as well as a comparison of its capabilities against similar SLA‐based solutions from the literature. Copyright © 2011 John Wiley & Sons, Ltd.     

Trouble Management for Multimedia Services in Multi-Provider Environments

As telecommunications and computers evolve, multimedia services are being increasingly deployed over a variety of organizational and technology domains. Customer requirements and the competitive market mean that the delivery of multimedia services at a guaranteed level of quality can play a significant role in differentiating between service providers. In order to meet such quality of service requirements, service providers need to be supported by trouble management capabilities suitable for today's heterogeneous environment. This paper presents an integrated network and service trouble management system that has been designed for such an environment within the framework of the European ACTS project FlowThru. The FlowThru Service Quality Assurance System has been developed using TINA and TMN concepts and TeleManagement Forum business processes in order to support service providers with the necessary infrastructure, models and mechanisms for automated end-to-end trouble management in a multi-domain environment.     

Adaptive service scheduling for workflow applications in Service-Oriented Grid

When the workflow application is executed in Service-Oriented Grid (SOG), performance issues such as service scheduling should be considered, to achieve high and stable performance in execution. However, most of the prior works on workflow management neither study the performance issues nor provide evaluation methodologies on the performance of Grid Services. Therefore, it is infeasible to apply for the service scheduling problem in SOG. In this paper, we propose and model evaluation metrics for the Grid Service performance. The metrics are extracted based on common properties of Grid Services and are used to quantify and evaluate the performance of an individual Grid Service. With these metrics, we develop a service scheduling scheme with a list scheduling heuristic, to choose proper and optimal Grid Services for tasks in workflow applications. It ensures high performance in the execution of the workflow applications. In addition, we propose a low-overhead rescheduling method, referred to as Adaptive List Scheduling for Service (ALSS), to adapt to the dynamic nature of a grid environment. ALSS provides stable performance for workflow applications, even in abnormal circumstances. Finally, we design an experimental environment with actual traces and perform simulations to quantify the benefits of our approach. Throughout the experiments, we demonstrate that ALSS outperforms conventional scheduling methods. Our scheme produces a scheduling performance that is superior to AHEFT by 50.2%, SLACK by 50.8%, HEFT by 68.3%, MaxMin by 72.0%, MinMin by 71.0%, and Myopic by 69.8%.     

Enhancing grid security by fine-grained behavioral control and negotiation-based authorization

Nowadays, Grid has become a leading technology in distributed computing. Grid poses a seamless sharing of heterogeneous computational resources belonging to different domains and conducts efficient collaborations between Grid users. The core Grid functionality defines computational services which allocate computational resources and execute applications submitted by Grid users. The vast models of collaborations and openness of Grid system require a secure, scalable, flexible and expressive authorization model to protect these computational services and Grid resources. Most of the existing authorization models for Grid have granularity to manage access to service invocations while behavioral monitoring of applications executed by these services remains a responsibility of a resource provider. The resource provider executes an application under a local account, and acknowledges all permissions granted to this account to the application. Such approach poses serious security threats to breach system functionality since applications submitted by users could be malicious. We propose a flexible and expressive policy-driven credential-based authorization system to protect Grid computational services against a malicious behavior of applications submitted for the execution. We split an authorization process into two levels: a coarse-grained level that manages access to a computational service; and a fine-grained level that monitors the behavior of applications executed by the computational service. Our framework guarantees that users authorized on a coarse-grained level behave as expected on the fine-grained level. Credentials obtained on the coarse-grained level reflect on fine-grained access decisions. The framework defines trust negotiations on coarse-grained level to overcome scalability problem, and preserves privacy of credentials and security policies of, both, Grid users and providers. Our authorization system was implemented to control access to the Globus Computational GRAM service. A comprehensive performance evaluation shows the practical scope of the proposed system.

Market‐based grid resource co‐allocation and reservation for applications with hard deadlines

Grid computing technology enables the creation of large‐scale IT infrastructures that are shared across organizational boundaries. In such shared infrastructures, conflicts between user requirements are common and originate from the selfish actions that users perform when formulating their service requests. The introduction of economic principles in grid resource management offers a promising way of dealing with these conflicts. We develop and analyze both a centralized and a decentralized algorithm for economic grid resource management in the context of compute bound applications with deadline‐based quality of service requirements and non‐migratable workloads. Through the use of reservations, we co‐allocate resources across multiple providers in order to ensure that applications finish within their deadline. An evaluation of both algorithms is presented and their performance in terms of realized user value is compared with an existing market‐based resource management algorithm. We establish that our algorithms, which operate under a more realistic workload model, can closely approximate the performance of this algorithm. We also quantify the effect of allowing local workload preemption and different scheduling heuristics on the realized user value. Copyright © 2009 John Wiley & Sons, Ltd.