Inode explanation

Sep 2, 20106 likes7,279 views

The document discusses inodes and how they describe files in a file system by storing metadata such as ownership, times, size and permissions. It also discusses how data blocks store the actual contents of files. Inodes can directly reference up to 12 data blocks, and additionally store addresses of indirect, double indirect, and triple indirect blocks to reference additional data blocks and allow file sizes up to 64.375 TB in size, though there is some overhead for storing the block addresses.

inodes explained
Tutorial 3 - CSCI212

by: Roman Tarnavski

Data Blocks

A ﬁle system contains ‘blocks’ which hold
data called inodes. A inode describes a
single ﬁle in the ﬁle system. Typical
information described includes, ownership,
modiﬁcation times, size and permissions. We
call this information meta-data.
Source: CSCI212 Lecture Notes
by: Daniel Safﬁoti

Data Blocks

Data Blocks

The remainder of the ﬁle system (larger proportion)
contains data blocks. These store the contents of
ﬁles.

Source: CSCI212 Lecture Notes
by: Daniel Safﬁoti

Source: CSCI212 Lecture Notes
by: Daniel Safﬁoti

Your typical inode
Mode
Permissions
Size
Timestamps

Direct Blocks

Single
Double
Triple

Direct
Data Block 1
Data Block 2

.
.
Direct .
Direct Data Block 3
Direct
Direct
Direct
Direct
Direct
Direct
Direct
Direct
Direct
Direct
Single
Double
Triple

Single
Direct Data Block 1
Direct Data Block 2
Direct
Direct
Direct Data Block 2048

Direct
Direct Address 1

Direct Address 2

Direct .
.
Direct .
Direct Address 2048

Direct
Single
Double
Triple

Double
Direct Data Block 1

Direct Data Block 2

Direct
Direct Address 1
Direct Address 2 Data Block 2048

Direct .
.
Direct Address 1 .
Direct Address 2 Address 2048
Direct . Data Block 1
.
Direct . Data Block 2
Direct Address 2048
Direct
Address 1
Single Data Block 2048
Address 2
Double
.
Triple .
.
Address 2048

Triple
Data Block 1
Data Block 2

Direct
Direct Address 1
Address 2 Data Block 2048
Direct
Direct .
.
Direct Address 1 Address 1 .

Direct Address 2 Address 2 Address 2048

Direct . . Data Block 1
. .
Direct
. . Data Block 2

Direct Address 2048 Address 2048

Direct Address 1
Direct Address 2 Data Block 2048

Direct .
.
Single Address 1 .
Double Address 2 Address 2048
Triple .
. Data Block 1
.
Data Block 2
Address 2048

Address 1
Address 2 Data Block 2048

.
Address 1 .
.
Address 2
Address 2048
.
.
.
Address 2048

Data Block 1
Data Block 2

.
.
Direct . Data Block 1
Direct Data Block 3 Data Block 2
Direct
Direct
Direct Data Block 2048

Direct Data Block 1

Direct Address 1 Data Block 2
Address 1
Direct Address 2 Data Block 2048
Address 2
Direct .
. .
Direct . .
.
Direct Address 2048 Data Block 1
Address 2048
Direct Data Block 2

Single
Double Address 1
Triple Data Block 2048
Address 2
Address 1
. Data Block 1
Address 2 .
. Data Block 2
.
. Address 2048
.
Address 2048 Address 1
Address 2 Data Block 2048

.
.
Address 1 Address 1 .
Address 2 Address 2 Address 2048

. . Data Block 1
. .
. . Data Block 2
Address 2048 Address 2048

Address 1
Address 2 Data Block 2048

.
.
Address 1 .
Address 2 Address 2048

.
. Data Block 1
.
Data Block 2
Address 2048

Address 1
Address 2 Data Block 2048

.
Address 1 .
.
Address 2
Address 2048
.
.
.
Address 2048

Maximum Size of Direct
Blocks
Where did the 2048 Addresses come from?

Maximum Size of Direct
Blocks
Where did the 2048 Addresses come from?

Assuming 32-bit architectures

Maximum Size of Direct
Blocks
Where did the 2048 Addresses come from?

Assuming 32-bit architectures

32-bit = 4 bytes (32 / 8)

Maximum Size of Direct
Blocks
Where did the 2048 Addresses come from?

Assuming 32-bit architectures

32-bit = 4 bytes (32 / 8)

