Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
An Efficient Semi-Hierarchical Array Layout
KTH, Tidigare Institutioner, Teleinformatik.
KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikation: Infrastruktur och tjänster, Programvaru- och datorsystem, SCS. KTH, Tidigare Institutioner, Teleinformatik.
Mälardalen University.
2001 (Engelska)Ingår i: Interaction between Compilers and Computer Architectures / [ed] Gyungho Lee, Pen-Chung Yew, Kluwer Academic Publishers, 2001, s. 21-43Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

For high-level programming languages, linear array layout (e.g., column major and row major orders) have de facto been the sole form of mapping array elements to memory. The increasingly deep and complex memory hierarchies present in current computer systems expose several deficiencies of linear array layouts. One such deficiency is that linear array layouts strongly favor locality in one index dimension of multidimensional arrays. Secondly, the exact mapping of array elements to cache locations depend on the array’s size, which effectively renders linear array layouts non-analyzable with respect to cache behavior. We present and evaluate an alternative, semi-hierarchical, array layout which differs from linear array layouts by being neutral with respect to locality in different index dimensions and by enabling accurate and precise analysis of cache behaviors at compile-time. Simulation results indicate that the proposed layout may exhibit vastly improved TLB behavior, leading to clearly measurable improvements in execution time, despite a lack of suitable hardware support for address computations. Cache behavior is formalized in terms of conflict vectors, and it is shown how to compute such conflict vectors at compile-time.

Ort, förlag, år, upplaga, sidor
Kluwer Academic Publishers, 2001. s. 21-43
Nationell ämneskategori
Datorsystem
Identifikatorer
URN: urn:nbn:se:kth:diva-72962ISBN: 0-7923-7370-7 (tryckt)OAI: oai:DiVA.org:kth-72962DiVA, id: diva2:488457
Konferens
Workshop on Interaction between Compilers and Computer Architectures (INTERACT-5)
Forskningsfinansiär
Vetenskapsrådet, 97-722
Anmärkning
NR 20140805Tillgänglig från: 2012-02-01 Skapad: 2012-02-01 Senast uppdaterad: 2012-02-01Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Av organisationen
TeleinformatikProgramvaru- och datorsystem, SCS
Datorsystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetricpoäng

isbn
urn-nbn
Totalt: 363 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf