Performance-relevant Parameters for Reconfigurable Processors Lars - - PowerPoint PPT Presentation

performance relevant parameters
SMART_READER_LITE
LIVE PREVIEW

Performance-relevant Parameters for Reconfigurable Processors Lars - - PowerPoint PPT Presentation

Classifying and Evaluating Performance-relevant Parameters for Reconfigurable Processors Lars Bauer, Muhammad Shafique, and Jrg Henkel Chair for Embedded Systems (CES) University of Karlsruhe L. Bauer Talk @ MPSoC09, August 7 th


slide-1
SLIDE 1
  • L. Bauer

Talk @ MPSoC’09, August 7th http://ces.univ-karlsruhe.de/bauer_l

Classifying and Evaluating Performance-relevant Parameters for Reconfigurable Processors

Lars Bauer, Muhammad Shafique, and Jörg Henkel Chair for Embedded Systems (CES)

University of Karlsruhe

slide-2
SLIDE 2

2

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Development of Embedded Systems

Typical:

Static analysis of hot spots Building tightly optimized system

Nowadays:

Increasing complexity More functionality

Problem:

Statically chosen design point has to match all requirements Typically inefficient for individual components (e.g. tasks or hot spots)

ht ht t ht ht ht ht ht ht ht ht ht ht http tp tp tp tp tp tp tp tp tp tp tp tp p / :/ :/ :/ :/ :/ :/ :/ :/ :/ :/ :/ :/ ://c /c /c /c /c /c /c /c /c /c /c /c /ces es es es es es es es es es es es es u .u .u .u .u .u i ni ni ni ni ni ni ni ni ni ni ni ni niv-ka ka ka ka ka ka ka ka ka ka ka ka ka l rl rl rl rl rl rl rl rl rl rl rl rl rlsr sr sr sr sr sr sr sr sr sr sr sr sr h uh uh uh uh uh uh uh uh uh uh uh uh uhe. e. e. e. e.de de de de de de de de de de de de de/b /b /b /b /b /b /b /b /b /b /b /b /b /bau au au au au au au au au au au au auer er er er er er er er er er er er er l _ SoC

  • C
  • C
  • C
  • C
  • C

C

  • C
  • ’0

’0 09, 9, 9, 9, 9, , A Aug g ug g ug ug ug g ug ug ug ug ug ug gus us us us us us us us s us us us us us us us us us us ust 7th

th h th th th th th th th th th h th th th th th th th th h th h th th th h

slide-3
SLIDE 3

3

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Flexibility, 1/time-to-market, … Efficiency: Mips/$, MHz/mW, Mips/area, … ASIC:

  • Non-programmable,
  • highly specialized

General purpose processor ASIP (extensible processor)

  • Instruction set extension
  • parameterization
  • inclusion/exclusion of

functional blocks “Hardware solution” “Software solution”

Possible Solution: Extensible Processors

mable, ized SIP nsible essor)

  • Instruction set extension
  • parameterization
  • inclusion/exclusion of

functional blocks

  • lution”

n lusio

Reconfigurable Compu- ting: Processor with reconfigurable ISA, i.e. reconfigurable Special Instructions

slide-4
SLIDE 4

4

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Related Work: Reconfigurable Processors

[CoMPARE’98]:

Fine-grained reconfigurable fabric coupled to the core pipeline Can implement a single Special Instruction (SI) at a time

[CHIMAERA’00]:

Supports multiple SIs in the reconfigurable fabric at the same time

[MOLEN’04]:

Can be configured to support only a single or multiples SIs at the same time

[RISPP’07]:

Supports multiple SIs at the same time and allows multiple (hardware) implementations per SI (providing different performance/area trade-offs) Partitions SIs into Data Paths which are reconfigured independently

Coarse-Grained Reconfiguration: ADRES, etc. (not the focus of this talk)

slide-5
SLIDE 5

5

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Outline

Introduction Related Work Reconfigurable Processor Alternatives

Special Instruction-Based Categorization Relevant Architectural Parameters Design Space Exploration Tool

Conclusion

slide-6
SLIDE 6

6

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

SI-Based Categorization

Providing Special Instruction (SI) Implementations:

How many SIs may be available at the same time? How many implementation alternatives exist per SI? Note: each SI may be executed by the ISA of the core pipeline

Technical constraints: Rectangular implementation of a hardware description (e.g. an SI)

The typical shape for place & route tools

