Compression regarding the file system in windows 2000, Operating System

Assignment Help:

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

NTFS is able to perform data compression on individual files or on all data files in a directory. To reduce a file NTFS divides the file's data into compression units which are blocks of 16 contiguous clusters. When every compression unit is written a data compression algorithm is applied. If the result fits into less than 16 clusters the compressed version is stored. When reading NTFS is able to determine whether data have been compressed and if they have been the length of the stored compression unit will be less than 16 clusters. To get better performance when reading contiguous compression units NTFS decompresses and prefetches ahead of the application request.

 

 


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

Algorithm for reconstructing a logical ring, Q. Present an algorithm for re...

Q. Present an algorithm for reconstructing a logical ring after a process in the ring fails? Answer: Typically distributed systems utilize a coordinator process that performs

Explain hierarchical paging method, Hierarchical paging method Most mo...

Hierarchical paging method Most modern computer systems maintain a large logical-address space. In this situation the page table itself turns into excessively large. To remedy

How are file sharing and protection implemented?, How are file sharing and ...

How are file sharing and protection implemented? To implement file protection and sharing, the system ought to maintain more file and directory attributes than are needed on a

What do you mean by first fit, What do you mean by first fit? First fit...

What do you mean by first fit? First fit allocates the first hole that is big sufficient .Searching can either start at the starting of the set of holes or where the previous f

Unsafe state, discuss unsafe state in operating system

discuss unsafe state in operating system

Prevention of a data race in a parallelised program, Present your own fully...

Present your own fully documented and tested programming example illustrating the prevention of a data race in a parallelised program. This is an example where total number of p

Explain the entry-sequenced file organization, Entry-sequenced file organiz...

Entry-sequenced file organization The records in an entry-sequenced file are store up in the order they are written into the file. New records are for all time appended to

Single-level page table, Consider a computer system with a 32-bit logical a...

Consider a computer system with a 32-bit logical address and 4KB page size. The system supports up to 512MB of physical memory. How many entries are there in a conventional single-

Define the windowsnt, Define the WindowsNT WindowsNT provides a two-lev...

Define the WindowsNT WindowsNT provides a two-level approach to resource management: process and thread. The process is the uppermost level and contains most of the application

Ipc, explain in detail about ipc in linux

explain in detail about ipc in linux

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