For here, what does it mean by coherent data storage?
kapalani
I think it refers to the way the elements are accessed from memory in the program or a measure of how cache friendly the datastructure is. For example arrays have coherent memory accesses and are cache-friendly because for every miss you encounter in the array, a number of hits will follow (this number depends on the cache block size). However, a datastructure like a linked list is not so cache friendly because we are following pointers and so we're jumping around to different places in memory.
For here, what does it mean by coherent data storage?
I think it refers to the way the elements are accessed from memory in the program or a measure of how cache friendly the datastructure is. For example arrays have coherent memory accesses and are cache-friendly because for every miss you encounter in the array, a number of hits will follow (this number depends on the cache block size). However, a datastructure like a linked list is not so cache friendly because we are following pointers and so we're jumping around to different places in memory.