Abstract
One of the challenges in cloud computing is how to dynamically allocate resources such that QoS (Quality of Service) constraints are satisfied and provider's profit is maximized. In order to maximize the profit, the penalty cost for SLA (Service Level Agreement) violations needs to be reduced. We propose a winner determination mechanism in combinatorial auction system to efficiently allocate resources and reduce the penalty cost with consideration for execution time constraint. To evaluate the effectiveness of our mechanism, we show the performance evaluation with real workload data.
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.