Thus 8192 [block size] /4 [bytes per addressable block]

Questions

What is the maximum possible ﬁle size that
can be represented via direct data blocks?

Maximum Size of Direct
Blocks

block size
blocks

= 8192 x 12 = 98,304 bytes = 96Kb

Maximum FileSize using
First-Indirect Linking

Maximum FileSize using
First-Indirect Linking

Direct: 12 blocks @ 8192 bytes (12 x 8192)

Maximum FileSize using
First-Indirect Linking

Direct: 12 blocks @ 8192 bytes (12 x 8192)

=96Kb

Maximum FileSize using
First-Indirect Linking

Direct: 12 blocks @ 8192 bytes (12 x 8192)

=96Kb

Indirect: 2048 @ 8192 (2048 x 8192) =
16,384 Kb = 16,480 [Inclusive of Direct] = 16.09Mb

Maximum using Double
Indirect

16,875,520 x 2048 addressable blocks

= 34,561,064,960 bytes

= 32,960 Mbytes

Maximum Filesize
[direct + single + double + triple]

2048 x 32.1875Gb

= 64.375 Tb

Overhead
Wish to store: 8,437,760 bytes

8437760 / 8192 [bytes per block]

= 1030 blocks x 4 bytes [per address]

BUT

Overhead
Wish to store: 8,437,760 bytes

8437760 / 8192 [bytes per block]

= 1030 blocks x 4 bytes [per address]

BUT

12 Blocks are stored directly

Overhead
Wish to store: 8,437,760 bytes

8437760 / 8192 [bytes per block]

= 1030 blocks x 4 bytes [per address]

BUT

12 Blocks are stored directly

Hence we only have 1018 blocks

This document summarizes key aspects of the Linux file system. It discusses the virtual file system switch which provides system calls for file management. It describes different types of files like regular files, directories, and device files. Inodes are used to store metadata about files separately. The structure and features of Unix file systems are also outlined, including boot blocks, superblocks, inode blocks, and data blocks. Details are provided about mounting and unmounting file systems, the superblock structure, inode structure, and file system calls.

Cours système d’exploitation partie3manou2008

Unit 2 pptanna_grady

This document appears to be a contact sheet from a photography student containing 10 black and white photos exploring different elements of design. The photos are labeled with their subjects and the design element they relate to, such as "Analogous Colors", "Line", "Shape", "Space", and "Texture". The contact sheet shows a student's black and white photos taken in 2015 for a class project focusing on various elements of design in photography.

PhD Consortium ADBIS presetation.Giuseppe Ricci

- The document discusses mathematical methods for tensor factorization applied to recommender systems. - Tensor factorization techniques can model additional contextual information that standard matrix factorization cannot capture. This allows the recommendations to be more personalized. - Two main tensor factorization methods discussed are Higher-Order Singular Value Decomposition (HOSVD) and PARAllel FACtor analysis (PARAFAC). - HOSVD generalizes singular value decomposition to tensors. PARAFAC decomposes a tensor into a sum of rank-one tensors. Both aim to discover latent factors between user data.

Unix filesSunil Rm

Operating Systems (printouts)wx672

Unix ch03-03(2)Vijay Chandraker

The document discusses the Linux kernel buffer cache. It describes the structure of buffer headers and the buffer pool. It outlines 5 scenarios for retrieving a buffer, including if the block is found in the hash queue, a free buffer is available, or if a delayed write buffer needs to be written first. It also covers reading and writing blocks to disk using functions like bread(), breada(), bwrite(), and brelse(). The advantages of the buffer cache in reducing disk access and ensuring integrity are presented.

Unix File Systemstudent(MCA)

The document discusses the UNIX file system. It describes how the file system is organized in a tree structure that can be arbitrarily deep. Files include regular files, directories, device files, UNIX domain sockets, and named pipes. File permissions are managed through permission bits and special flags like setuid and setgid. Inodes store metadata about files like timestamps, ownership, and size. The file system is mounted to map directories to storage resources and unmounted to detach them.

Unix file systems 2 in unix internal systems senthilamul

The document discusses how UNIX organizes and accesses files on disk. It describes the file system structure, including inodes which contain metadata about each file, directories which map filenames to inodes, and block allocation which determines how file data is physically stored across disk blocks. It also covers subdirectories, hard and soft links, and comparisons of different file allocation strategies like contiguous, block, and extent-based allocation.

