國立虎尾科技大學 |

Static and Dynamic Instruction Mapping for Spatial Architectures.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Static and Dynamic Instruction Mapping for Spatial Architectures./
作者:	Liu, Feng.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2018,
面頁冊數:	120 p.
附註:	Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
Contained By:	Dissertation Abstracts International79-10B(E).
標題:	Computer engineering. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10808915
ISBN:	9780438047402

Static and Dynamic Instruction Mapping for Spatial Architectures.
Liu, Feng.

Static and Dynamic Instruction Mapping for Spatial Architectures. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 120 p.

Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.

Thesis (Ph.D.)--Princeton University, 2018.

In response to the technology scaling trends, spatial architectures have emerged as a new style of processors for executing programs more efficiently. Unlike traditional Out-of-Order (OoO) processors, which time-share a small set of functional units, a spatial computer is composed of hundreds or even thousands of simple and replicated functional units. Spatial architectures avoid the overheads of time-sharing and of generating schedules repeatedly, by mapping instruction sequences onto the functional units explicitly and reusing the schedules across multiple invocations.

ISBN: 9780438047402Subjects--Topical Terms:

569006
Computer engineering.

Static and Dynamic Instruction Mapping for Spatial Architectures.
LDR:03110nam a2200337 4500 001 931661
005 20190716101634.5
008 190815s2018 ||||||||||||||||| ||eng d
020 $a 9780438047402
035 $a (MiAaPQ)AAI10808915
035 $a (MiAaPQ)princeton:12487
035 $a AAI10808915
040 $a MiAaPQ $c MiAaPQ
100 1 $a Liu, Feng. $3 786440
245 1 0 $a Static and Dynamic Instruction Mapping for Spatial Architectures.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 120 p.
500 $a Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
500 $a Adviser: David August.
502 $a Thesis (Ph.D.)--Princeton University, 2018.
520 $a In response to the technology scaling trends, spatial architectures have emerged as a new style of processors for executing programs more efficiently. Unlike traditional Out-of-Order (OoO) processors, which time-share a small set of functional units, a spatial computer is composed of hundreds or even thousands of simple and replicated functional units. Spatial architectures avoid the overheads of time-sharing and of generating schedules repeatedly, by mapping instruction sequences onto the functional units explicitly and reusing the schedules across multiple invocations.
520 $a Currently, spatial architectures mainly use static methods to map instructions onto the arrays of functional units. The existing methods have several limitations: First, for programs with irregular memory accesses and control flows, they yield poor performance because the functional units need to be invoked sequentially to respect data and control dependences. Second, static methods cannot fully exploit speculation techniques, which are the dominant performance sources in OoO processors. Finally, static methods cannot adapt to changing workloads and are not compatible across hardware generations.
520 $a To address these issues and improve the applicability of spatial architectures, this dissertation proposes two techniques. The first, Coarse-Grained Pipelined Accelerators (CGPA), is a static compiling framework that exploits the hidden parallelism within irregular C/C++ loops and translates them into spatial hardware modules. The proposed technique has been implemented as a compiler pass and the experiment shows 3.3x speedup over the performance achieved by an open-source tool baseline.
520 $a The second technique, Dynamic Spatial Architecture Mapping (DYNASPAM), reuses the speculation system in the OoO processors to dynamically produce high-performance scheduling and execution on a dedicated spatial fabric. The proposed technique is modeled by a cycle accurate simulator and the experiment shows the new technique can achieve 1.4x geomean performance improvement and 23.9% energy consumption reduction, compared to an OoO processor baseline.
590 $a School code: 0181.
650 4 $a Computer engineering. $3 569006
650 4 $a Computer science. $3 573171
690 $a 0464
690 $a 0984
710 2 $a Princeton University. $b Electrical Engineering. $3 1181685
773 0 $t Dissertation Abstracts International $g 79-10B(E).
790 $a 0181
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10808915