Re: Can this type of cache miss be reduced?

George Neuner <gneuner2@comcast.net>
Mon, 01 Jun 2009 12:50:26 -0400

          From comp.compilers
Related articles
Can this type of cache miss be reduced? joefoxreal@gmail.com (Eric Fisher) (2009-06-01)
Re: Can this type of cache miss be reduced? gneuner2@comcast.net (George Neuner) (2009-06-01)
Re: Can this type of cache miss be reduced? max@gustavus.edu (Max Hailperin) (2009-06-02)
Re: Can this type of cache miss be reduced? joefoxreal@gmail.com (Eric Fisher) (2009-06-03)
Re: Can this type of cache miss be reduced? lkrupp@indra.com (Louis Krupp) (2009-06-03)
Re: Can this type of cache miss be reduced? gah@ugcs.caltech.edu (glen herrmannsfeldt) (2009-06-03)
Re: Can this type of cache miss be reduced? max@gustavus.edu (Max Hailperin) (2009-06-03)
| List of all articles for this month |
From: George Neuner <gneuner2@comcast.net>
Newsgroups: comp.compilers
Date: Mon, 01 Jun 2009 12:50:26 -0400
Organization: A noiseless patient Spider
References: 09-06-003
Keywords: architecture, optimize
Posted-Date: 02 Jun 2009 13:22:50 EDT

On Mon, 1 Jun 2009 09:14:57 +0000 (UTC), Eric Fisher
<joefoxreal@gmail.com> wrote:


>But, for a large one-dimensional array, suppose the elements are only
>accessed once, can we still reduce the cache miss?


You can if the elements are accessed in a predictable pattern that
allows preloading the element's cache line. That requires the
computation of the index to be regular, which may require changing the
element storage order of the array.


George


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.