Fundamental Concept of Cache (Part 3)

Posted February 16, 2010

    Cache stores recent-referenced data called “Temporal Locality” and its nearby data called “Spatial Locality”. The size that cache stores nearby data each time is called “cache line” or “cache block”. Cache line size must be a power of 2. For example: 64kb cache with 2kb cache line ...

Bitwise, the unlock mysterious (Part 2)

Posted February 11, 2010

Every digital image is made up by combination of millions of pixels. Each pixel has its own coordination (usually 2d-coordination) and color. We know that pixel's coordination can be stored as integer; but, the question is how computer store those colors? Everything in Computer is stored in bit...

Bitwise, the unlock mysterious (Part 1)

Posted February 11, 2010

Bitwise Operators, underestimated and ignored by most of new programmers due to its complexity, are powerful operators that have many uses in real software programming. The bitwise operators treat a data as its binary equivalent and manipulate it in a very high speed (bitwise operators generally a...

Fundamental Concept of Cache (Part 2)

Posted February 10, 2010

Last part, I discussed briefly about the important of cache to increase computer performance. Because cache is a smaller, faster and more expensive than main memory, it can only store small part of main memory. To make cache more effectively, cache must select data in the main memory which a...

Fundamental Concept of Cache (Part 1)

Posted February 7, 2010

Computer, we know today, relies on two major processes: storing/retrieving data from memory and executing computer instruction. Still, before executing computer instruction, computer processor needs to fletch data from memory. Because of this fact, computer processor spends 90% of the time accessing...