A resource selection method for cycle stealing in the GPU grid

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Modern programmable graphics processing units (GPUs) provide increasingly higher performance, motivating us to perform general-purpose computation on the GPU (GPGPU) beyond graphics applications. In this paper, we address the problem of resource selection in the GPU grid. The GPU grid here consists of desktop computers at home and the office, utilizing idle GPUs and CPUs as computational engines for compute-intensive applications. Our method tackles this challenging problem (1) by defining idle resources and (2) by developing a resource selection method based on a screensaver approach with low-overhead sensors. The sensors detect idle GPUs by checking video random access memory (VRAM) usage and CPU usage on each computer. Detected resources are then selected according to a matchmaking framework and benchmark results obtained when the screensaver is installed on the machines. The experimental results show that our method achieves a low overhead of at most 262 ms, minimizing interference to resource owners with at most 10% performance drop. © Springer-Verlag 2006.

Cite

CITATION STYLE

APA

Kotani, Y., Ino, F., & Hagihara, K. (2006). A resource selection method for cycle stealing in the GPU grid. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4331 LNCS, pp. 769–780). https://doi.org/10.1007/11942634_79

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free