Unix training session 1Anil Kumar Kapil,PMP®

SO-08 Sistemas de ArquivosEduardo Nicola F. Zagari

NTFS and InodeAmit Seal Ami

This presentation discusses NTFS and inodes. It provides an overview of NTFS, including its architecture, metadata files like the master file table, directories, files, security features, and clusters. It also describes Unix file systems and how they use inodes to store metadata about each file, such as the file size, owner, and pointers to data blocks. Inodes are allocated from a free inode list and contain information about the file as well as pointers to data blocks.

The linux file system structureTeja Bheemanapally

The Linux file system structure contains a root directory (/) that contains subdirectories for essential system files and programs. Some key subdirectories are /bin and /sbin for essential binaries, /etc for configuration files, /dev for device files, /proc for process information, /var for variable and log files, /tmp for temporary files, /usr for user-installed programs, /home for user home directories, /boot for boot loader files, and /lib for library files supporting binaries. Additional subdirectories include /opt for optional software, /mnt and /media for temporarily mounting file systems, and /srv for server-specific files.

Mca ii os u-5 unix linux file systemRai University

Linux file systemBurhan Abbasi

Linux uses a unified, hierarchical file system to organize and store data on disk partitions. It places all partitions under the root directory by mounting them at specific points. The file system is case sensitive. The Linux kernel manages hardware resources and the file system, while users interact through commands interpreted by the shell. Journaling file systems like ext3 and ReiserFS were developed to improve robustness over ext2 by logging file system changes to reduce the need for integrity checks after crashes. Ext4 further improved on this with features like larger maximum file sizes and delayed allocation.

실무로 배우는 시스템 성능 최적화 - 4부. 프로세스 이해하기Minchul Jung

4. linux file systemsMarian Marinov

The document discusses Linux file systems. It begins with an overview of file system architecture, including inodes, dentries, superblocks, and how data is never erased but overwritten. It then covers various local file systems like Ext2, Ext3, Ext4, ReiserFS, and XFS. Next it discusses log-structured and pseudo file systems. It also covers network file systems like NFS and CIFS. Finally it summarizes cluster, distributed, and Hadoop file systems. The document provides a technical overview of Linux file system types, structures, features and capabilities.

실무로 배우는 시스템 성능 최적화 8부 - 1,2,3장Sunggon Song

실무로배우는시스템성능최적화 Ch1HyeonSeok Choi

System callsBernard Senam

This presentation discusses system calls and provides an overview of their key aspects: System calls provide an interface between processes and the operating system. They allow programs to request services from the OS like reading/writing files. There are different methods of passing parameters to the OS, such as via registers, parameter blocks, or pushing to the stack. System calls fall into categories including process control, file management, device management, information maintenance, and communication. An example is given of how system calls would be used in a program to copy data between two files.

Introduction to System CallsVandana Salve

Chapter 11 - File System ImplementationWayne Jones Jnr

File System and File allocation tablesshashikant pabari

A file system is used to control how data is stored and retrieved. A filesystem is the methods and data structures that an operating system uses to keep track of files on a disk or partition; that is, the way the files are organized on the disk. A file allocation table (FAT) is a table that an operating system maintains on a hard disk that provides a map of the clusters (the basic units of logical storage on a hard disk) that a file has been stored in. File Allocation Table (FAT) is a computer file system architecture and a family of industry-standard file systems utilizing it. The FAT file system is a legacy file system which is simple and robust. Today, FAT file systems are still commonly found on floppy disks, USB sticks, flash and other solid-state memory cards and modules, and many portable and embedded devices.

File managementMohd Arif

The document discusses file management and directories. It describes block management strategies like contiguous allocation and linked lists. It discusses reading and writing byte streams which involves packing and unpacking blocks of data. It also covers supporting high-level file abstractions like structured sequential files and indexed sequential files. Finally, it discusses directories and their structures like hierarchical and graph-based organizations.

Operating Systems - Processor ManagementDamian T. Gordon

The document discusses how operating systems use processes and scheduling to allow multiple programs to run simultaneously. It explains that a process is the running instance of a program and contains the program counter, registers, memory allocation, and other state information. The operating system uses process scheduling and a process control block (PCB) for each process to track status, allocate CPU time, and handle interrupts and blocking for I/O. It outlines common scheduling algorithms like first-come first-served, shortest job next, priority, and round robin.

