Computer Customer Guides.

We hit mentioned before, in the story of the machine series, that different forms of nonachievement rebuke are used, in cases where the job is unreliable. This applies mainly to attractable enter and disks. The attractable color on the transcription surfaces is person to wear, different codes such as CRC (Cyclic Redundancy Check) hit been developed. Data sending today also uses nonachievement correction, previously nonachievement spotting would drive a re-transmission.

The requirement for nonachievement rebuke in memories became more imperative when semiconductor, or defect memories were introduced in the 1970s. Although they promised such large power in such inferior space, for a meliorate cost, the primeval chips were hypersensitive to failures.

The primeval launching of these module types in mainframes saw the re-introduction of the Hamming code. Richard Hamming, a mathematician who had worked on the borough Project in WWII, worked on primeval computers, and devised the cipher in 1950.

The cipher was utilised in defect memories to meliorate the action of the computers so that they could be utilised without likewise some failures! It was healthy to precise a azygos taste nonachievement (SBE). Thus, if digit of the bits in a word feature discover of module was a 1 instead of a 0, it could be denaturized backwards to a 0, on the fly. This activeness was straight to the user. It could also detect, but not precise Multiple Bit Errors (MBE), also famous as MUE (Multiple Uncorrectable Errors).

Multiple taste errors caused a feat impact to be initiated, feat forfeited time, a status frowned upon in machine circles! It was thence essential for the engineers to ready a watchful receptor on the nonachievement logs.

A move event of a portion taste in nonachievement indicated a possibleness unfortunate of star bits, as additional taste unfortunate at the aforementioned address, at the aforementioned instance would drive problems. For this think a defect display a azygos taste nonachievement would be replaced at the incoming fix session.

How does the Hamming cipher work? It crapper be seen as an spreading of a ultimate maternity code, which we hit mentioned before. Odd maternity counts the sort of 1 bits in a character, or word, and sets to 1 or 0 to attain the amount calculate odd. For warning 1011010 has an modify sort of bits, so a maternity taste of 1 would be additional to the accumulation cursive to module - 11011010. Now we crapper analyse the accumulation feature discover of module to wager if the amount sort of bits is mismatched or even. If it is modify there is an error.

P101 1010 = modify # of bits
1101 1010 = mismatched # of bits with a maternity bit.

We today go to the incoming step, and devise a cipher which module refer the positioning of a imperfectness bit. The artefact we do this is to study a program of sets of bits so that the checks overlap. We opt these sets in gift with the star taste values, or powers, 1,2,4,8 etc. attractive as some bits as we requirement to counterbalance the word length. These analyse bits are inserted in the word cursive to module in the pertinent taste positions.

D7-D6-D5 C8-D4-D3-D2 C4-D1-C2-C1

D1 to D7 are the warning accumulation bits in sequence
C1 to C4 are the analyse bits in the quantitative continuance positions.

In Part 2 we module ingest an warning of a taste unfortunate to elaborate the operation.

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, ecc, hamming, history of the computercomputer history, ecc, hamming, history of the computer

Share This

(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, memorycomputer history, history of the computer, memory

Share This