Error handling in hard disk, Computer Engineering

Assignment Help:

Error handling in Hard disk in computer architecture:

Modern drives also make widespread use of Error Correcting Codes (ECCs), specifically Reed-Solomon error correction. These techniques store additional bits for each block of data that are resolute by mathematical formulas. The extra bits permit many errors to be fixed. Whereas these additional bits occupy space on the hard drive, they permit higher recording densities to be employed, resulting in much higher storage capacity for user data. In the year 2009, in the newest drives, low-density parity-check codes (LDPC) are supplanting Reed-Solomon. LDPC codes are able performance near to the Shannon Limit and therefore allow for the highest storage density available.

Typical hard drives effort to "remap" the data in a physical sector that will be bad to a spare physical sector-hopefully whilst the number of errors in that bad sector is still little enough that the E CC can fully recover the data without loss.

 

 


Related Discussions:- Error handling in hard disk

Difference between relocatable and self relocatable programs, Difference be...

Difference between relocatable and self relocatable programs. A relocatable program is one which can be processed to relocate it to a selected area of memory. For illustratio

Explain the paging unit, Explain the Paging Unit Paging mechanism funct...

Explain the Paging Unit Paging mechanism functions with 4K - byte memory pages or with a new extension available to Pentium with 4M byte-memory pages. In Pentium, with new 4M-b

What is cache memory, What is cache memory? The small and fast RAM unit...

What is cache memory? The small and fast RAM units are known as caches. When the implementation of an instruction calls for data located in main memory, the data are obtained a

Which class used for multicasting in ip addressing scheme, In IP addressing...

In IP addressing scheme, class used for multicasting is: A class used for multicasting in IP addressing scheme is class D.

Define deadlock, Define deadlock. A process requests resources; if the ...

Define deadlock. A process requests resources; if the resources are not available at that time, the method enters a wait state. Waiting processes might never again change state

War (write after read) - data hazards , WAR (write after read) - Data hazar...

WAR (write after read) - Data hazards in computer architecture: WAR (write after read) - j tries to write at destination before it is read by i , hence i  wrongly gets the n

A switch statement , Which is more efficient, a switch statement or an if e...

Which is more efficient, a switch statement or an if else chain? Ans) The differences, if any, are likely to be small. The switch statement was designed to be efficiently impl

Define congestion and grade of service, Define congestion and grade of serv...

Define congestion and grade of service. Congestion : This is uneconomic to give sufficient equipment to carry all the traffic which could possibly be offered to a telec

Doubly linked list than by singly linked list, Which operations is performe...

Which operations is performed more efficiently by doubly linked list than by singly linked list Deleting a node whose location is given.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd