• DocumentCode
    2186415
  • Title

    Parallel Memory Architecture for Arbitrary Stride Accesses

  • Author

    Aho, Eero ; Vanne, Jarno ; Hämäläinen, Timo D.

  • Author_Institution
    Inst. of Digital & Comput. Syst., Tampere Univ. of Technol.
  • fYear
    2006
  • fDate
    18-21 April 2006
  • Firstpage
    63
  • Lastpage
    68
  • Abstract
    Parallel memory modules can be used to increase memory bandwidth and feed a processor with only necessary data. Arbitrary stride access capability with interleaved memories is described in previous research where the skewing scheme is changed at run time according to the currently used stride. This paper presents the improved schemes which are adapted to parallel memories. The proposed novel parallel memory architecture allows conflict free accesses with all the constant strides which has not been possible in prior application specific parallel memories. Moreover, the possible access locations are unrestricted and the data patterns have equal amount of accessed data elements as the number of memory modules. The complexity is evaluated with resource counts
  • Keywords
    computational complexity; microprocessor chips; multiprocessing systems; parallel memories; access locations; arbitrary stride access; conflict free accesses; data patterns; interleaved memories; memory bandwidth; parallel memory architecture; run time; skewing scheme; Bandwidth; Cache memory; Delay; Digital signal processing; Feeds; Hardware; Memory architecture; Real time systems; Signal processing algorithms; Telecommunication computing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design and Diagnostics of Electronic Circuits and systems, 2006 IEEE
  • Conference_Location
    Prague
  • Print_ISBN
    1-4244-0185-2
  • Type

    conf

  • DOI
    10.1109/DDECS.2006.1649572
  • Filename
    1649572