By: David Kanter (dkanter.delete@this.realworldtech.com), August 8, 2012 10:49 am
Room: Moderated Discussions
> As far as I can tell, there are really only two types of
> workloads:
>
> 1. Latency-sensitive applications with irregular data access
> patterns.
> 2. Bandwidth-sensitive applications with highly regular data access
> patterns.
>
> Any program that includes both types of code could use both
> latency-optimized memory addresses (i.e. CPU caches and external DIMMs) and
> bandwidth-optimized memory addresses (stacked memory) with the virtual memory
> space partitioned into different address ranges referring to the respective
> physical memory types/hierarchies. Am I missing something big or is it really
> this simple?
Most sparse matrix methods would be hybrids. They really need a lot of bandwidth, but are highly irregular.
David
> workloads:
>
> 1. Latency-sensitive applications with irregular data access
> patterns.
> 2. Bandwidth-sensitive applications with highly regular data access
> patterns.
>
> Any program that includes both types of code could use both
> latency-optimized memory addresses (i.e. CPU caches and external DIMMs) and
> bandwidth-optimized memory addresses (stacked memory) with the virtual memory
> space partitioned into different address ranges referring to the respective
> physical memory types/hierarchies. Am I missing something big or is it really
> this simple?
Most sparse matrix methods would be hybrids. They really need a lot of bandwidth, but are highly irregular.
David
