Scribd
Upload
60 views5 pages

Lec 31

This document discusses queuing theory and the UNIX Fast File System (FFS). It covers producer-server models, throughput vs response time, and concepts from queuing theory like arrival rate, service time, and utilization. It also summarizes some issues with the old UNIX file system like distributed file blocks degrading performance. FFS aims to improve this by keeping inodes close to data blocks, using larger block sizes, and preferably storing files of a directory in the same cylinder group.

Uploaded by

jyothibellary4233
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
60 views5 pages

Lec 31

This document discusses queuing theory and the UNIX Fast File System (FFS). It covers producer-server models, throughput vs response time, and concepts from queuing theory like arrival rate, service time, and utilization. It also summarizes some issues with the old UNIX file system like distributed file blocks degrading performance. FFS aims to improve this by keeping inodes close to data blocks, using larger block sizes, and preferably storing files of a directory in the same cylinder group.

Uploaded by

jyothibellary4233
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

LECTURE - 31

Lecture Outline

Some queuing theory

UNIX Fast File System



Scribe for today?
I/O Performance

Producer-Server Model

Throughput vs. Response Time

Response time and think time

Queuing theory
 Arrival rate, service time, utilization
 Little's law
 Squared coefficient of variance
 Average residual time
 Response time and utilization
 M/G/1 and M/M/1 models
UNIX's Old File System

Superblock

Free-list

Directory: special file – has pointer to file's
inode

Inodes have:
 Direct points, singly indirect pointers, doubly
indirect, and triply indirect pointers

Problem: file's blocks get distributed all over
the disk, deteriorating performance

Also, block size: 512 bytes (poor performance)
UNIX Fast File System (FFS)

Cylinder groups are defined

Inodes are close to data blocks

Block size: 4096 bytes
 But, poor disk usage (close to 50% wasted)

Idea: fragment blocks
 But only last block of file is allowed to be
fragmented

All files of a directory are preferably in same
cylinder group

Other enhancements: long file names, file
locking, symbolic links, rename, quota

You might also like