Abstract
Auction mechanisms have recently been studied as an efficient approach for dynamic resource allocation in a cloud market. Existing mechanisms are mostly limited to the offline setting or execute jobs in continuous time slots. This work focuses on a practical case of online auction design, where users bid for future cloud resources for executing their batch processing jobs with hard deadline constraints. We design an online primal-dual auction framework for Virtual Machine (VM) allocation with social welfare maximization, which is truthful, computationally efficient, and guarantees a small competitive ratio. We leverage the framework of post price auctions to design our online primal-dual algorithm, where a bid is accepted if its expected execution cost in future time slots is smaller than its bidding price. We interpret the dual variables as marginal prices per unit of resource, and iteratively update it according to the allocated amount of resource. Theoretical analysis and trace-driven simulation studies validate the efficacy of the online auction framework, including both its computational efficiency and economic efficiency.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
