Architectural exploration for datapaths with memory hierarchy

  • Authors:
  • N. D. Holmes;D. D. Gajski

  • Affiliations:
  • Dept. of Information & Computer Science, University of California, Irvine, California;Dept. of Information & Computer Science, University of California, Irvine, California

  • Venue:
  • EDTC '95 Proceedings of the 1995 European conference on Design and Test
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present a new design-space exploration algorithm, the architecture explorer (AE), for analyzing performance/cost tradeoffs in memory-intensive applications. AE evaluates FU, bus, and memory cost for a series of performance constraints to produce a performance/cost tradeoff curve. Unlike previous approaches, AE handles both hierarchical and non-hierarchical memory architectures with various speeds of memory.