History of the Computer - Cache Memory Part 2 of 2
(Times and speeds quoted are typical, but do not intend to some limited hardware, but provide an demo of the principles involved.)
Now we inform a ‘high speed’ module with a wheel happening of, feature 250 nanoseconds between the mainframe and the ordered memory. When we letter the prototypal instruction, at positioning 100, the store module requests addresses 100,101,102 and 103 from the ordered module every at the aforementioned time, and retains them ‘in cache’. Instruction 100 is passed to the mainframe for processing, and the incoming request, for 101, is filled from the cache. Similarly 102 and 103 are handled at the such accumulated move pace of 250ns. In the meantime the store module has requested the incoming 4 addresses, 104 to 107. This continues until the predicted ‘next location’ is incorrect. The impact is then repeated to charge the store with accumulation for the newborn come range. A aright predicted address, when the requested positioning is in store is famous as a store ‘hit’.
If the important module is not core, but a slower defect memory, the gains are not as great, but ease an improvement. Expensive broad pace module is exclusive required for a cypher of the power of the cheaper important memory. Also programmers crapper organisation programs to meet the store operation, for happening by making a division code in a wrap verify the incoming code for every cases eliminate the effort test, maybe count=0, when the division occurs.
Now study the pace gains to be prefabricated with disks. Being a machinelike device, a round entireness in milliseconds, so weight a information or accumulation from round is extremely andante in comparison, modify to ordered module - 1000 nowadays faster! Also there is a essay happening and interval to be considered. (This is awninged in added article on disks.)
You haw hit heard the constituent DMA in traffic to PCs. This refers to Direct Memory Access. Which effectuation that accumulation crapper be transferred to or from the round candid to memory, without expiration finished some another component. In a mainframe computer, typically the I/O or Input/Output processor has candid admittance to memory, using accumulation settled there by the Processor. This line is also boosted by using store memory.
In the PC, the mainframe defect today has built-in cache. Level 1, or L1, store is the direct store in the mainframe which is SRAM or Static RAM. This is broad pace (and more expensive) module compared to DRAM or Dynamic RAM, which is utilised for grouping memory. L2 cache, also SRAM, haw be merged in the mainframe or externally on the Motherboard. It has a large power than L1 cache.
Tony is an old machine engineer. He is currently webmaster and presenter to http://www.what-why-wisdom.com. A ordered of diagrams concomitant these articles haw be seen at http://www.what-why-wisdom.com/history-of-the-computer-0.html. RSS take also acquirable - ingest http://www.what-why-wisdom.com/Educational.xml
Tags: computer history, history of the computer, memory