Scribd
Upload
6 views

Disk Management

Disk management is a crucial function of operating systems that organizes and optimizes data on secondary storage devices. It includes disk formatting, scheduling, and various algorithms like FCFS, SSTF, and SCAN to improve efficiency and reduce latency. The document outlines the benefits and types of disk scheduling, emphasizing the importance of minimizing seek time and maximizing throughput.

Uploaded by

makshay2805
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views

Disk Management

Disk management is a crucial function of operating systems that organizes and optimizes data on secondary storage devices. It includes disk formatting, scheduling, and various algorithms like FCFS, SSTF, and SCAN to improve efficiency and reduce latency. The document outlines the benefits and types of disk scheduling, emphasizing the importance of minimizing seek time and maximizing throughput.

Uploaded by

makshay2805
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

DISK MANAGEMENT

DISK MANAGEMENT IS ONE OF THE CRITICAL OPERATIONS CARRIED OUT BY


THE OPERATING SYSTEM. IT DEALS WITH ORGANIZING THE DATA STORED ON
THE SECONDARY STORAGE DEVICES WHICH INCLUDES THE HARD DISK
DRIVES AND THE SOLID-STATE DRIVES. IT ALSO CARRIES OUT THE FUNCTION
OF OPTIMIZING THE DATA AND MAKING SURE THAT THE DATA IS SAFE BY
IMPLEMENTING VARIOUS DISK MANAGEMENT TECHNIQUES.
STRUCTURE OF DISK

The disk structure refers to the


organization and layout of data
on a physical disk. It involves
several layers and components
that work together to store and
retrieve data efficiently Such as
hard disk drive(HDD),solid-
state(SSD),or flash drive.
DISK FORMAT
DISK FORMATTING IS A PROCESS DISK AND FLASH DRIVE.
TO CONFIGURE THE DATA-STORAGE DEVICES SUCH AS HARD-
DRIVE, FLOPPY .
1. NTFS (NEW TECHNOLOGY FILE SYSTEM): WINDOWS.
2. HFS (HIERARCHICAL FILE SYSTEM): MACOS.
3. EXT4 (FOURTH EXTENDED FILESYSTEM): LINUX .
4. FAT32 (FILE ALLOCATION TABLE 32): OLDER WINDOWS AND
EMBEDDED SYSTEMS.
DISK SCHEDULING
• DISK SCHEDULING IS A CRITICAL COMPONENT OF AN OPERATING SYSTEM
(OS) THAT MANAGES HOW DISK I/O (INPUT/OUTPUT) OPERATIONS ARE
PERFORMED. ITS PRIMARY GOAL IS TO OPTIMIZE DISK ACCESS, REDUCING
LATENCY AND INCREASING OVERALL SYSTEM EFFICIENCY.

• NEEDS OF DISK SCHEDULING:


1. MINIMIZE SEEK TIME: REDUCE TIME SPENT MOVING DISK HEADS.
2. MAXIMIZE THROUGHPUT: INCREASE NUMBER OF REQUESTS HANDLED PER
UNIT TIME.
3. ENSURE FAIRNESS: PREVENT STARVATION, ENSURE EQUAL ACCESS FOR
PROCESSES.
4. REDUCE OVERHEAD: MINIMIZE CPU OVERHEAD DUE TO DISK MANAGEMENT.
BENEFITS OF DISK SCHEDULING:
1.IMPROVED SYSTEM RESPONSIVENESS.
2. INCREASED DISK THROUGHPUT.
3. REDUCED AVERAGE WAIT TIME.
4. ENHANCED OVERALL SYSTEM PERFORMANCE.

TYPES OF DISK SCHEDULING:


1. NON-PREEMPTIVE SCHEDULING: REQUEST COMPLETES BEFORE NEXT
REQUEST IS CONSIDERED.
2. 2. PREEMPTIVE SCHEDULING: OS INTERRUPTS ONGOING OPERATION FOR
HIGHER-PRIORITY REQUEST.
1. FCFS DISK SCHEDULING ALGORITHM
• IT STANDS FOR 'FIRST-COME-FIRST-SERVE'. AS THE NAME SUGGESTS, THE REQUEST
THAT COMES FIRST WILL BE PROCESSED FIRST AND SO ON. THE REQUESTS COMING
TO THE DISK ARE ARRANGED IN A PROPER SEQUENCE AS THEY ARRIVE. SINCE EVERY
REQUEST IS PROCESSED IN THIS ALGORITHM, SO THERE IS NO CHANCE OF
'STARVATION’.

