Exploring the Tradeoffs between Programmability and Efficiency in Data-Parallel Accelerators

  • Authors:
  • Yunsup Lee;Rimas Avizienis;Alex Bishara;Richard Xia;Derek Lockhart;Christopher Batten;Krste Asanović

  • Affiliations:
  • University of California, Berkeley;University of California, Berkeley;Stanford University;University of California, Berkeley;Cornell University;Cornell University;University of California, Berkeley

  • Venue:
  • ACM Transactions on Computer Systems (TOCS)
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a taxonomy and modular implementation approach for data-parallel accelerators, including the MIMD, vector-SIMD, subword-SIMD, SIMT, and vector-thread (VT) architectural design patterns. We introduce Maven, a new VT microarchitecture based on the traditional vector-SIMD microarchitecture, that is considerably simpler to implement and easier to program than previous VT designs. Using an extensive design-space exploration of full VLSI implementations of many accelerator design points, we evaluate the varying tradeoffs between programmability and implementation efficiency among the MIMD, vector-SIMD, and VT patterns on a workload of compiled microbenchmarks and application kernels. We find the vector cores provide greater efficiency than the MIMD cores, even on fairly irregular kernels. Our results suggest that the Maven VT microarchitecture is superior to the traditional vector-SIMD architecture, providing both greater efficiency and easier programmability.