These rectangular implementations cannot be placed at arbitrary positions within the reconfigurable fabric

They are typically aligned to dedicated communication ports that are provided at fixed positions

slide-7
SLIDE 7

7

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

SI-Based Categorization Overview

Changing number of SIs with different sizes (e.g. 2 big SIs or 5 small SIs); maximum number of total data paths (DPs) At most n>1 SIs with a fixed maximum size per SI One Implemen- tation per SI. SI has to be loaded completely before it is executable Category-1: Single SI Container How many SIs at the same time How many Imple- mentations per SI Category-3: Multiple

  • verlapping SIs

Category-4: Single

Partitioned SI Container

Category-5: Multiple Partitioned SI Containers Category-6: Multiple DP Containers At most 1 SI with a fixed maximum size Category-2: Multiple SI Containers

Core Pipeline Core Pipeline Core Pipeline Core Pipeline Core Pipeline Core Pipeline

Multiple Implemen- tations per SI. SIs are partitioned into Data Paths (DPs)

Legend:

Special Instruction Container (SIC): Data Path Con- tainer (DPC): Communica- tion System: Reconfigu- rable area: Core Pipeline (scaled down):

slide-8
SLIDE 8

8

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

SI-Based Categorization: Category-1: Single SI Container

Legend:

Special Instruction Container (SIC): Reconfigu- rable area: Core Pipeline (scaled down): Core Pipeline

At most one SI is available in hardware at a given time Relatively long reconfiguration time, depending on the size of the SI Container Depending upon the required amount of logic two SIs might fit into the Container, but it is not supported

Internal fragmentation

Corresponds to [CoMPARE’98]

slide-9
SLIDE 9

9

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

SI-Based Categorization: Category-2: Multiple SI Containers

Legend:

Special Instruction Container (SIC): Reconfigu- rable area: Core Pipeline (scaled down):

An SI may be loaded into any free container SIs may not be bigger than the container, even if not all containers are demanded

external fragmentation (in addition to the internal fragmentation per SI Container)

Core Pipeline

Corresponds to [CHIMAERA’00] and [MOLEN’04]

slide-10
SLIDE 10

10

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Example: Modular SIs (using Data Paths)

INPUT: OUTPUT:

DCT=0

QSub SAV (Sum of Absolute Values)

+ + +

X00 X30 X10 X20 Y20 Y00 Y10 Y30

Repack

>> 1

>> 1 >> 1

>> 1

+ + + +

<< 1 << 1

− −

DCT HT

Transform

HT=0 DCT=0 HT=1

X1 neg ≥ 0 X2 neg ≥ 0 X3 neg ≥ 0 X4 neg ≥ 0

+ + +

Y

slide-11
SLIDE 11

11

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

SI-Based Categorization: Category-3: Multiple overlapping SIs

Legend:

Special Instruction Container (SIC): Data Path Con- tainer (DPC): Communica- tion System: Reconfigu- rable area: Core Pipeline (scaled down): Core Pipeline

There is no predetermined maximum of supported SIs Multiple SIs may share common data paths (i.e. reuse them) because at most one SI is executed at a time. This addresses the internal and external fragmentation problem Demand for internal communication system

slide-12
SLIDE 12

12

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

SI-Based Categorization Overview

Changing number of SIs with different sizes (e.g. 2 big SIs or 5 small SIs); maximum number of total data paths (DPs) At most n>1 SIs with a fixed maximum size per SI One Implemen- tation per SI. SI has to be loaded completely before it is executable Category-1: Single SI Container How many SIs at the same time How many Imple- mentations per SI Category-3: Multiple

  • verlapping SIs

Category-4: Single

Partitioned SI Container

Category-5: Multiple Partitioned SI Containers Category-6: Multiple DP Containers At most 1 SI with a fixed maximum size Category-2: Multiple SI Containers

Core Pipeline Core Pipeline Core Pipeline Core Pipeline Core Pipeline Core Pipeline

Multiple Implemen- tations per SI. SIs are partitioned into Data Paths (DPs)

Legend:

Special Instruction Container (SIC): Data Path Con- tainer (DPC): Communica- tion System: Reconfigu- rable area: Core Pipeline (scaled down):

Category-3: Multiple

  • verlapping SIs

Category-2: Multiple SI Containers

Core Pipeline e n

  • Category-1: Single SI

Container

Core Pipeline e n

  • Core Pipeline

