research-article

Efficient auction-based grid reservations using dynamic programming

Authors:

Andrew Mutz,

Rich WolskiAuthors Info & Claims

SC '08: Proceedings of the 2008 ACM/IEEE conference on Supercomputing

Article No.: 16, Pages 1 - 8

Published: 15 November 2008 Publication History

Get Access

Abstract

Auction mechanisms have been proposed as a means to efficiently and fairly schedule jobs in high-performance computing environments. The Generalized Vickrey Auction has long been known to produce efficient allocations while exposing users to truth-revealing incentives, but the algorithms used to compute its payments can be computationally intractable. In this paper we present a novel implementation of the Generalized Vickrey Auction that uses dynamic programming to schedule jobs and compute payments in pseudo-polynomial time. Additionally, we have built a version of the PBS scheduler that uses this algorithm to schedule jobs, and in this paper we present the results of our tests using this scheduler.

References

[1]

A. Mutz, R. Wolski, and J. Brevik, "Eliciting honest value information in a batch-queue environment," in Proceedings of 8th IEEE/ACM International Conference on Grid Computing, 2007.

Digital Library

Google Scholar

[2]

C. Ng, P. Buonadonna, B. N. Chun, A. C. Snoeren, and A. Vahdat, "Addressing strategic behavior in a deployed microeconomic resource allocator," in 3rd Workshop on the Economics of Peer to Peer Systems, 2005.

Digital Library

Google Scholar

[3]

M. P. Wellman, W. E. Walsh, P. R. Wurman, and J. K. MacKie-Mason, "Auction protocols for decentralized scheduling," Games and Economic Behavior, vol. 35, no. 1--2, pp. 271--303, 2001. {Online}. Available: http://citeseer.ist.psu.edu/383290.html

Google Scholar

[4]

B. Schnizler, D. Neumann, D. Veit, and C. Weinhardt, "A multiattribute combinatorial exchange for trading grid resources," in Proceedings of the Research Symposium on Emerging Electronic, 2005.

Google Scholar

[5]

B. N. Chun and D. E. Culler, "Market-based proportional resource sharing for clusters," Computer Science Division, University of California at Berkeley, Tech. Rep. CSD-1092, January 2000. {Online}. Available: http://citeseer.ist.psu.edu/chun99marketbased.html

Digital Library

Google Scholar

[6]

K. Lai, B. A. Huberman, and L. Fine, "Tycoon: A distributed market-based resource allocation system," 2004.

Google Scholar

[7]

I. Stoica, H. Abdel-Wahab, and A. Pothen, "A microeconomic scheduler for parallel computers," in Proceedings of the International Parallel Processing Symposium (IPPS) '95 Workshop on Job Scheduling Strategies for Parallel Processing, Santa Barbara, CA, USA, 1994. {Online}. Available: http://citeseer.ist.psu.edu/stoica94microeconomic.html

Digital Library

Google Scholar

[8]

R. Wolski, J. S. Plank, J. Brevik, and T. Bryan, "Analyzing market-based resource allocation strategies for the computational grid," International Journal of High Performance Computing Applications, vol. 15, pp. 258--281. {Online}. Available: http://citeseer.ist.psu.edu/wolski00analyzing.html

Digital Library

Google Scholar

[9]

B. N. Chun and D. E. Culler, "User-centric performance analysis of market-based cluster batch schedulers," in Proceedings of the 2nd IEEE International Symposium on Cluster Computing and the Grid, Berlin, Germany, May 2002. {Online}. Available: http://berkeley.intel-research.net/bnc/papers/ccgrid02.pdf

Digital Library

Google Scholar

[10]

C. B. Lee and A. Snavely, "On the user-scheduler dialogue: Studies of user-provided runtime estimates and utility functions," vol. 20, pp. 495--506.

Digital Library

Google Scholar

[11]

A. Das and D. Grosu, "Combinatorial auction-based protocols for resource allocation in grids," in Proceedings. 19th IEEE International Parallel and Distributed Processing Symposium, 2005.

