4 Matching Annotations
  1. Mar 2022
    1. a program needs a particular data object d from level k + 1, it first looksfor d in one of the blocks currently stored at level k. If d happens to be cachedat level k, then we have what is called a cache hit.

      什么是 cache hits?什么是 cache misses?

    2. It is important to realize that while the block size is fixedbetween any particular pair of adjacent levels in the hierarchy, other pairs of levelscan have different block sizes.

      在 memory hierarchy 之间的 block size 有什么特点?

    3. The central idea of a memory hierarchy is that for each k, the faster and smallerstorage device at level k serves as a cache for the larger and slower storage device

      memory hierarchy 的中心想法是什么?该如何理解?

  2. Jul 2015
    1. I agree with the conclusion that hierarchies and letting users put things in places is good, but I want to posit a more nuanced explanation than "we are set in our ways".

      I think sometimes we don't remember what exactly it is we're looking for. We may not have a word, or a name, or date. But if we put it some place in particular we can find it spatially rather than linguistically.

      This is why I think labels are superior to hierarchies. When we transcend the limitations of physical space would should not throw out space, but we should throw away the constraints of 3D space with its contiguous, volumetric forms. Labels let you put things in as many places as you like. Labels can, too, be hierarchical.

      The problem with the current crop of systems that eschew hierarchy is that they replace it with a text box.

      One could make the argument that smart indexing is just automatic labeling, but I think there's a memory function in having created the labels oneself.

      I'd like to see systems that experiment with more ways to fold space. Shortcuts are like wormholes. Maybe we should have common actions for creating bi-directional ones. On mobile devices I think we should take more advantage of zooming and z-planes.