ADVANTAGES:
• IMPLEMENTATION IS EASY.
• NO CHANCE OF STARVATION.
• DISADVANTAGES:
• 'SEEK TIME' INCREASES.
• NOT SO EFFICIENT.
2. SSTF DISK SCHEDULING ALGORITHM
IT STANDS FOR 'SHORTEST SEEK TIME FIRST'. AS THE NAME SUGGESTS, IT
SEARCHES FOR THE REQUEST HAVING THE LEAST 'SEEK TIME' AND EXECUTES
THEM FIRST. THIS ALGORITHM HAS LESS 'SEEK TIME' AS COMPARED TO THE
FCFS ALGORITHM.

• ADVANTAGES:
• IN THIS ALGORITHM, DISK RESPONSE TIME IS LESS.
• MORE EFFICIENT THAN FCFS.

• DISADVANTAGES:
• LESS SPEED OF ALGORITHM EXECUTION.
• STARVATION CAN BE SEEN.
3. SCAN DISK SCHEDULING
ALGORITHM:
• IN THIS ALGORITHM, THE HEAD STARTS TO SCAN ALL THE REQUESTS IN A
DIRECTION AND REACHES THE END OF THE DISK. AFTER THAT, IT REVERSES ITS
DIRECTION AND STARTS TO SCAN AGAIN THE REQUESTS IN ITS PATH AND SERVES
THEM. DUE TO THIS FEATURE, THIS ALGORITHM IS ALSO KNOWN AS THE
"ELEVATOR ALGORITHM".

• ADVANTAGES:
• IMPLEMENTATION IS EASY.
• REQUESTS DO NOT HAVE TO WAIT IN A QUEUE.

• DISADVANTAGE:
• THE HEAD KEEPS GOING ON TO THE END EVEN IF THERE ARE NO REQUESTS IN THAT
DIRECTION.
4.C-SCAN DISK SCHEDULING ALGORITHM:
• IT STANDS FOR "CIRCULAR-SCAN". THIS ALGORITHM IS ALMOST THE SAME AS THE SCAN
DISK ALGORITHM BUT ONE THING THAT MAKES IT DIFFERENT IS THAT 'AFTER REACHING
THE ONE END AND REVERSING THE HEAD DIRECTION, IT STARTS TO COME BACK. THE
DISK ARM MOVES TOWARD THE END OF THE DISK AND SERVES THE REQUESTS COMING
INTO ITS PATH.
• AFTER REACHING THE END OF THE DISK IT REVERSES ITS DIRECTION AND AGAIN STARTS
TO MOVE TO THE OTHER END OF THE DISK BUT WHILE GOING BACK IT DOES NOT SERVE
ANY REQUESTS.

• ADVANTAGES:
• THE WAITING TIME IS UNIFORMLY DISTRIBUTED AMONG THE REQUESTS.
• RESPONSE TIME IS GOOD IN IT.
• DISADVANTAGES:
• THE TIME TAKEN BY THE DISK ARM TO LOCATE A SPOT IS INCREASED HERE.
• THE HEAD KEEPS GOING TO THE END OF THE DISK.
5.LOOK THE DISK SCHEDULING
ALGORITHM
• IN THIS ALGORITHM, THE DISK ARM MOVES TO THE 'LAST REQUEST' PRESENT AND
SERVICES THEM. AFTER REACHING THE LAST REQUESTS, IT REVERSES ITS
DIRECTION AND AGAIN COMES BACK TO THE STARTING POINT. IT DOES NOT GO TO
THE END OF THE DISK, IN SPITE, IT GOES TO THE END OF REQUESTS.

• ADVANTAGES:
• STARVATION DOES NOT OCCUR.
• SINCE THE HEAD DOES NOT GO TO THE END OF THE DISK, THE TIME IS NOT WASTED
HERE.

• DISADVANTAGE:
• THE ARM HAS TO BE CONSCIOUS TO FIND THE LAST REQUEST.
6. C-LOOK DISK SCHEDULING
ALGORITHM:
• THE C-LOOK ALGORITHM IS ALMOST THE SAME AS THE LOOK ALGORITHM. THE ONLY
DIFFERENCE IS THAT AFTER REACHING THE END REQUESTS, IT REVERSES THE
DIRECTION OF THE HEAD AND STARTS MOVING TO THE INITIAL POSITION. BUT IN
MOVING BACK, IT DOES NOT SERVE ANY REQUESTS.

• ADVANTAGES:
• THE WAITING TIME IS DECREASED.
• IF THERE ARE NO REQUESTS TILL THE END, IT REVERSES THE HEAD DIRECTION
IMMEDIATELY.
• STARVATION DOES NOT OCCUR.
• THE TIME TAKEN BY THE DISK ARM TO FIND THE DESIRED SPOT IS LESS.

• DISADVANTAGE:
• THE ARM HAS TO BE CONSCIOUS ABOUT FINDING THE LAST REQUEST.
THANK YOU !!

You might also like