Negotiated economic grid brokering for quality of service

We demonstrate a Grid broker's job submission system and its selection process for finding the provider that is most likely to be able to complete work on time and on budget. We compare several traditional site selection mechanisms with an economic and Quality of Service (QoS) oriented approach. We show how a greater profit and QoS can be achieved if jobs are accepted by the most appropriate provider. We particularly focus upon the benefits of a negotiation process for QoS that enables our selection process to occur

The ISQoS Grid Broker for Temporal and Budget Guarantees

We introduce our Grid broker that uses SLAs in job submission with the aim of ensuring jobs are computed on time and on budget. We demonstrate our broker's ability to perform negotiation and to select preferentially higher priority jobs, in a tender market and discuss the architecture that makes this possible. We additionally show the effects of rescheduling and how careful consideration is required in order to avoid price instability. We therefore make recommendations upon how to maintain this stability, given rescheduling

Ant colony optimisation for resource searching in dynamic peer-to-peer grids

The applicability of peer-to-peer (p2p) in the domain of grid computing has been an important subject over the past years. Nevertheless, the sole merger between p2p and the concept of grid is not sufficient to guarantee non-trivial efficiency. Some claim that ant colony optimisation (ACO) algorithms might provide a definite answer to this question. However, the use of ACO in grid networks causes several problems. The first and foremost stems out of the fact that ACO algorithms usually perform well under the conditions of static networks, solving predetermined problems in a known and bound space. The question that remains to be answered is whether the evolutive component of these algorithms is able to cope with changing conditions; and by those we mean changes both in the positive sense, such as the appearance of new resources, but also in the negative sense, such as the disappearance or failure of fragments of the network. In this paper we study these considerations in depth, bearing in mind the specificity of the peer-to-peer nature.This work was funded by the Spanish Ministry of Education and Science and Innovation under the National Strategic Programme of Scientific Research, Development and Technological Innovation (I+D+i) and project TIN 2010-20488. Kamil Krynicki is supported by the FPI Fellowship from Universitat Politecnica de Valencia.Krynicki, K.; Jaén Martínez, FJ.; Mocholí Agües, JA. (2014). Ant colony optimisation for resource searching in dynamic peer-to-peer grids. International Journal of Bio-Inspired Computation. 6(3):153-165. https://doi.org/10.1504/IJBIC.2014.062634S1531656

Advances in Grid Computing

This book approaches the grid computing with a perspective on the latest achievements in the field, providing an insight into the current research trends and advances, and presenting a large range of innovative research papers. The topics covered in this book include resource and data management, grid architectures and development, and grid-enabled applications. New ideas employing heuristic methods from swarm intelligence or genetic algorithm and quantum encryption are considered in order to explain two main aspects of grid computing: resource management and data management. The book addresses also some aspects of grid computing that regard architecture and development, and includes a diverse range of applications for grid computing, including possible human grid computing system, simulation of the fusion reaction, ubiquitous healthcare service provisioning and complex water systems

Negotiated resource brokering for quality of service provision of grid applications

Grid Computing is a distributed computing paradigm where many computers often formed from different organisations work together so that their computing power may be aggregated. Grids are often heterogeneous and resources vary significantly in CPU power, available RAM, disk space, OS, architecture and installed software etc. Added to this lack of uniformity is that best effort services are usually offered, as opposed to services that offer guarantees upon completion time via the use of Service Level Agreements (SLAs). The lack of guarantees means the uptake of Grids is stifled. The challenge tackled here is to add such guarantees, thus ensuring users are more willing to use the Grid given an obvious reluctance to pay or contribute, if the quality of the services returned lacks any guarantees. Grids resources are also finite in nature, hence priorities need establishing in order to best meet any guarantees placed upon the limited resources available. An economic approach is hence adopted to ensure end users reveal their true priorities for jobs, whilst also adding incentive for provisioning services, via a service charge. An economically oriented model is therefore proposed that provides SLAs with bicriteria constraints upon time and cost. This model is tested via discrete event simulation and a simulator is presented that is capable of testing the model. An architecture is then established that was developed to utilise the economic model for negotiating SLAs. Finally experimentation is reported upon from the use of the software developed when it was deployed upon a testbed, including admission control and steering of jobs within the Grid. Results are presented that show the interactions and relationship between the time and cost constraints within the model, including transitions between the dominance of one constraint over the other and other things such as the effects of rescheduling upon the market