Digital Library

Google Scholar

[12]

K. Bubendorfer, K. Chard, P. Komisarczuk, and A. Desai, "Fine grained resource reservation and management in grid economies," in Proceedings of The 2005 International Conference on Grid Computing and Applications, 2005.

Google Scholar

Cited By

View all

Blagodurov SFedorova AVinnik EDwyer THermenier FKern JVetter J(2015)Multi-objective job placement in clustersProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/2807591.2807636(1-12)Online publication date: 15-Nov-2015
https://dl.acm.org/doi/10.1145/2807591.2807636
Gao CWang XHuang M(2013)A Cloud Resource Allocation Mechanism Based on Mean-Variance Optimization and Double Multi-Attribution AuctionProceedings of the 10th IFIP International Conference on Network and Parallel Computing - Volume 814710.1007/978-3-642-40820-5_10(106-117)Online publication date: 19-Sep-2013
https://dl.acm.org/doi/10.1007/978-3-642-40820-5_10
Shudler SAmar LBarak AMu'alem A(2010)The Effects of Untruthful Bids on User Utilities and Stability in Computing MarketsProceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing10.1109/CCGRID.2010.57(205-214)Online publication date: 17-May-2010
https://dl.acm.org/doi/10.1109/CCGRID.2010.57

Index Terms

Recommendations

Dynamic auction for efficient competitive equilibrium under price rigidities
AI'11: Proceedings of the 24th international conference on Advances in Artificial Intelligence

In an auction market where the price of each selling item is restricted to an admissible interval (price rigidities), a Walrasian equilibrium usually fails to exist. Dreze (1975) introduced a variant concept of Walrasian equilibrium based on rationing ...
Dynamic auction: a tractable auction procedure
AAAI'10: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence

Dynamic auctions are trading mechanisms for discovering market-clearing prices and efficient allocations based on price adjustment processes. This paper studies the computational issues of dynamic auctions for selling multiple indivisible items. Although ...
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
CCGRID '09: Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid

To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle allocation algorithm. During the auction, prices are iteratively negotiated ...

Comments

Information & Contributors

Information

Published In

SC '08: Proceedings of the 2008 ACM/IEEE conference on Supercomputing

November 2008

739 pages

ISBN:9781424428359

Conference Chair:
Patricia Teller

Publisher

IEEE Press

Publication History

Published: 15 November 2008

Check for updates

Qualifiers

Research-article

Conference

SC '08

Sponsor:

SIGARCH
IEEE-CS

SC '08: International Conference for High Performance Computing, Networking, Storage and Analysis

November 15 - 21, 2008

Texas, Austin

Acceptance Rates

SC '08 Paper Acceptance Rate 59 of 277 submissions, 21%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
201
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Blagodurov SFedorova AVinnik EDwyer THermenier FKern JVetter J(2015)Multi-objective job placement in clustersProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/2807591.2807636(1-12)Online publication date: 15-Nov-2015
https://dl.acm.org/doi/10.1145/2807591.2807636
Gao CWang XHuang M(2013)A Cloud Resource Allocation Mechanism Based on Mean-Variance Optimization and Double Multi-Attribution AuctionProceedings of the 10th IFIP International Conference on Network and Parallel Computing - Volume 814710.1007/978-3-642-40820-5_10(106-117)Online publication date: 19-Sep-2013
https://dl.acm.org/doi/10.1007/978-3-642-40820-5_10
Shudler SAmar LBarak AMu'alem A(2010)The Effects of Untruthful Bids on User Utilities and Stability in Computing MarketsProceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing10.1109/CCGRID.2010.57(205-214)Online publication date: 17-May-2010
https://dl.acm.org/doi/10.1109/CCGRID.2010.57

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Dynamic auction for efficient competitive equilibrium under price rigidities

Dynamic auction: a tractable auction procedure

Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Dynamic auction for efficient competitive equilibrium under price rigidities

Dynamic auction: a tractable auction procedure

Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations