Explain file allocation using i nodes, Operating System

Assignment Help:

File allocation using I nodes.

This method is used to decrease the size of the table in the above method. Every file will have an I-node list. Allow a file have 15 pointers after that the first 12 pointers can be used to point to the blocks directly. The next three pointers are able to be used to point to indirect blocks. The first two point toward single indirect blocks. The single indirect block is an index box containing not data other than the addresses of blocks that contain data and the last pointer points to a double indirect block which contains the addresses of blocks that contain pointers to the actual data blocks.

1528_File allocation using I nodes.png


Related Discussions:- Explain file allocation using i nodes

What are the use of job queue, What are the use of job queues, ready queues...

What are the use of job queues, ready queues and device queues? As a process enters a system they are put in to a job queue. These queues having of all jobs in the system. The

Operating system services, explain about oprating system services and topic...

explain about oprating system services and topics briefly

CPU, TURNAROUND TIME

TURNAROUND TIME

Operation management, trace the historical evolution of the operations mana...

trace the historical evolution of the operations managent from themainly rural agricultural era of the artisans to the present day industrial revolution, high technoligical advance

Explain how indefinite blocking or starvation occur, explain how indefinit...

explain how indefinite blocking or starvation occurs..

Define the features to implement top down parsing, Define the features are ...

Define the features are needed to implement top down parsing                      Source string marker, Prediction making mechanism and Matching and Backtracking mechanism

Explain the architecting for processes, Explain the Architecting For Proces...

Explain the Architecting For Processes Processes are very important to the server application developer, as they may be used to increase responsiveness, deduction time, and tur

What is thrashing, What is thrashing? It is a method in virtual memory...

What is thrashing? It is a method in virtual memory schemes when the processor spends most of its time swapping pages, rather than implementing instructions. This is because o

Memory management, example of first fit best fit and worst fit

example of first fit best fit and worst fit

Least-recently used, LRU evicts the page which was last accessed the farthe...

LRU evicts the page which was last accessed the farthest into the past of any page resident in physical memory, i.e. the least-recently used page. LRU approximates OPT when the rec

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