Split array and scalar data cache: A comprehensive study of data cache organization.

Thumbnail image of item number 1 in: 'Split array and scalar data cache: A comprehensive study of data cache organization.'.
Thumbnail image of item number 2 in: 'Split array and scalar data cache: A comprehensive study of data cache organization.'.
Thumbnail image of item number 3 in: 'Split array and scalar data cache: A comprehensive study of data cache organization.'.
Thumbnail image of item number 4 in: 'Split array and scalar data cache: A comprehensive study of data cache organization.'.
Showing 1-4 of 156 pages in this dissertation.

PDF Version Also Available for Download.

Description

Existing cache organization suffers from the inability to distinguish different types of localities, and non-selectively cache all data rather than making any attempt to take special advantage of the locality type. This causes unnecessary movement of data among the levels of the memory hierarchy and increases in miss ratio. In this dissertation I propose a split data cache architecture that will group memory accesses as scalar or array references according to their inherent locality and will subsequently map each group to a dedicated cache partition. In this system, because scalar and array references will no longer negatively affect each other, … continued below

Creation Information

Naz, Afrin August 2007.

Context

This dissertation is part of the collection entitled: UNT Theses and Dissertations and was provided by the UNT Libraries to the UNT Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 381 times. More information about this dissertation can be viewed below.

Who

People and organizations associated with either the creation of this dissertation or its content.

Author

Chair

Committee Members

Publisher

Rights Holder

For guidance see Citations, Rights, Re-Use.

  • Naz, Afrin

Provided By

UNT Libraries

The UNT Libraries serve the university and community by providing access to physical and online collections, fostering information literacy, supporting academic research, and much, much more.

About | Browse this Partner

Contact Us

Corrections Questions

What

Descriptive information to help identify this dissertation. Follow the links below to find similar items on the Digital Library.

Description

Existing cache organization suffers from the inability to distinguish different types of localities, and non-selectively cache all data rather than making any attempt to take special advantage of the locality type. This causes unnecessary movement of data among the levels of the memory hierarchy and increases in miss ratio. In this dissertation I propose a split data cache architecture that will group memory accesses as scalar or array references according to their inherent locality and will subsequently map each group to a dedicated cache partition. In this system, because scalar and array references will no longer negatively affect each other, cache-interference is diminished, delivering better performance. Further improvement is achieved by the introduction of victim cache, prefetching, data flattening and reconfigurability to tune the array and scalar caches for specific application. The most significant contribution of my work is the introduction of novel cache architecture for embedded microprocessor platforms. My proposed cache architecture uses reconfigurability coupled with split data caches to reduce area and power consumed by cache memories while retaining performance gains. My results show excellent reductions in both memory size and memory access times, translating into reduced power consumption. Since there was a huge reduction in miss rates at L-1 caches, further power reduction is achieved by partially or completely shutting down L-2 data or L-2 instruction caches. The saving in cache sizes resulting from these designs can be used for other processor activities including instruction and data prefetching, branch-prediction buffers. The potential benefits of such techniques for embedded applications have been evaluated in my work. I also explore how my cache organization performs for non-numeric data structures. I propose a novel idea called "Data flattening" which is a profile based memory allocation technique to compress sparsely scattered pointer data into regular contiguous memory locations and explore the potentials of my proposed Spit cache organization for data treated with data flattening method.

Language

Item Type

Identifier

Unique identifying numbers for this dissertation in the Digital Library or other systems.

Collections

This dissertation is part of the following collection of related materials.

UNT Theses and Dissertations

Theses and dissertations represent a wealth of scholarly and artistic content created by masters and doctoral students in the degree-seeking process. Some ETDs in this collection are restricted to use by the UNT community.

About | Browse this Collection

What responsibilities do I have when using this dissertation?

Digital Files

When

Dates and time periods associated with this dissertation.

Creation Date

  • August 2007

Added to The UNT Digital Library

  • Jan. 14, 2008, 11:15 p.m.

Description Last Updated

  • May 6, 2014, 4:08 p.m.

Usage Statistics

When was this dissertation last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 381
More Statistics

Interact With This Dissertation

Here are some suggestions for what to do next.

Start Reading

Thumbnail image of item number 1 in: 'Split array and scalar data cache: A comprehensive study of data cache organization.'.
Thumbnail image of item number 2 in: 'Split array and scalar data cache: A comprehensive study of data cache organization.'.
Thumbnail image of item number 3 in: 'Split array and scalar data cache: A comprehensive study of data cache organization.'.
Thumbnail image of item number 4 in: 'Split array and scalar data cache: A comprehensive study of data cache organization.'.

PDF Version Also Available for Download.

Citations, Rights, Re-Use

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Links for Robots

Helpful links in machine-readable formats.

Archival Resource Key (ARK)

International Image Interoperability Framework (IIIF)

Metadata Formats

Images

URLs

Stats

Naz, Afrin. Split array and scalar data cache: A comprehensive study of data cache organization., dissertation, August 2007; Denton, Texas. (https://digital.library.unt.edu/ark:/67531/metadc3932/: accessed April 23, 2024), University of North Texas Libraries, UNT Digital Library, https://digital.library.unt.edu; .

Back to Top of Screen