HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Master Theses  >

Please use this identifier to cite or link to this item:
Title: Mars : accelerating MapReduce with graphics processors
Other Titles: Accelerating mapreduce with graphics processors
Authors: Fang, Wenbin
Issue Date: 2010
Abstract: We design and implement Mars, a MapReduce runtime system accelerated with graphics processing units (GPUs). MapReduce is a simple and flexible parallel programming paradigm originally proposed by Google, for the ease of large scale data processing on thousands of CPUs. Compared with CPUs, GPUs have an order of magnitude higher computation power and memory bandwidth. However, GPUs are designed as special-purpose co-processors and their programming interfaces are less familiar than those on the CPUs to MapReduce programmers. To harness GPUs’ power for MapReduce, we developed Mars to run on NVIDIA GPUs, AMD GPUs, as well as multi-core CPUs. Furthermore, we integrated Mars into Hadoop, an open-source CPU-based distributed MapReduce system. Mars hides the programming complexity of GPUs behind the simple and familiar MapReduce interface, and automatically manages task partitioning, data distribution, and parallelization on the processors. We have implemented six representative applications on Mars and evaluated their performance on PCs equipped with GPUs as well as multi-core CPUs. The GPU acceleration with an NVIDIA GTX280 achieved a speedup of an order of magnitude over a quad-core CPU. Utilizing both the GPU and the CPU further improved GPU-only performance by 40% for some applications. Additionally, integrating Mars into Hadoop enabled GPU acceleration for a network of PCs.
Description: Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2010
ix, 36 p. : ill. ; 30 cm
HKUST Call Number: Thesis CSED 2010 Fang
Appears in Collections:CSE Master Theses

Files in This Item:

File Description SizeFormat

All items in this Repository are protected by copyright, with all rights reserved.