CAGE: A Contention-Aware Game-theoretic Model for Heterogeneous Resource Assignment

Traditional resource management systems rely on a centralized approach to manage users running on each resource. The centralized resource management system is not scalable for large-scale servers as the number of users running on shared resources is increasing dramatically and the centralized manager may not have enough information about applications’ needs. In this paper, we propose a distributed game-theoretic resource management approach using a market auction mechanism and optimal strategy in a resource competition game. The applications learn through repeated interactions to choose their action on choosing the shared resources. Specially, we look into two case studies of cache competition game and main processor and co-processor congestion game. We enforce costs for each resource and derive a bidding strategy. An accurate evaluation of the proposed approach shows that our distributed allocation is scalable and outperforms the static and traditional approaches.

CAGE: A Contention-Aware Game-theoretic Model for Heterogeneous Resource Assignment

 in the 35th IEEE International Conference on Computer Design (ICCD)