Paging and segmentationPiyush Rochwani

This document summarizes and compares paging and segmentation, two common memory management techniques. Paging divides physical memory into fixed-size frames and logical memory into same-sized pages. It maps pages to frames using a page table. Segmentation divides logical memory into variable-sized segments and uses a segment table to map segment numbers to physical addresses. Paging avoids external fragmentation but can cause internal fragmentation, while segmentation avoids internal fragmentation but can cause external fragmentation. Both approaches separate logical and physical address spaces but represent different models of how a process views memory.

SAP Modernization: Maximizing the Value of Your SAP S/4HANA Migration.pdfPrecisely

Heap, Types of Heap, Insertion and DeletionJaydeep Kale

Technology Trends in 2025: AI and Big Data AnalyticsInData Labs

At InData Labs, we have been keeping an ear to the ground, looking out for AI-enabled digital transformation trends coming our way in 2025. Our report will provide a look into the technology landscape of the future, including: -Artificial Intelligence Market Overview -Strategies for AI Adoption in 2025 -Anticipated drivers of AI adoption and transformative technologies -Benefits of AI and Big data for your business -Tips on how to prepare your business for innovation -AI and data privacy: Strategies for securing data privacy in AI models, etc. Download your free copy nowand implement the key findings to improve your business.

More Related Content

Viewers also liked (19)

Unix File Systemstudent(MCA)

Unix file systems 2 in unix internal systems senthilamul

Unix training session 1Anil Kumar Kapil,PMP®

SO-08 Sistemas de ArquivosEduardo Nicola F. Zagari

NTFS and InodeAmit Seal Ami

The linux file system structureTeja Bheemanapally

Mca ii os u-5 unix linux file systemRai University

Linux file systemBurhan Abbasi

실무로 배우는 시스템 성능 최적화 - 4부. 프로세스 이해하기Minchul Jung

4. linux file systemsMarian Marinov

실무로 배우는 시스템 성능 최적화 8부 - 1,2,3장Sunggon Song

실무로배우는시스템성능최적화 Ch1HyeonSeok Choi

System callsBernard Senam

Introduction to System CallsVandana Salve

Chapter 11 - File System ImplementationWayne Jones Jnr

File System and File allocation tablesshashikant pabari

File managementMohd Arif

Operating Systems - Processor ManagementDamian T. Gordon

Paging and segmentationPiyush Rochwani

Unix File Systemstudent(MCA)

Unix file systems 2 in unix internal systems senthilamul

Unix training session 1Anil Kumar Kapil,PMP®

SO-08 Sistemas de ArquivosEduardo Nicola F. Zagari

NTFS and InodeAmit Seal Ami

The linux file system structureTeja Bheemanapally

Mca ii os u-5 unix linux file systemRai University

Linux file systemBurhan Abbasi

실무로 배우는 시스템 성능 최적화 - 4부. 프로세스 이해하기Minchul Jung

4. linux file systemsMarian Marinov

실무로 배우는 시스템 성능 최적화 8부 - 1,2,3장Sunggon Song

실무로배우는시스템성능최적화 Ch1HyeonSeok Choi

System callsBernard Senam

Introduction to System CallsVandana Salve

Chapter 11 - File System ImplementationWayne Jones Jnr

File System and File allocation tablesshashikant pabari

File managementMohd Arif

Operating Systems - Processor ManagementDamian T. Gordon

Paging and segmentationPiyush Rochwani

Recently uploaded (20)

SAP Modernization: Maximizing the Value of Your SAP S/4HANA Migration.pdfPrecisely

Heap, Types of Heap, Insertion and DeletionJaydeep Kale

Technology Trends in 2025: AI and Big Data AnalyticsInData Labs

Drupalcamp Finland – Measuring Front-end Energy ConsumptionExove

TrustArc Webinar: Consumer Expectations vs Corporate Realities on Data Broker...TrustArc

Most consumers believe they’re making informed decisions about their personal data—adjusting privacy settings, blocking trackers, and opting out where they can. However, our new research reveals that while awareness is high, taking meaningful action is still lacking. On the corporate side, many organizations report strong policies for managing third-party data and consumer consent yet fall short when it comes to consistency, accountability and transparency. This session will explore the research findings from TrustArc’s Privacy Pulse Survey, examining consumer attitudes toward personal data collection and practical suggestions for corporate practices around purchasing third-party data. Attendees will learn: - Consumer awareness around data brokers and what consumers are doing to limit data collection - How businesses assess third-party vendors and their consent management operations - Where business preparedness needs improvement - What these trends mean for the future of privacy governance and public trust This discussion is essential for privacy, risk, and compliance professionals who want to ground their strategies in current data and prepare for what’s next in the privacy landscape.

