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

How do you detect if two 8-bit signals are same, By using XNOR gate if the ...

By using XNOR gate if the signals are similar then only the output will be one otherwise not.

How can i delete a file, The Standard C Library function is removing. (This...

The Standard C Library function is removing. (This is thus one of the few questions in this section for which the answer is not ''It's system-dependent.'') On older, pre-ANSI Unix

Implement a memory management system , There should be 1 server thread and ...

There should be 1 server thread and N client threads, where N is supplied by the user as a command line argument. The server opens a file called "all_requests.dat", the file has

Payroll pc, Purpose: Payroll processing and storage for the client database...

Purpose: Payroll processing and storage for the client database (accessed from the Reception-PCover the network),word processing (reports etc.) and spreadsheets. Software: . • W

Explain time complexity in parallel algorithms, Q. Explain Time Complexity ...

Q. Explain Time Complexity in Parallel algorithms? As it takes place nearly everyone who implement algorithms wish to know how much of an individual resource (for example time

Nand gate, The NAND gate. The NAND gate is equivalent to an AND gate fo...

The NAND gate. The NAND gate is equivalent to an AND gate followed by a NOT gate so that the output is 0 when all of the inputs are high, otherwise the output is 1. There may

Instruction per cycle in RISC, Q. Instruction per cycle in RISC? One in...

Q. Instruction per cycle in RISC? One instruction per cycle: A machine cycle is total time taken to fetch two operands from registers perform ALU operation on them and store re

What decision has the highest expected value, The Prisoner's Dilemma is a w...

The Prisoner's Dilemma is a well-known problem in game theory. Two thieves are arrested and held in custody separately. The police offer each the same deal. Inform on your partn

Can 8259 be interfaced with 8085 via the trap pin, I think yes...so if 8259...

I think yes...so if 8259 gives interrupt then it will be serviced instantly but since into pin is left hanging the insr bit will never be set...and so whenever any interrupt occurs

Write a program that will solve a puzzle, You will write a program that wil...

You will write a program that will solve a version of the common newspaper puzzle \word search." In the puzzle you are given a grid lled with characters and a list of words to nd

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