scispace - formally typeset
Proceedings ArticleDOI

Supporting GPU sharing in cloud environments with a transparent runtime consolidation framework

Reads0
Chats0
TLDR
A framework to enable applications executing within virtual machines to transparently share one or more GPUs is presented and it is found that even when contention is high the consolidation algorithm is effective in improving the throughput, and that the runtime overhead of the framework is low.
Abstract
Driven by the emergence of GPUs as a major player in high performance computing and the rapidly growing popularity of cloud environments, GPU instances are now being offered by cloud providers. The use of GPUs in a cloud environment, however, is still at initial stages, and the challenge of making GPU a true shared resource in the cloud has not yet been addressed.This paper presents a framework to enable applications executing within virtual machines to transparently share one or more GPUs. Our contributions are twofold: we extend an open source GPU virtualization software to include efficient GPU sharing, and we propose solutions to the conceptual problem of GPU kernel consolidation. In particular, we introduce a method for computing the affinity score between two or more kernels, which provides an indication of potential performance improvements upon kernel consolidation. In addition, we explore molding as a means to achieve efficient GPU sharing also in the case of kernels with high or conflicting resource requirements. We use these concepts to develop an algorithm to efficiently map a set of kernels on a pair of GPUs. We extensively evaluate our framework using eight popular GPU kernels and two Fermi GPUs. We find that even when contention is high our consolidation algorithm is effective in improving the throughput, and that the runtime overhead of our framework is low.

read more

Citations
More filters
Posted Content

An Empirical-cum-Statistical Approach to Power-Performance Characterization of Concurrent GPU Kernels

TL;DR: A multi-kernel throughput workload generation framework that will facilitate aggressive energy and performance management of exascale data centers and will stimulate synergistic power-performance co-optimization of throughput architectures is proposed and demonstrated.

Consolidating batch and transactional workloads using dependency structure

TL;DR: The proposed work implements the concept of Dependency Structure Prioritization (DSP) to assign priority to the job to make effective resource utilization through reducing the number of job migration and missed deadline jobs.
Proceedings ArticleDOI

Algorithms for Preemptive Co-scheduling of Kernels on GPUs

TL;DR: In this paper, a graph-based preemptive co-scheduling algorithm is proposed to reduce the number of preemptions in high-competitiveness scenarios on GPUs. But, the problem of finding the minimum amount of preemptions among all preemptive solutions of optimal makespan is a NP-hard problem.
Proceedings ArticleDOI

Scaling Software Experiments to the Thousands

TL;DR: Challenges and solutions for scaling InstantLab to provide experiment infrastructure for thousands of users are discussed and the approach to automatic management of experiment feedback and user grading based on learning success and successful completion of operating systems and software engineering experiments is discussed.
Book ChapterDOI

A Heterogeneous Dynamic Scheduling Minimize Energy—HDSME

TL;DR: This paper is implementing a new technique for scheduling resources that are in heterogeneous way during time for minimizing the energy and the cost of the operation known as HDSME (Heterogeneous-Dynamic-Scheduling-Minimize-Energy).
References
More filters
Proceedings ArticleDOI

The cost of doing science on the cloud: the Montage example

TL;DR: Using the Amazon cloud fee structure and a real-life astronomy application, the cost performance tradeoffs of different execution and resource provisioning plans are studied and it is shown that by provisioning the right amount of storage and compute resources, cost can be significantly reduced with no significant impact on application performance.
Proceedings ArticleDOI

Qilin: exploiting parallelism on heterogeneous multiprocessors with adaptive mapping

TL;DR: Adaptive mapping is proposed, a fully automatic technique to map computations to processing elements on a CPU+GPU machine and it is shown that, by judiciously distributing works over the CPU and GPU, automatic adaptive mapping achieves a 25% reduction in execution time and a 20% reduced in energy consumption than static mappings on average for a set of important computation benchmarks.
Proceedings ArticleDOI

Automated control of multiple virtualized resources

TL;DR: Experimental evaluation with RUBiS and TPC-W benchmarks along with production-trace-driven workloads indicates that AutoControl can detect and mitigate CPU and disk I/O bottlenecks that occur over time and across multiple nodes by allocating each resource accordingly.
Proceedings ArticleDOI

Cost-benefit analysis of Cloud Computing versus desktop grids

TL;DR: This work compares and contrast the performance and monetary cost-benefits of clouds for desktop grid applications, ranging in computational size and storage and examines performance measurements and monetary expenses of real desktop grids and the Amazon elastic compute cloud.
Proceedings ArticleDOI

Accelerator: using data parallelism to program GPUs for general-purpose uses

TL;DR: This work describes Accelerator, a system that uses data parallelism to program GPUs for general-purpose uses instead of C, and compares the performance of Accelerator versions of the benchmarks against hand-written pixel shaders.
Related Papers (5)