<?xml version="1.0" encoding="ISO-8859-1" ?><?xml-stylesheet type="text/xsl" href="results.xsl" ?><root>
<item>
  <title>Admission Control in a Computational Market</title>
  <link>http://www.hpl.hp.com/personal/Thomas_Sandholm/sandholm2008a.pdf</link>
  <minidescription>Tradeoffs between using spot and reservation markets.</minidescription>
  <tags>
	  <tag>tycoon</tag>
	  <tag>incentive design</tag>
	  <tag>resource allocation</tag>
	  <tag>markets</tag>
  </tags> 
  <description>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 t e 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.
	</description>
	<author>Thomas Sandholm, Kevin Lai, and Scott Clearwater</author>
  <pubDate>2008-06-06 12:00:00</pubDate>
</item>
</root>