1 / 2

Architecture Independent Algorithm Analysis

Architecture Independent Algorithm Analysis. Algorithms. Use a combination of graph theory and visualization to understand fundamental resource requirements for key algorithms How many concurrent functional units can be used (how far can we go with packing FPUs on a single chip?)

deanne
Download Presentation

Architecture Independent Algorithm Analysis

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Architecture Independent Algorithm Analysis

  2. Algorithms • Use a combination of graph theory and visualization to understand fundamental resource requirements for key algorithms • How many concurrent functional units can be used (how far can we go with packing FPUs on a single chip?) • Data Locality (hierarchical data locality) • Memory bandwidth requirements • Latency tolerance (maximum load-to-use distance) • Dependency graph sources • Assembly language conversion (visualize register transfers & operational dependencies) • Modified GCC (create hybrid dataflow/control-flow graph) • Trace-driven address resolution (converts hybrid dataflow/control-flow graph into a pure dataflow graph)

More Related