The document discusses the architecture of the Linux operating system including hardware, kernel, shell and applications layers. It also analyzes the working of the inode file system for Linux, describing how inodes store metadata and pointers to data blocks for files.
The document discusses the architecture of the Linux operating system including hardware, kernel, shell and applications layers. It also analyzes the working of the inode file system for Linux, describing how inodes store metadata and pointers to data blocks for files.
The document discusses the architecture of the Linux operating system including hardware, kernel, shell and applications layers. It also analyzes the working of the inode file system for Linux, describing how inodes store metadata and pointers to data blocks for files.
The document discusses the architecture of the Linux operating system including hardware, kernel, shell and applications layers. It also analyzes the working of the inode file system for Linux, describing how inodes store metadata and pointers to data blocks for files.
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1of 8
NAME:-HRITAM MONDAL
STREAM :-INFORMATION TECHNOLOGY
UNIVERSITY ROLL:-16500219047
SUBJECT:-OPERATING SYSTEM
SEMESTER:- 5TH SEM
ASSINGMENT:-1
1.Provide a discussion on linux system
architecture(with suitable diagram) ANS:- Linux System Architecture :- An operating system is an interface between user and the computer hardware. A number of software applications run on operating system to manage the hardware resources on a computer.
The Linux system basically works on 4 layers.
See the below diagram, shows the layers of of the Linux system architecture. Hardware:− Hardware consists of all physical devices attached to the System. For example:- Hard disk drive, RAM, Motherboard, CPU etc.
Kernel:− Kernel is the core component for any
(Linux) operating system which directly interacts with the hardware. Shell:− Shell is the interface which takes input from Users and sends instructions to the Kernel, Also takes the output from Kernel and send the result back to output shell.
Applications:− These are the utility programs
which runs on Shell. This can be any application like Your web browser, media player, text editor etc.
2.Analyse the working of I-node file system for
Linux Operating System.(with suitable Diagram). Ans : Inode in Operating System:- In Unix based operating system each file is indexed by an Inode. Inode are special disk blocks they are created when the file system is created. The number of Inode limits the total number of files/directories that can be stored in the file system. The Inode contains the following information:- 14 Bytes 2 Bytes
File name 1 i-node 1
File name 2 i-node 2 Directory name i-node 3 Numeric UID of the owner. Numeric GUID of the owner. Size of the file. File type: regular,directory,device etc… Date and Time of Last modification of the file data. Date and Time of Last access of file data. Date and Time of Last change of the I-node. Administrative information (permissions, timestamps, etc). A number of direct blocks (typically 12) that contains to the first 12 blocks of the files. A single indirect pointer that points to a disk block which in turn is used as an index block, if the file is too big to be indexed entirely by the direct blocks. A double indirect pointer that points to a disk block which is a collection of pointers to disk blocks which are index blocks, used if the file is too big to be indexed by the direct and single indirect blocks. A triple indirect pointer that points to an index block of index blocks of index blocks.
Inode Total Size:-
- Number of disk block address possible to store in
1 disk block = (Disk Block Size / Disk Block Address).
- Small files need only the direct blocks, so there is
little waste in space or extra disk reads in those cases. Medium sized files may use indirect blocks. Only large files make use of the double or triple indirect blocks, and that is reasonable since those files are large anyway. The disk is now broken into two different types of blocks: Inode and Data Blocks.
- There must be some way to determine where the
Inodes are, and to keep track of free Inodes and disk blocks. This is done by a Superblock. Superblock is located at a fixed position in the file system. The Superblock is usually replicated on the disk to avoid catastrophic failure in case of corruption of the main Superblock.
- Index allocation schemes suffer from some of the
same performance problems. As does linked allocation. For example, the index blocks an be cached in memory, but the data blocks may be spread all over a partition. - Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.