Name
Abstract | ||
|---|---|---|
When multiple virtual machines (VMs) are co scheduled on the same physical machine, they may undergo a performance degradation. The performance degradation is due to the contention for shared resources like last level cache, hard disk, network bandwidth etc. This can lead to service-level agreement violations and thereby customer dissatisfaction. The classical approach to solve the co scheduling problem involves a central authority which decides a co schedule by solving a constrained optimization problem with an objective function such as average performance degradation. In this paper, we use the theory of stable matchings to provide an alternate game theoretic perspective to the co scheduling problem wherein each VM selfishly tries to minimize its performance degradation. We show that the co scheduling problem can be formulated as a Stable Roommates Problem (SRP). Since certain instances of the SRP do not have any stable matching, we reduce the problem to the Stable Marriages Problem (SMP) via an initial approximation. Gale and Shapley proved that any instance of the SMP has a stable matching and can be found in quadratic time. From a game theoretic perspective, the SMP can be thought of as a matching game which always has a Nash equilibrium. There are distributed algorithms for both the SRP and SMP problems. A VM agent in a distributed algorithm need not reveal its preference list to any other VM. This allows each VM to have a private cost function. A principal advantage of this problem formulation is that it opens up the possibility of applying the rich theory of matching markets from game theory to address various aspects of the VM co scheduling problem such as stability, coalitions and privacy both from a theoretical and practical standpoint. We also propose a new workload characterization technique for a combination of compute and memory intensive workloads. The proposed technique uses a sentinel program and it requires only two runs per workload for characte- ization. VMs can use this technique in deciding their partner preference ranks in the SRP and SMP problems. The characterization technique has also been used in proposing two new centralized VM co scheduling algorithms whose performance is close to the optimal Blossom algorithm. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/UCC.2013.47 | Utility and Cloud Computing |
Keywords | Field | DocType |
smp problem,co scheduling problem,performance degradation,optimization problem,problem formulation,stable matching,vm co scheduling problem,co schedule,virtual machine coscheduling,new centralized vm co,game theoretic approach,vm agent,scheduling,distributed algorithms,virtual machines,game theory | Stable roommates problem,Coscheduling,Scheduling (computing),Computer science,Distributed algorithm,Linear programming,Game theory,Nash equilibrium,Blossom algorithm,Distributed computing | Conference |
Citations | PageRank | References |
2 | 0.42 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jaspal Singh Dhillon | 1 | 2 | 0.42 |
| Suresh Purini | 2 | 44 | 8.50 |
| Sanidhya Kashyap | 3 | 124 | 10.92 |