Manifest Pre-Seed Update | A Humanoid OEM Deeptech In Francechb3

Linux Professional Institute LPIC-1 Exam.pdfRHCSA Guru

Cybersecurity Identity and Access Solutions using Azure ADVICTOR MAESTRE RAMIREZ

Quantum Computing Quick Research Guide by Arthur MorganArthur Morgan

This is a Quick Research Guide (QRG). QRGs include the following: - A brief, high-level overview of the QRG topic. - A milestone timeline for the QRG topic. - Links to various free online resource materials to provide a deeper dive into the QRG topic. - Conclusion and a recommendation for at least two books available in the SJPL system on the QRG topic. QRGs planned for the series: - Artificial Intelligence QRG - Quantum Computing QRG - Big Data Analytics QRG - Spacecraft Guidance, Navigation & Control QRG (coming 2026) - UK Home Computing & The Birth of ARM QRG (coming 2027) Any questions or comments? - Please contact Arthur Morgan at [email protected]. 100% human made.

AI and Data Privacy in 2025: Global TrendsInData Labs

In this infographic, we explore how businesses can implement effective governance frameworks to address AI data privacy. Understanding it is crucial for developing effective strategies that ensure compliance, safeguard customer trust, and leverage AI responsibly. Equip yourself with insights that can drive informed decision-making and position your organization for success in the future of data privacy. This infographic contains: -AI and data privacy: Key findings -Statistics on AI data privacy in the today’s world -Tips on how to overcome data privacy challenges -Benefits of AI data security investments. Keep up-to-date on how AI is reshaping privacy standards and what this entails for both individuals and organizations.

Transcript: #StandardsGoals for 2025: Standards & certification roundup - Tec...BookNet Canada

Book industry standards are evolving rapidly. In the first part of this session, we’ll share an overview of key developments from 2024 and the early months of 2025. Then, BookNet’s resident standards expert, Tom Richardson, and CEO, Lauren Stewart, have a forward-looking conversation about what’s next. Link to recording, presentation slides, and accompanying resource: https://bnctechforum.ca/sessions/standardsgoals-for-2025-standards-certification-roundup/ Presented by BookNet Canada on May 6, 2025 with support from the Department of Canadian Heritage.

Complete Guide to Advanced Logistics Management Software in Riyadh.pdfSoftware Company

Explore the benefits and features of advanced logistics management software for businesses in Riyadh. This guide delves into the latest technologies, from real-time tracking and route optimization to warehouse management and inventory control, helping businesses streamline their logistics operations and reduce costs. Learn how implementing the right software solution can enhance efficiency, improve customer satisfaction, and provide a competitive edge in the growing logistics sector of Riyadh.

Special Meetup Edition - TDX Bengaluru Meetup #52.pptxshyamraj55

Procurement Insights Cost To Value Guide.pptxJon Hansen

Splunk Security Update | Public Sector Summit Germany 2025Splunk

Rusty Waters: Elevating Lakehouses Beyond Sparkcarlyakerly1

Spark is a powerhouse for large datasets, but when it comes to smaller data workloads, its overhead can sometimes slow things down. What if you could achieve high performance and efficiency without the need for Spark? At S&P Global Commodity Insights, having a complete view of global energy and commodities markets enables customers to make data-driven decisions with confidence and create long-term, sustainable value. 🌍 Explore delta-rs + CDC and how these open-source innovations power lightweight, high-performance data applications beyond Spark! 🚀

Mobile App Development Company in Saudi ArabiaSteve Jonas

EmizenTech is a globally recognized software development company, proudly serving businesses since 2013. With over 11+ years of industry experience and a team of 200+ skilled professionals, we have successfully delivered 1200+ projects across various sectors. As a leading Mobile App Development Company In Saudi Arabia we offer end-to-end solutions for iOS, Android, and cross-platform applications. Our apps are known for their user-friendly interfaces, scalability, high performance, and strong security features. We tailor each mobile application to meet the unique needs of different industries, ensuring a seamless user experience. EmizenTech is committed to turning your vision into a powerful digital product that drives growth, innovation, and long-term success in the competitive mobile landscape of Saudi Arabia.

