maxeler essence revisited n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Maxeler Essence Revisited PowerPoint Presentation
Download Presentation
Maxeler Essence Revisited

Loading in 2 Seconds...

play fullscreen
1 / 5

Maxeler Essence Revisited - PowerPoint PPT Presentation


  • 82 Views
  • Uploaded on

Maxeler Essence Revisited. Veljko Milutinovic and Nenad Korolija. Essence (1). What applications are potentially migratable to Maxeler ? Extra long execution time. Most of the execution time is in loops. What loops to migrate?

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Maxeler Essence Revisited' - morwen


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
maxeler essence revisited

Maxeler Essence Revisited

VeljkoMilutinovic and NenadKorolija

essence 1
Essence (1)
  • What applications are potentially migratable to Maxeler?
    • Extra long execution time.
    • Most of the execution time is in loops.
  • What loops to migrate?
    • High data reusability, once the data is moved to the accelerator.
    • High tolerance to long latencies, by the application.
  • What acceleration to expect?
    • If below the hardware limits,the more data,the higher the expected acceleration (good for Big Data)
    • The less sophisticated the data dependencies of different loop iterations, the higher the expected acceleration.
essence 2
Essence (2)

FOR i = 1 2 3 4 5 … k … n DO FOR i = 1 2 3 4 5 … n DO

T0 T1 T2 T3 T4 T0Tk T2k T3k

OP1 OP1

OP2 OP2

OP3 OP3

OP4 OP4

OP5 OP5

OP6 OP6

. .

. .

. .

OPkOPk

Tk Tk+1 Tk+2 Tk T2k

1 result/clockMAX T3k T4k

1 result/k*clockCPU

FPGA doing k operations

CPU doing only one

essence 3
Essence (3)

Hawaii

Tahiti