e n

slide-13
SLIDE 13

13

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Example: Modular SIs

(allowing for multiple Implementations)

INPUT: OUTPUT:

DCT=0

QSub SAV (Sum of Absolute Values)

+ + +

Repack Transform

HT=0 DCT=0 HT=1

The ‘Transform’ Data path might be available once (i.e. readily reconfigured) and used 8 times to realize the SI functionality Or it might be available twice and both instances are used 4 times,

  • r …
slide-14
SLIDE 14

14

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

SI-Based Categorization:

Category-4: Single Partitioned SI Container

Legend:

Special Instruction Container (SIC): Data Path Con- tainer (DPC): Communica- tion System: Reconfigu- rable area: Core Pipeline (scaled down): Core Pipeline

1 SI Container, partitioned into n DP Containers that are connected with a communication system When more DPs finish reconfiguration, then a faster implementation of an SI may become available Shorter reconfiguration time than Category-1 (only the demanded DPs need to be reconfigured) But still internal fragmentation (at most 1 SI supported; independent of it’s size)

slide-15
SLIDE 15

15

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

SI-Based Categorization:

Category-5: Multiple Partitioned SI Containers

Legend:

Special Instruction Container (SIC): Data Path Con- tainer (DPC): Communica- tion System: Reconfigu- rable area: Core Pipeline (scaled down): Core Pipeline

Shorter reconfiguration time Still internal fragmentation External fragmentation problems Additionally, if the DPs that are demanded by an SI are not in the same SI Containers, they can not be used together (e.g. to implement an SI)

slide-16
SLIDE 16

16

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

SI-Based Categorization: Category-6: Multiple DP Containers

Legend:

Special Instruction Container (SIC): Data Path Con- tainer (DPC): Communica- tion System: Reconfigu- rable area: Core Pipeline (scaled down): Core Pipeline

Main differences to Category-3:

SIs can be upgraded (due to multiple available SI implementations; like in Category-4 & 5) Decision how many DP Containers shall be spend for which SI can adapt at run time Demands a run-time system

Main diff. to Category-4 & 5:

No external fragmentation Available DPs may be used for all SIs, i.e. not fixed to a certain SI Container

Corresponds to [RISPP’07]

slide-17
SLIDE 17

17

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

SI-Based Categorization Overview

Changing number of SIs with different sizes (e.g. 2 big SIs or 5 small SIs); maximum number of total data paths (DPs) At most n>1 SIs with a fixed maximum size per SI One Implemen- tation per SI. SI has to be loaded completely before it is executable Category-1: Single SI Container How many SIs at the same time How many Imple- mentations per SI Category-3: Multiple

  • verlapping SIs

Category-4: Single

Partitioned SI Container

Category-5: Multiple Partitioned SI Containers Category-6: Multiple DP Containers At most 1 SI with a fixed maximum size Category-2: Multiple SI Containers

Core Pipeline Core Pipeline Core Pipeline Core Pipeline Core Pipeline Core Pipeline

Multiple Implemen- tations per SI. SIs are partitioned into Data Paths (DPs)

Legend:

Special Instruction Container (SIC): Data Path Con- tainer (DPC): Communica- tion System: Reconfigu- rable area: Core Pipeline (scaled down):

it

  • e

re r ip ne n

  • is

P Pip ip ip ip ip ip ip l e n i e e

[CoMPARE’98] [CHIMAERA’00] [MOLEN’04] [RISPP’07]

slide-18
SLIDE 18

18

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Outline

Introduction Related Work Reconfigurable Processor Alternatives

Special Instruction-Based Categorization Relevant Architectural Parameters Design Space Exploration Tool

Design Space Exploration Conclusion

slide-19
SLIDE 19

19

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Relevant Architectural Parameters

Core Pipeline Frequency: fCPU [MHz] FPGA Frequency: fFPGA [MHz]

May differ, due to fabrication technology

Data Memory Connection

Number of Memory Ports: P Bit width per Memory Port: W [Bits]

Reconfiguration Bandwidth: R [MB/s]

Determines time to reconfigure parts of the FPGA Depends on the FPGA configuration port and the used memory

slide-20
SLIDE 20

20

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Design Space Exploration Tool: Overview Input Data and Connections

Application Binary input input i n p u t Instruction Set Arch. Branch trace Defines the SIs (including instruc- tion format), implementations and data paths XML-file

Pipeline & run- time system SI management FPGA management

System C based simulator Input for pipeline is obtained from Instruction Set Simulator (ArchC) SI information is semi-automatically derived at compile time

slide-21
SLIDE 21

21

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Design Space Exploration Tool: Internal Composition

getFastestAvailableImpl()

Special Instruction

getRequiredDPs()

SI Implementation

isAvailableOnFPGA()

Data Path

manageSIexec()

SI Execution Unit Core Pipeline

Application Binary

Prefetching Unit Online Monitoring

input i n p u t input Instruction Set Arch. Branch trace

pushNextDataPath()

DP loading queue FPGA SIC FPGA DPC FPGA Special Instruction Container Data Path Container

2.. 1.. 0.. 0,1 1 1 1 1 1 1 1 1 1 1 1 0.. 1 1 1.. 1 0,1

Defines the SIs (including instruc- tion format), implementations and data paths XML-file

has many ▼ requires multiple ▼ currently contains ► is available

  • n FPGA

◄ contains ► 1 0.. knows ► triggers ► ◄ stalls ◄ observes asks ► fills ► triggers ▼ reconfigures ► 1.. 0..

Pipeline & run-time system SI management FPGA management

0.. ... ... ... ... ...

UML Legend: association: aggregation: composition: generalization:

1

slide-22
SLIDE 22

22

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Design Space Exploration Tool: Detailed Run-time Analysis

slide-23
SLIDE 23

23

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Outline

Introduction Related Work Reconfigurable Processor Alternatives

Special Instruction-Based Categorization Relevant Architectural Parameters Design Space Exploration Tool

Design Space Exploration Conclusion

slide-24
SLIDE 24

24

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Benchmark Application: H.264 Video Encoder

Challenging Application with many computational Hot Spots Benchmarking 20 frames in QCIF resolution (176x144) The GPP (i.e. a Sparc-V8 without reconfigurable hardware) requires 10.6 seconds @ 100 MHz 1.89 fps

2.1 seconds @ 500 MHz 9.52 fps

If MB_Type = P_MB

MC

Loop Over MB

Encoding Engine

Loop Over MB

ME: SA(T)D RD

MB-Type Decision (I or P) Mode Decision (for I or P)

Loop Over MB

IPRED DCT / Q DCT / HT / Q IDCT / IQ IDCT / IHT / IQ CAVLC

then else

MB Encoding Loop

In-Loop De- Blocking Filter

slide-25
SLIDE 25

25

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Special Instruction Overview

Parameter Value Comment

# SIs 9 4/1 in/out register (e.g. for memory addresses) # Data Paths 10 2/2 32-bit in/out values SI composition 1 - 4 DPs Utilizing multiple instances per DP SI memory accesses 0 – 128 words For some SIs the input from register file is sufficient, others work on data memory (using up to 2 ports á 128 bit) DP Bitstream 42,719 - 43,638 Byte Bitstream for partial reconfiguration on Xilinx Virtex-II xc2v6000 FPGA DP logic requirements 16 – 192 slices Note: these readings correspond to the pure computational logic without the necessary interconnection overhead

slide-26
SLIDE 26

26

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Special Instruction Overview (cont’d)

Special Instr. Implemented Data Paths

Motion Estimation SAD SAD_16 SATD QSub, Transform/HT_4, Repack, SAV (Inverse) Transform (I)DCT Transform/DCT_4, Repack, (QSub) (I)HT_2x2 Transform/HT_2 (I)HT_4x4 Transform/HT_4, Repack Motion Compensation MC_Hz_4 PointFilter, Repack, Clip3 Intra Prediction IPred_HDC CollapseAdd, Repack IPred_VDC CollapseAdd Loop Filter LF_BS4 Cond, LF_4

slide-27
SLIDE 27

27

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Parameter Invest. Values Category 1, 2 fCPU [MHz] 100 fFPGA [MHz] 100 R: [MB/s] 66 P: 2 W: [Bits] 128

Execution Time [s] Number of CLB Columns (determining amount of reconfigurable area)

5 10 15 20 25 30 35 1 2 3 4 5

Number of SI Containers

1 2 3 4 5 6 7 8 9 10 11

Evaluating Category-1 and 2

slide-28
SLIDE 28

28

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Parameter

  • Invest. Values

Category 4, 5 fCPU [MHz] 100 fFPGA [MHz] 50, 100 R: [MB/s] 33, 66, 100 P: 1, 2 W: [Bits] 32, 64, 128

