Name
Abstract | ||
|---|---|---|
With the end of Dennard scaling and Moore's law, it is becoming increasingly difficult to build hardware for emerging applications that meet power and performance targets, while remaining flexible and programmable for end users. This is particularly true for domains that have frequently changing algorithms and applications involving mixed sparse/dense data structures, such as those in machine learning and graph analytics. To overcome this, we present a flexible accelerator called Transmuter, in a novel effort to bridge the gap between General-Purpose Processors (GPPs) and Application-Specific Integrated Circuits (ASICs). Transmuter adapts to changing kernel characteristics, such as data reuse and control divergence, through the ability to reconfigure the on-chip memory type, resource sharing and dataflow at run-time within a short latency. This is facilitated by a fabric of light-weight cores connected to a network of reconfigurable caches and crossbars. Transmuter addresses a rapidly growing set of algorithms exhibiting dynamic data movement patterns, irregularity, and sparsity, while delivering GPU-like efficiencies for traditional dense applications. Finally, in order to support programmability and ease-of-adoption, we prototype a software stack composed of low-level runtime routines, and a high-level language library called TransPy, that cater to expert programmers and end-users, respectively.
Our evaluations with Transmuter demonstrate average throughput (energy-efficiency) improvements of 5.0× (18.4×) and 4.2× (4.0×) over a high-end CPU and GPU, respectively, across a diverse set of kernels predominant in graph analytics, scientific computing and machine learning. Transmuter achieves energy-efficiency gains averaging 3.4× and 2.0× over prior FPGA and CGRA implementations of the same kernels, while remaining on average within 9.3× of state-of-the-art ASICs.
|
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3410463.3414627 | PACT '20: International Conference on Parallel Architectures and Compilation Techniques
Virtual Event
GA
USA
October, 2020 |
DocType | ISBN | Citations |
Conference | 978-1-4503-8075-1 | 4 |
PageRank | References | Authors |
0.41 | 0 | 20 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| subhankar pal | 1 | 32 | 5.27 |
| Siying Feng | 2 | 10 | 2.25 |
| Dong-Hyeon Park | 3 | 28 | 2.49 |
| Sung Kim | 4 | 4 | 0.41 |
| Aporva Amarnath | 5 | 39 | 5.18 |
| Chi-Sheng Yang | 6 | 4 | 0.41 |
| Xin He | 7 | 9 | 1.91 |
| Jonathan Beaumont | 8 | 36 | 2.85 |
| Kyle May | 9 | 6 | 0.77 |
| Yan Xiong | 10 | 5 | 0.76 |
| Kuba Kaszyk | 11 | 6 | 1.11 |
| John Magnus Morton | 12 | 6 | 2.12 |
| Jiawen Sun | 13 | 6 | 1.45 |
| Michael O'Boyle | 14 | 30 | 1.55 |
| Murray Cole | 15 | 876 | 57.81 |
| Chaitali Chakrabarti | 16 | 1978 | 184.17 |
| David Blaauw | 17 | 8916 | 823.47 |
| Hun-Seok Kim | 18 | 294 | 27.15 |
| Trevor Mudge | 19 | 6139 | 659.74 |
| Ronald G. Dreslinski | 20 | 1258 | 81.02 |