Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Admission Control in a Computational Market
KTH, School of Information and Communication Technology (ICT), Computer and Systems Sciences, DSV.
Information Dynamics Laboratory, Hewlett-Packard Laboratories, Palo Alto.
2008 (English)In: Proceedings CCGRID 2008 - 8th IEEE International Symposium on Cluster Computing and the Grid / [ed] Priol, T.; Lefevre, L.; Buyya, R., 2008, 277-286 p.Conference paper, Published paper (Refereed)
Abstract [en]

We propose, implement and evaluate three admission models for computational Grids. The models take the expected demand into account and offer a specific performance guarantee. The main issue addressed is how users and providers should make the tradeoff between a best effort (low guarantee) spot market and an admission controlled (high guarantee) reservation market. Using a realistically modeled high performance computing workload and utility models of user preferences, we run experiments highlighting the conditions under which different markets and admission models are efficient. The experimental results show that providers can make large efficiency gains if the admission model is chosen dynamically based on the current load, likewise we show that users have an opportunity to optimize their job performance by carefully picking the right market based on the state of the system, and the characteristics of the application to be run. Finally, we provide simple functional expressions that can guide both users and providers when making decisions about guarantee levels to request or offer.

Place, publisher, year, edition, pages
2008. 277-286 p.
Keyword [en]
Chlorine compounds, Computer networks, Computer systems, Decision making, Technical presentations, Cluster computing, High performance computing, International symposium
National Category
Information Science
Identifiers
URN: urn:nbn:se:kth:diva-8397DOI: 10.1109/CCGRID.2008.82ISI: 000270502300035Scopus ID: 2-s2.0-50649124960ISBN: 978-0-7695-3156-4 (print)OAI: oai:DiVA.org:kth-8397DiVA: diva2:13706
Note
QC 20100909Available from: 2008-05-09 Created: 2008-05-09 Last updated: 2010-09-09Bibliographically approved
In thesis
1. Statistical Methods for Computational Markets: Proportional Share Market Prediction and Admission Control
Open this publication in new window or tab >>Statistical Methods for Computational Markets: Proportional Share Market Prediction and Admission Control
2008 (English)Doctoral thesis, comprehensive summary (Other scientific)
Abstract [en]

We design, implement and evaluate statistical methods for managing uncertainty when consuming and provisioning resources in a federated computational market. To enable efficient allocation of resources in this environment, providers need to know consumers' risk preferences, and the expected future demand. The guarantee levels to offer thus depend on techniques to forecast future usage and to accurately capture and model uncertainties. Our main contribution in this thesis is threefold; first, we evaluate a set of techniques to forecast demand in computational markets; second, we design a scalable method which captures a succinct summary of usage statistics and allows consumers to express risk preferences; and finally we propose a method for providers to set resource prices and determine guarantee levels to offer. The methods employed are based on fundamental concepts in probability theory, and are thus easy to implement, as well as to analyze and evaluate. The key component of our solution is a predictor that dynamically constructs approximations of the price probability density and quantile functions for arbitrary resources in a computational market. Because highly fluctuating and skewed demand is common in these markets, it is difficult to accurately and automatically construct representations of arbitrary demand distributions. We discovered that a technique based on the Chebyshev inequality and empirical prediction bounds, which estimates worst case bounds on deviations from the mean given a variance, provided the most reliable forecasts for a set of representative high performance and shared cluster workload traces. We further show how these forecasts can help the consumers determine how much to spend given a risk preference and how providers can offer admission control services with different guarantee levels given a recent history of resource prices.

Place, publisher, year, edition, pages
Stockholm: KTH, 2008. xii, 75 p.
Series
Report series / DSV, ISSN 1101-8526 ; 08-006
Keyword
Distributed Systems, Grid Computing, Performance Analysis, Workload Modeling, Middleware, Quality of Service, Prediction, Admission Control
National Category
Information Science
Identifiers
urn:nbn:se:kth:diva-4738 (URN)978-91-7178-924-2 (ISBN)
Public defence
2008-05-26, Hall C, KTH-Forum, Isafjordsgatan 39, Stockholm, 13:00
Opponent
Supervisors
Note
QC 20100909Available from: 2008-05-09 Created: 2008-05-09 Last updated: 2010-09-09Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Sandholm, Thomas
By organisation
Computer and Systems Sciences, DSV
Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 41 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf