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

Total physical memory and total virtual memory , A practical task specified...

A practical task specified in the Study Guide, Computer architecture, was to record your computer's specifications. Submit the data you recorded, which will contain the following d

Objective, what are the objective of operating system assignment

what are the objective of operating system assignment

Interpreters, Use and overview? Pure and impure interpreter?

Use and overview? Pure and impure interpreter?

Explain objectives of the file management system, Problem: a) Define a ...

Problem: a) Define a ‘file' and list the objectives of the file management system. b) List the ways in which programs access files and determine for what file types you woul

Write a note on deadlocks, Write a note on deadlocks. The proper defini...

Write a note on deadlocks. The proper definition of deadlock A set of processes is deadlocked if every process in the set is waiting for an event that only a proces

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 why sstf scheduling tends to favor middle cylinders, Explain why SS...

Explain why SSTF scheduling tends to favor middle cylinders over the innermost and outermost cylinders. The center of the disk is the location having the fewest average distanc

Explain deadlock prevention, Deadlock Prevention Prevention is the name...

Deadlock Prevention Prevention is the name given to method that guarantee that deadlocks can never happen for the reason that the way the system is structured. Since 4 conditio

Explain lru additional reference bits algorithm, Additional Reference bits...

Additional Reference bits algorithm Here we keep an 8-bit byte for every page in memory. At standard intervals the reference bit is shifted by the OS. If a shift register conta

Locks - mutexes, Locks (also known as mutexes, short for mutual exclusion l...

Locks (also known as mutexes, short for mutual exclusion locks) provide mutual exclusion to shared data inside a critical session. They are implemented by means of two atomic routi

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