1 / 4

Lab 4: Exploiting the memory hierarchy - Session 14 -

Lab 4: Exploiting the memory hierarchy - Session 14 -. Peter Marwedel Heiko Falk TU Dortmund Informatik 12 Germany. Optimization for a single scratchpad (1).

dallon
Download Presentation

Lab 4: Exploiting the memory hierarchy - Session 14 -

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. Lab 4: Exploiting the memory hierarchy- Session 14 - Peter Marwedel Heiko Falk TU Dortmund Informatik 12 Germany

  2. Optimization for a single scratchpad (1) Assume that we have a processor-based system consisting of a processor, a scratchpad memory and a main memory of 128 k words (at 16 bits). Some functions can be allocated to the scratchpad memory (SPM). The program has the characteristics shown in the following table 1.

  3. Optimization for a single scratchpad (2) Each word access to the main memory requires 50 nJ. Generate an ILP formulation of the energy minimization problem. Use ℓp_solve in order to find functions that should be allocated to the scratch pad memory. Solve the optimization problem for the following scratch pad sizes: 64, 128, 256, 512, 768, and 1 k words. The energy per access for a memory of 1 k words is 1 nJ. Energies are assumed to scale linearly within the range of sizes we consider (i.e.., it is 0.064 nJ for a memory of 64 words). Generate a graphical representation of the energy saving as a function of the scratch pad memory size.

  4. Optimization for a partitioned scratchpad • Generate an ILP model for case of a scratch pad memory partitioned into 1 memory of 1 k words, and 2 memories of 512 words. • Also, assume that we have a main memory with the characteristics of the main memory in assignment 4. Compare the energy consumption against the case of a single scratch pad memory of 2 k words (energy consumption 2 nJ per word access) complemented by a main memory (having the same characteristics as in assignment 4). • Use ℓp_solve to solve the optimization problem.

More Related