2025-05-Q4-2024-Investor-Presentation.pptxSamuele Fogagnolo

Noah Loul Shares 5 Steps to Implement AI Agents for Maximum Business Efficien...Noah Loul

Artificial intelligence is changing how businesses operate. Companies are using AI agents to automate tasks, reduce time spent on repetitive work, and focus more on high-value activities. Noah Loul, an AI strategist and entrepreneur, has helped dozens of companies streamline their operations using smart automation. He believes AI agents aren't just tools—they're workers that take on repeatable tasks so your human team can focus on what matters. If you want to reduce time waste and increase output, AI agents are the next move.

IEDM 2024 Tutorial2_Advances in CMOS Technologies and Future Directions for C...organizerofv

SAP Modernization: Maximizing the Value of Your SAP S/4HANA Migration.pdfPrecisely

Heap, Types of Heap, Insertion and DeletionJaydeep Kale

Technology Trends in 2025: AI and Big Data AnalyticsInData Labs

Drupalcamp Finland – Measuring Front-end Energy ConsumptionExove

TrustArc Webinar: Consumer Expectations vs Corporate Realities on Data Broker...TrustArc

Manifest Pre-Seed Update | A Humanoid OEM Deeptech In Francechb3

Linux Professional Institute LPIC-1 Exam.pdfRHCSA Guru

Cybersecurity Identity and Access Solutions using Azure ADVICTOR MAESTRE RAMIREZ

Quantum Computing Quick Research Guide by Arthur MorganArthur Morgan

AI and Data Privacy in 2025: Global TrendsInData Labs

Transcript: #StandardsGoals for 2025: Standards & certification roundup - Tec...BookNet Canada

Complete Guide to Advanced Logistics Management Software in Riyadh.pdfSoftware Company

Special Meetup Edition - TDX Bengaluru Meetup #52.pptxshyamraj55

Procurement Insights Cost To Value Guide.pptxJon Hansen

Splunk Security Update | Public Sector Summit Germany 2025Splunk

Rusty Waters: Elevating Lakehouses Beyond Sparkcarlyakerly1

Mobile App Development Company in Saudi ArabiaSteve Jonas

2025-05-Q4-2024-Investor-Presentation.pptxSamuele Fogagnolo

Noah Loul Shares 5 Steps to Implement AI Agents for Maximum Business Efficien...Noah Loul

IEDM 2024 Tutorial2_Advances in CMOS Technologies and Future Directions for C...organizerofv

Inode explanation

1. inodes explained Tutorial 3 - CSCI212 by: Roman Tarnavski

2. Data Blocks A file system contains ‘blocks’ which hold data called inodes. A inode describes a single file in the file system. Typical information described includes, ownership, modification times, size and permissions. We call this information meta-data. Source: CSCI212 Lecture Notes by: Daniel Saffioti

3. Data Blocks Data Blocks The remainder of the file system (larger proportion) contains data blocks. These store the contents of files. Source: CSCI212 Lecture Notes by: Daniel Saffioti

4. Source: CSCI212 Lecture Notes by: Daniel Safﬁoti

5. Your typical inode Mode Permissions Size Timestamps Direct Blocks Single Double Triple

6. Direct Data Block 1 Data Block 2 . . Direct . Direct Data Block 3 Direct Direct Direct Direct Direct Direct Direct Direct Direct Direct Single Double Triple

7. Single Direct Data Block 1 Direct Data Block 2 Direct Direct Direct Data Block 2048 Direct Direct Address 1 Direct Address 2 Direct . . Direct . Direct Address 2048 Direct Single Double Triple

8. Double Direct Data Block 1 Direct Data Block 2 Direct Direct Address 1 Direct Address 2 Data Block 2048 Direct . . Direct Address 1 . Direct Address 2 Address 2048 Direct . Data Block 1 . Direct . Data Block 2 Direct Address 2048 Direct Address 1 Single Data Block 2048 Address 2 Double . Triple . . Address 2048

