The Community for Technology Leaders
Green Image
Issue No. 04 - April (2012 vol. 23)
ISSN: 1045-9219
pp: 751-759
Fumihiko Ino , Osaka University, Osaka
Yuma Munekawa , Bukkyo University, Kyoto
Kenichi Hagihara , Osaka University, Osaka
In this paper, we propose a Fine Grained Cycle Sharing (FGCS) system capable of exploiting idle Graphics Processing Units (GPUs) for accelerating sequence homology search in local area network environments. Our system exploits short idle periods on GPUs by running small parts of guest programs such that each part can be completed within hundreds of milliseconds. To detect such short idle periods from the pool of registered resources, our system continuously monitors keyboard and mouse activities via event handlers rather than waiting for a screensaver, as is typically deployed in existing systems. Our system also divides guest tasks into small parts according to a performance model that estimates execution times of the parts. This task division strategy minimizes any disruption to the owners of the GPU resources. Experimental results show that our FGCS system running on two nondedicated GPUs achieves 111-116 percent of the throughput achieved by a single dedicated GPU. Furthermore, our system provides over two times the throughput of a screensaver-based system. We also show that the idle periods detected by our system constitute half of the system uptime. We believe that the GPUs hidden and often unused in office environments provide a powerful solution to sequence homology search.
Distributed systems, performance of systems, fine grained cycle sharing, homology search, Smith-Waterman algorithm, GPGPU, CUDA.

K. Hagihara, F. Ino and Y. Munekawa, "Sequence Homology Search Using Fine Grained Cycle Sharing of Idle GPUs," in IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 751-759, 2011.
82 ms
(Ver 3.3 (11022016))