Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Cache-Conscious Allocation of Pointer-Based Data Structures Revisited with HW/SW Prefetching
KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.
KTH, School of Information and Communication Technology (ICT), Microelectronics and Information Technology, IMIT.ORCID iD: 0000-0002-9637-2065
2003 (English)Conference paper, Published paper (Refereed)
Abstract [en]

As memory access times continue to be a bottleneck, differential research is required for better understanding of memory access performance. Studies of cache-conscious allocation and software prefetch have recently sparked research in the area of software optimizations on memory, as pointer-based data structures previously have been elusive to the optimizing techniques available. Research on hardware prefetch mechanisms have in some cases shown improvements, but less analytical schemes have tended to degrade performance for pointer-based data structures. This paper combines four hardware schemes, normally not efficient on pointer-based data structures, and a greedy software prefetch with cache-conscious allocation to evaluate positive effects of increased locality, in a comparative evaluation, on five level 1 data cache line sizes. We show that cache-conscious allocation utilizes large cache lines efficiently and that none of the prefetch strategies evaluated add significantly to the effect already achieved by the cache-conscious allocation on the hardware evaluated. The passive prefetching mechanism of using large cache lines with cache-conscious allocation is by far outstanding.

Place, publisher, year, edition, pages
2003. 2-13 p.
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:kth:diva-109693OAI: oai:DiVA.org:kth-109693DiVA: diva2:584871
Conference
Proceedings of the 2003 Workshop on Duplicating, Deconstructing and Debunking (WDDD-2)
Note
NR 20140805Available from: 2013-01-09 Created: 2013-01-08 Last updated: 2013-01-09Bibliographically approved

Open Access in DiVA

No full text

Other links

http://www.imit.kth.se/~matsbror/papers/hallbergpalm_wddd03.pdf

Authority records BETA

Brorsson, Mats

Search in DiVA

By author/editor
Brorsson, Mats
By organisation
Microelectronics and Information Technology, IMIT
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 39 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf