A Utility-Based Double Auction Mechanism for Efficient Grid Resource Allocation

Satayapiwat, C.; Egawa, Ryusuke; Takizawa, Hiroyuki; Kobayashi, Hiroaki

doi:10.1109/ispa.2008.103

Cited by 8 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Max-min algorithm [14], Min-min algorithm [14], and CDA (Continuous Double Auction) algorithm [15] are used to compare with NECDA algorithm with the features of successful execution rate and fairness deviation [16]. 1) Successful Execution Rate: The successful execution task is the task that completely accomplished within its deadline at the first time.…”

Section: Simula Non and Performance Evalua Nonmentioning

confidence: 99%

Efficient Nash equilibrium based cloud resource allocation by using a continuous double auction

Sun

Chang

Wang

et al. 2010

2010 International Conference on Computer Design and Applications

View full text Add to dashboard Cite

To allocate cloud resources efficiently and obtain the maximum economic benefit are the major goals of the cloud resource providers and users. The objective of this paper is to present a novel cloud resource allocation algorithm named NECDA to overcome some of the shortcomings of the current mechanisms. A cloud resource allocation model of m*n type based on MlMIJ queuing system is established first. Then the Nash equilibrium mode is applied in the cloud computing among m*n allocation environment, the optimization objective of each allocation is performance-QoS and economic-QoS, and the Nash equilibrium is achieved by taking advantage of the continuous double auction in each step, each provider agent determines its requested value based on its workload, and each user agent determines its bid value based on the remaining time and resources. By simulations, we conclude that the NECDA is more suited to cloud computing environments and can better meet the QoS requirements of users. I. 978-1-4244-7164-5/$26.00 © 2010 IEEE VI-94 Volume 1 bj = Ij . random ( 0.9· mean{lp ) ,1.1. mean ( hp)) (18) where mean (lp) and mean (hp) are the mean values of the resources' Ip and hp , respectively. d. =st. + random J , J ( I I) J J 1.1max (pe) 0.9min (pe)where stj is the time of submitting the task tj , and pe is VI-99 Volume 1

show abstract

Section: Simula Non and Performance Evalua Nonmentioning

confidence: 99%

Efficient Nash equilibrium based cloud resource allocation by using a continuous double auction

Sun

Chang

Wang

et al. 2010

2010 International Conference on Computer Design and Applications

View full text Add to dashboard Cite

show abstract

“…In [4], CDA, PrestonMcAfee double auction and threshold price double auction were evaluated in allocating grid computing resources. [5] expanded CDA to utility-based resource allocation. Furthermore, double auctions are also used in scheduling grid workflows [6] and resource co-allocation [7].…”

Section: Introductionmentioning

confidence: 99%

A QoS-Enabled Double Auction Protocol for the Service Grid

Gao

Luo

2010

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYTraditional double auction protocols only concern the price information of participants without considering their QoS requirements, which makes them unsuitable for the service grid. In this paper we first introduce QoS information into double auction to present the QoSenabled Double Auction Protocol (QDAP). QDAP tries to assign the asks which have the least candidate bids firstly to make more participants trade and provides QoS guarantee at the same time. Simulation experiments have been performed to compare QDAP with two traditional double auction protocols and the result shows that QDAP is more suitable for the service grid.

show abstract

“…Moreover, both sides of the Grid computing environment are marketization, so the Grid computing environment has the foundation of the double auction mechanism. The references [8,9] design Grid resource allocation protocols based on the double auction mechanism, but their models assume no transaction costs. In this paper, transaction costs are due to transportation in different trust domains between a resource consumer and a resource provider.…”

Section: Introductionmentioning

confidence: 99%

A Novel Double Auction Mechanism Based Resource Allocation in the Grid

Wang

2009

2009 International Conference on Management of E-Commerce and E-Government

View full text Add to dashboard Cite

In order to achieve high performance of Grid computing, an efficient resource allocation protocol needs to be carefully chosen and applied. Using auction mechanism design theory, this paper designs a novel double auction mechanism which is appropriate for allocation of multi-unit homogenous and divisible resources in the Grid. In the Grid, there are multiple resource consumers and resource providers. Furthermore, various transaction-related costs will be incurred when a resource consumer trades with a resource provider. We prove that the mechanism not only can achieve incentive compatibility and individual rationality for risk-averse resource consumers and resource providers, but also can be weekly budget balance. The numeral results show that the mechanism achieves high efficiency.

show abstract

A Utility-Based Double Auction Mechanism for Efficient Grid Resource Allocation

Cited by 8 publications

References 7 publications

Efficient Nash equilibrium based cloud resource allocation by using a continuous double auction

Efficient Nash equilibrium based cloud resource allocation by using a continuous double auction

A QoS-Enabled Double Auction Protocol for the Service Grid

A Novel Double Auction Mechanism Based Resource Allocation in the Grid

Contact Info

Product

Resources

About