Title :
Balanced stream assignment for service facility
Author :
Garg, Rahul ; Shahabuddin, Perwez ; Verma, Akshat
Abstract :
Shared data centers and clouds are gaining popularity because of their ability to reduce costs by increasing the utilization of server farms. In a shared server environment, a careful assignment of workload streams (all work-requests from a customer may constitute a stream) to servers is necessary to ensure good “end user” performance. In this work, we investigate the assignment of streams to servers in order to minimize an objective function, while ensuring that load is balanced across all the servers. The objective functions we optimize in this work include the overall expected waiting-time, overall probability of the wait exceeding a given value, and weighted versions of these measures. We obtain the optimal algorithm for a farm with 2 servers, if sharing of streams among servers is allowed. Based on the insights obtained, we design an efficient algorithm for the multiserver case. By rounding off this solution, we obtain a solution to the case where sharing of streams is not allowed. Our trace-driven evaluation study shows that our algorithms significantly outperform baseline methods. Our work enables high performance for web hosting services as well as emerging Application as a Service (AaaS) clouds. We also show that solutions in areas such as task-level scheduling and file assignment fall within our framework.
Keywords :
Web services; cloud computing; Web hosting service; application as a service clouds; balanced stream assignment; baseline method; end user performance; file assignment; optimal algorithm; server farm; service facility; shared data center; shared server environment; task-level scheduling; trace-driven evaluation; workload stream; Algorithm design and analysis; Level set; Minimization; Object recognition; Optimization; Partitioning algorithms; Servers;
Conference_Titel :
High Performance Computing (HiPC), 2010 International Conference on
Conference_Location :
Dona Paula
Print_ISBN :
978-1-4244-8518-5
Electronic_ISBN :
978-1-4244-8519-2
DOI :
10.1109/HIPC.2010.5713160