Towards a micro-economic model for resource allocation in grid computing systems (original) (raw)

A Pricing Mechanism for Resource Management in Grid Computing

Computational Economics, 2008

We consider the problem of efficient resource allocation in a grid computing environment. Grid computing is an emerging paradigm that allows the sharing of a large number of a heterogeneous set of resources. We propose an auction mechanism for decentralized resource allocation. The problem is modeled as a multistage stochastic programming problem. Convergence of the auction allocations to the social optimum is established. Numerical experiments illustrate the efficacy of the method.

Resource allocation in grid computing: an economic model

Operations Research, 2011

Grid scheduling, that is, the allocation of distributed computational resources to user applications, is one of the most challenging and complex task in Grid computing. The problem of allocating resources in Grid scheduling requires the definition of a model that allows local and external schedulers to communicate in order to achieve an efficient management of the resources themselves. To this aim, some economic/market-based models have been introduced in the literature, where users, external schedulers, and local schedulers negotiate to optimize their objectives. In this paper, we propose a tender/contract-net model for Grid resource allocation, showing the interactions among the involved actors. The performance of the proposed market-based approach is experimentally compared with a round-robin allocation protocol.

Market-Based Resource Allocation in Grids

2006 Second IEEE International Conference on e-Science and Grid Computing (e-Science'06), 2006

The core goal of resource management is to establish a mutual agreement between a resource producer and a resource consumer by which the provider agrees to supply a capability that can be used to perform some tasks on behalf of the con- sumer. Market-based approaches introduce money and pricing as the technique for coordination be- tween consumers and producers of resources. In this paper, we propose a market-based mechanism to allocate computational resources (CPU time) with a single central Market in a local Grid. In such a network whenever any node can offer idle CPU time to the Grid and whenever a node has some tasks waiting for free CPU, it may request the resource from the Grid. In our approach, con- sumers and producers are autonomous agents that make their own decisions according to their ca- pabilities and their local knowledge. Continuous Double Auction model is used as a technique us- ing which these selfish agents can coordinate their work and make their decision. The performance of this mechanism is evaluated and is compared with the simple FCFS mechanism.

Equilibrium Prices for Resource Allocation in Grid Computing

We study resource allocation problem in a grid computing framework, where agents and resources are distributed in a graph and agents get these resources with their price plus bandwidth cost. We focus on pricing resources from Walrasian equilibrium point of view. In our model, Walrasian equilibrium always exists, and we give a polynomial time algorithm to compute one.

An Economic-based Resource Management and Scheduling for Grid Computing Applications

Resource management and scheduling plays a crucial role in achieving high utilization of resources in grid computing environments. Due to heterogeneity of resources, scheduling an application is significantly complicated and challenging task in grid system. Most of the researches in this area are mainly focused on to improve the performance of the grid system. There were some allocation model has been proposed based on divisible load theory with different type of workloads and a single originating processor. In this paper we introduce a new resource allocation model with multiple load originating processors as an economic model. Solutions for an optimal allocation of fraction of loads to nodes obtained to minimize the cost of the grid users via linear programming approach. It is found that the resource allocation model can efficiently and effectively allocate workloads to proper resources. Experimental results showed that the proposed model obtained the better solution in terms of cost and time. .

Economic models for management of resources in peer-to-peer and grid computing

2001

The accelerated development in Peer-to-Peer (P2P) and Grid computing has positioned them as promising next generation computing platforms. They enable the creation of Virtual Enterprises (VE) for sharing resources distributed across the world. However, resource management, application development and usage models in these environments is a complex undertaking. This is due to the geographic distribution of resources that are owned by different organizations or peers. The resource owners of each of these resources have different usage or access policies and cost models, and varying loads and availability. In order to address complex resource management issues, we have proposed a computational economy framework for resource allocation and for regulating supply and demand in Grid computing environments. The framework provides mechanisms for optimizing resource provider and consumer objective functions through trading and brokering services. In a real world market, there exist various economic models for setting the price for goods based on supply-and-demand and their value to the user. They include commodity market, posted price, tenders and auctions. In this paper, we discuss the use of these models for interaction between Grid components in deciding resource value and the necessary infrastructure to realize them. In addition to normal services offered by Grid computing systems, we need an infrastructure to support interaction protocols, allocation mechanisms, currency, secure banking, and enforcement services. Furthermore, we demonstrate the usage of some of these economic models in resource brokering through Nimrod/G deadline and cost-based scheduling for two different optimization strategies on the World Wide Grid (WWG) testbed that contains peer-topeer resources located on five continents: Asia, Australia, Europe, North America, and South America.

Resource Allocation in Market-based Grids Using a History-based Pricing Mechanism

Advances in Computer and Information Sciences and Engineering, 2008

In an ad-hoc Grid environment where producers and consumers compete for providing and employing resources, trade handling in a fair and stable way is a challenging task. Dynamic changes in the availability of resources over time makes the treatment yet more complicated. Here we employ a continuous double auction protocol as an economic-based approach to allocate idle processing resources among the demanding nodes. Consumers and producers determine their bid and ask prices using a sophisticated history-based dynamic pricing strategy and the auctioneer follows a discriminatory pricing policy which sets the transaction price individually for each matched buyer-seller pair. The pricing strategy presented generally simulates human intelligence in order to define a logical price by local analysis of the previous trade cases. This strategy is adopted to meet the user requirements and constraints set by consumers/producers. Experimental results show waiting time optimization which is particularly critical when resources are scarce.

A commodity market algorithm for pricing substitutable Grid resources

Future Generation Computer Systems, 2007

A crucial goal for future Grid systems is to strive towards user-centric service provisioning. A way to achieve this is through the use of economics-based resource management. Currently, several models exist from among which auction-and commodity-based models are the most popular. This contribution will focus on the latter, and in particular on commodity markets, where the value of a Grid resource is determined by supply and demand. We propose some refinements to the application of Smale's method for finding price equilibria in such a Grid market. We also extend the approach to substitutable goods. That is, we introduce 'slow' and 'fast' CPUs, two categories of the same type of good that are priced separately, but are strongly coupled with potentially strong shifts in demand. We show that Smale's method can be adapted to handle this type of Grid resources market, and that price stability, allocative efficiency, and fairness are realized.

An auction method for resource allocation in computational grids

2010

A computational grid is composed of a set of resource consumers and resources providers. Usually these entities are independent and making decisions autonomously based on their policies and resource allocation in such systems is a challenging problem. In such systems using market-like techniques for this problem regulates the supply and demand for resources, provides an incentive for providers, and motivates the users to trade-off between deadline, budget, and the required level of quality of service.