9. Triple Data Block 1 Data Block 2 Direct Direct Address 1 Address 2 Data Block 2048 Direct Direct . . Direct Address 1 Address 1 . Direct Address 2 Address 2 Address 2048 Direct . . Data Block 1 . . Direct . . Data Block 2 Direct Address 2048 Address 2048 Direct Address 1 Direct Address 2 Data Block 2048 Direct . . Single Address 1 . Double Address 2 Address 2048 Triple . . Data Block 1 . Data Block 2 Address 2048 Address 1 Address 2 Data Block 2048 . Address 1 . . Address 2 Address 2048 . . . Address 2048

10. All Together?

11. Data Block 1 Data Block 2 . . Direct . Data Block 1 Direct Data Block 3 Data Block 2 Direct Direct Direct Data Block 2048 Direct Data Block 1 Direct Address 1 Data Block 2 Address 1 Direct Address 2 Data Block 2048 Address 2 Direct . . . Direct . . . Direct Address 2048 Data Block 1 Address 2048 Direct Data Block 2 Single Double Address 1 Triple Data Block 2048 Address 2 Address 1 . Data Block 1 Address 2 . . Data Block 2 . . Address 2048 . Address 2048 Address 1 Address 2 Data Block 2048 . . Address 1 Address 1 . Address 2 Address 2 Address 2048 . . Data Block 1 . . . . Data Block 2 Address 2048 Address 2048 Address 1 Address 2 Data Block 2048 . . Address 1 . Address 2 Address 2048 . . Data Block 1 . Data Block 2 Address 2048 Address 1 Address 2 Data Block 2048 . Address 1 . . Address 2 Address 2048 . . . Address 2048

12. Maximum Size of Direct Blocks

13. Maximum Size of Direct Blocks Where did the 2048 Addresses come from?

14. Maximum Size of Direct Blocks Where did the 2048 Addresses come from? Assuming 32-bit architectures

15. Maximum Size of Direct Blocks Where did the 2048 Addresses come from? Assuming 32-bit architectures 32-bit = 4 bytes (32 / 8)

16. Maximum Size of Direct Blocks Where did the 2048 Addresses come from? Assuming 32-bit architectures 32-bit = 4 bytes (32 / 8) Thus 8192 [block size] /4 [bytes per addressable block]

17. Maximum Size of Direct Blocks Where did the 2048 Addresses come from? Assuming 32-bit architectures 32-bit = 4 bytes (32 / 8) Thus 8192 [block size] /4 [bytes per addressable block] = 2048 Addressable Blocks

18. Questions What is the maximum possible ﬁle size that can be represented via direct data blocks?

19. Maximum Size of Direct Blocks block size blocks = 8192 x 12 = 98,304 bytes = 96Kb

20. Maximum FileSize using First-Indirect Linking

21. Maximum FileSize using First-Indirect Linking Direct: 12 blocks @ 8192 bytes (12 x 8192)

22. Maximum FileSize using First-Indirect Linking Direct: 12 blocks @ 8192 bytes (12 x 8192) =96Kb

23. Maximum FileSize using First-Indirect Linking Direct: 12 blocks @ 8192 bytes (12 x 8192) =96Kb Indirect: 2048 @ 8192 (2048 x 8192) = 16,384 Kb = 16,480 [Inclusive of Direct] = 16.09Mb

24. Maximum using Double Indirect 16,875,520 x 2048 addressable blocks = 34,561,064,960 bytes = 32,960 Mbytes

25. Maximum Filesize [direct + single + double + triple] 2048 x 32.1875Gb = 64.375 Tb

26. Overhead

27. Overhead Wish to store: 8,437,760 bytes

28. Overhead Wish to store: 8,437,760 bytes 8437760 / 8192 [bytes per block] = 1030 blocks x 4 bytes [per address] BUT

29. Overhead Wish to store: 8,437,760 bytes 8437760 / 8192 [bytes per block] = 1030 blocks x 4 bytes [per address] BUT 12 Blocks are stored directly

30. Overhead Wish to store: 8,437,760 bytes 8437760 / 8192 [bytes per block] = 1030 blocks x 4 bytes [per address] BUT 12 Blocks are stored directly Hence we only have 1018 blocks

31. Overhead Wish to store: 8,437,760 bytes 8437760 / 8192 [bytes per block] = 1030 blocks x 4 bytes [per address] BUT 12 Blocks are stored directly Hence we only have 1018 blocks 1018 x 4 bytes = 4072 bytes = 3.98Kbytes

Inode explanation

Recommended

More Related Content

Viewers also liked (19)

Recently uploaded (20)

Inode explanation