Owing to the computationally demanding nature of these calculations, GPUs are an increasingly popular platform for deployment, where a single calculation can requires thousands of GPUs working in tandem for months. There has been much progress to date in developing scalable sparse linear solver algorithms, utilizing well-known mathematical methods such as mixed precision, domain decomposition and pipelining to improve performance, allowing efficient use of large GPU installations such as Blue Waters and Titan. However, there has been less focus on deploying “mathematically optimal” linear solvers, that have optimal O(N) complexity. In this work we utilize the QUDA framework to deploy adaptive multigrid solvers on GPUs, in particular we describe the architecture abstractions that allow for deployment on heterogeneous systems, utilizing both GPUs and CPUs. We discuss in general the suitability of heterogeneous architectures for hierarchical algorithms.