Execution Time [s]

1 2 3 4 5 6 7 5 10 15 20 25 30 1 2 3 4 5

Summarizing 2016 Measurements

Evaluating Category-4 and 5

L Bauer Talk lk @

Execution T

1 2 3 4 5 10 10 15 15

1 SI Container is not sufficient

f

7

S

Evaluating many different parameters, but #SICs and #DPCs dominate the other readings

ht http / ://ces u i niv-ka l rlsr h uhe de/b /bauer l MPS PS C

  • C’0

’09 August 7th

th th

20 20 25 25 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 1 2

M

Rather many DPCs no longer lead to a slower execution time

slide-29
SLIDE 29

29

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Parameter

  • Invest. Values

Category 3, 5, 6 fCPU [MHz] 100, 200, 500 fFPGA [MHz] 50, 100 R: [MB/s] 66 P: 2 W: [Bits] 128

0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 5 10 15 20 25

Execution Time [s]

Category-6 Category-3 Category-5 with 2 SICs

Evaluating Category-3, 5, and 6

Bauer er h Ta Talk lk lk lk @ @ M MPS PS PS PS C

  • C
  • C’0

’0 ’0 09, A Aug ugus ust 7th

th th th

5 10 15 20 25 25

‘Critical’ Amount of DP Containers: Category-5: 8 DPCs Category-3: 5 DPCs Category-6: 5 DPCs

slide-30
SLIDE 30

30

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 25

Exec. Time [s]

5 10 15 20

Evaluating impact of CPU Frequency

3.28x 1.23x

4.5 5

50 MHz CPU

1 1.5

500 MHz CPU

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

2.5 3

100 MHz CPU 100 MHz vs. 500 MHz CPU

slide-31
SLIDE 31

31

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Categ fCPU [M fFPGA [M R: [M P W: [B

C

10 15 20 25

Evaluating impact of FPGA Frequency

100 MHz FPGA

1.86x

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Observation: When insufficient FPGA resources are available (rather sequential computation), the CPU fre- quency has the higher impact. When sufficient FPGA resources are available (more parallel computation), the FPGA frequency has the higher impact.

50 MHz FPGA

slide-32
SLIDE 32

32

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Evaluating Data Memory Connection

For a given total bit width the 2-port data memory always

  • utperforms the 1-port memory

Data Memory Connection affects potential parallelism

  • affects the relevance of CPU and/or FPGA frequency

0.1 0.2 0.3 0.4 0.5 0.6 0.7 32 64 128 Execution Time [s] Bit width per Port

1 Port 2 Ports Execution times are for Category-6 (averaged for 14 to 24 DPCs)

slide-33
SLIDE 33

33

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Evaluating Reconfiguration Bandwidth

Parameter Values Category 6 fCPU [MHz] 100 fFPGA [MHz] 50 R: [MB/s] 1-25 P: 2 W: [Bits] 128

Execution Time [s]

0.5 1 1.5 2 2.5 3 3.5 4 5 10 15 20 25 20 10

4 DPCs, 25 MB/s 5 DPCs, 25 MB/s #DPCs and band- width settings limit the performance inside this region

slide-34
SLIDE 34

34

  • L. Bauer

http://ces.univ-karlsruhe.de/bauer_l Talk @ MPSoC’09, August 7th

Summary & Conclusion

Reconfigurable Processors are a promising approach for challenging and/or dynamically changing applications They can be categorized according their implementation of Special Instructions

How many SIs may be available at the same time? How many implementation alternatives exist per SI? Covering existing architectures and unveiling further ones

Furthermore, different architectural parameters affect the performance of the system These settings interfere with each other (e.g. data memory connection and CPU/FPGA frequency)

This talk highlighted which parameters are relevant in which situation, based on an exhaustive design space exploration

slide-35
SLIDE 35
  • L. Bauer

Talk @ MPSoC’09, August 7th http://ces.univ-karlsruhe.de/bauer_l

Lars Bauer, Muhammad Shafique, and Jörg Henkel Chair for Embedded Systems (CES)

University of Karlsruhe

Lars Baue er aue er Muhammad , M d Muhammad , M , d hafique, Sh S and Jörg Henkel Chair for Embedded Systems (CES)

University of Karlsruhe

Thank you for your attention !

Classifying and Evaluating Performance-relevant Parameters for Reconfigurable Processors