Resource allocation continues to be one of the primary challenges in federated computing systems. Currently, users are forced to either suffer the delays inherent to batch scheduling used by the supercomputing community or the tragedy of the commons that befalls propotional share allocation as employed on PlanetLab. Market-based schemes have repeatedly been proposed as a possible solution but none have yet to see wide deployment. We present our initial experience with two operational auction-based schedulers---one for PlanetLab, the other for a large SensorNet testbed---and propose two key mechanisms to combat the challenges faced by real-world use of economic schedulers. Our experience shows that some users are unwilling or unable to accept the uncertainty of an auction; hence, we develop a buy-it-now mechanism that allows risk-averse users to instantly acquire resources at a price premium. Further, we describe how intelligent monetary policy, in particular the judicious use of a savings tax, ameliorates the budget disparities induced by the 90/10 usage patterns common in these environments.
The authors of these documents have submitted their reports to this technical report series for the purpose of non-commercial dissemination of scientific work. The reports are copyrighted by the authors, and their existence in electronic format does not imply that the authors have relinquished any rights. You may copy a report for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect the author's copyright. For information concerning the use of this document for other than research or instructional purposes, contact the authors. Other information concerning this technical report series can be obtained from the Computer Science and Engineering Department at the University of California at San Diego, firstname.lastname@example.org.
[ Search ]