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

Several cpu-scheduling algorithms, Q. Several CPU-scheduling algorithms are...

Q. Several CPU-scheduling algorithms are parameterized for instance the RR algorithm requires a parameter to indicate the time slice. Multilevel response queues require parameters

Single-level page tables, As mentioned above, page tables, are lookup table...

As mentioned above, page tables, are lookup tables mapping a process' virtual pages to physical pages in RAM. How would one implement these page tables? The most straightforward

Describe swapping technique in unix systems, Describe swapping technique in...

Describe swapping technique in UNIX systems. Swapping is used to control memory contention among processes. If there is excessively much memory contention, processes are swappe

Elimination of common sub expression - code optimizatin, Elimination of com...

Elimination of common sub expression during code optimization An optimizing transformation is a rule for rewriting a section of a program to enhance its execution efficiency wi

What are the different directory structures, What are the different directo...

What are the different directory structures? Explain each type. There are five dissimilar directory structures: 1.      Single level directory 2.      Two level directory

Define lazy swapper, Define lazy swapper. Rather than swapping the enti...

Define lazy swapper. Rather than swapping the entire process into main memory, a lazy swapper is used. A lazy swapper never swaps a page into memory unless that page will be ne

Memory management, what is hashed page tables & explain of there work & fig...

what is hashed page tables & explain of there work & figure

Explain process scheduling, Explain Process scheduling Process scheduli...

Explain Process scheduling Process scheduling consists of the subsequent sub-functions: 1.      Scheduling : Selects the process to be implement next on the CPU 2.      D

Describe paging algorithm needs a reference bit, Q. Suppose that you want ...

Q. Suppose that you want to utilize a paging algorithm that requires a reference bit (such as second-chance replacement or working-set model) however the hardware does not provide

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