Recovery regarding the file system in windows 2000, Operating System

Assignment Help:

Write short note on recovery regarding the file system in Windows 2000.

In many file systems a power breakdown at the wrong time can damage the file system data structures so severely that the entire volume is scrambled. NTFS has a variant approach to file-system robustness. In NTFS all file-system and data-structures updates are performed inside transactions. Previous to a data structure is altered, the transaction writes log records that contains redo and undo information then data structure has been changed the transaction writes a commit record to the log to signify that the transaction succeeded. Subsequent to a crash the system can restore the file system data structures to a consistent state by processing the log records first redoing the operations for the committed transactions after that undoing the operations for transactions that did not commit successfully before the crash.

 


Related Discussions:- Recovery regarding the file system in windows 2000

Introduction to paging, We will brie?y introduce paging to ?nish off this l...

We will brie?y introduce paging to ?nish off this lecture. When a process is loaded, not all of the pages are immediately loaded, since it's possible that they will not all be need

Define thrashing, Define thrashing. Thrashing is the accident of high p...

Define thrashing. Thrashing is the accident of high page traffic and low CPU utilization. It is observed that the cause of thrashing is an under-commitment of memory to program

Keeping track of free memory, How do we keep track of where the free pieces...

How do we keep track of where the free pieces of memory are? One idea is to maintain a set of linked-lists of free space; each linked-list will store free chunks of some given size

What is contiguous allocation, What is contiguous allocation? Allocati...

What is contiguous allocation? Allocation of a group of consecutive sectors for a one file.

Explain the various page replacement strategies, Explain the various page r...

Explain the various page replacement strategies. Page replacement-basic scheme with diagram Optimal page replacement LRU page replacement FIFO page replacement LRU

Explain what is semaphores, Explain what semaphores are, their usage, imple...

Explain what semaphores are, their usage, implementation given to avoid busy waiting and binary semaphores. Semaphore definition Usage for mutual exclusion and process synch

Define a linker program, Define a linker program  A linker program lin...

Define a linker program  A linker program links the program along with other programs required for its execution.

Explain about input - output system management, Q. Explain about Input - Ou...

Q. Explain about Input - Output System Management? I/O System Management The module which keeps track of the status of devices is known as I/O traffic controller. Every

What inference does recovery in distributed systems, Q. Consider a distrib...

Q. Consider a distributed system with two sites A and B. Consider whether site A can distinguish among the following: a. B goes down. b. The link between A and B goes down.

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