Download as PPTX, PDF, TXT or read online from Scribd
Download as pptx, pdf, or txt
You are on page 1/ 16
DISK ORGANISATION
AND DISK SCHEDULING
WHAT IS DISK SCHEDULING?
• Disk management refers to the process of administering and managing computer storage devices, such as hard drives and solid-state drives. This process involves several key tasks, including: • Partitioning: Dividing a physical disk into smaller, manageable sections (partitions) that can be used separately for different purposes, such as operating systems, applications, or data storage. • Formatting: Preparing a partition for use by creating a file system, which organizes data on the disk and allows the operating system to read and write files. • Managing Volumes: Creating, deleting, resizing, and renaming disk volumes, which are logical storage units that can span multiple partitions. • Disk Health Monitoring: Checking the status of the disk drives to ensure they are functioning properly and identifying issues such as bad sectors or other failures. • Drive Letter Assignment: Assigning or changing the drive letters that the operating system uses to access different disk volumes. • Storage Optimization: Implementing practices like defragmentation (for HDDs) and TRIM (for SSDs) to improve performance and efficiency. • Backup and Recovery: Creating backup copies of data and managing recovery options in case of data loss. • Disk management tools are often included in operating systems, such as Windows Disk Management, which provides a graphical interface for performing these tasks. Proper disk management is crucial for system performance, data integrity, and efficient storage utilization. DISK SCHEDULING WHAT IS IT ?
• Disk scheduling is the method by which an operating system
decides the order in which disk I/O requests are processed. • This is crucial for optimizing performance, as it can significantly affect the speed and efficiency of data retrieval and storage operations. • Here are some important concepts related to disk scheduling KEY OBJECTIVES
• Minimize Seek Time: Reducing the time the disk's read/write
head spends moving to a specific location. • Maximize Throughput: Increasing the number of requests serviced in a given time period. • Fairness: Ensuring that all requests are handled in a reasonable timeframe without favoring any particular request excessively. COMMON DISK SCHEDULING ALGORITHMS • First-Come, First-Served (FCFS): Processes requests in the order they arrive. Simple but can lead to long wait times. • Shortest Seek Time First (SSTF): Selects the request closest to the current head position. Reduces average seek time but can cause starvation for far-off requests. • Scan (Elevator Algorithm): The disk arm moves in one direction, servicing requests until it reaches the end, then reverses direction. This method reduces seek time significantly. • C-Scan (Circular Scan): Similar to Scan, but when the arm reaches the end, it jumps back to the beginning without servicing any requests on the return trip, providing a more uniform wait time • C-LOOK Algorithm: The disk arm moves in one direction, servicing requests until it reaches the last request in that direction • LOOK Algorithm: The disk arm moves in one direction, servicing requests until it reaches the last request in that direction FIRST-COME, FIRST-SERVED (FCFS)
ADVANTAGES AND DISADVANTAGES • Advantages of FCFS • Every request gets a fair chance • No indefinite postponement • Disadvantages of FCFS • Does not try to optimize seek time • May not provide the best possible service SHORTEST SEEK TIME FIRST (SSTF)
ADVANTAGES AND DISADVANTAGES • Advantages of SSTF • The average Response Time decreases • Throughput increases • Disadvantages of SSTF • Overhead to calculate seek time in advance • Can cause Starvation for a request if it has a higher seek time as compared to incoming requests • The high variance of response time as SSTF favors only some requests SCAN (ELEVATOR ALGORITHM)
ADVANTAGES AND DISADVANTAGES • Advantages of SCAN Algorithm • High throughput • Low variance of response time • Average response time • Disadvantages of SCAN Algorithm • Long waiting time for requests for locations just visited by disk arm C-SCAN (CIRCULAR SCAN)
ADVANTAGES AND DISADVANTAGES • Advantages of C-SCAN • Uniform Waiting Time • Improved Response Time • Disadvantages of C-SCAN • Increased Seek Time for Requests • Inefficiency with Sparse Requests C-LOOK ALGORITHM
ADVANTAGES AND DISADVANTAGES • Advantages • Reduced Seek Time C-LOOK minimizes the distance the disk arm travels by servicing requests in a circular manner
• Uniform Wait Times
• Disadvantages • Starvation: Requests that are far from the current head position may experience longer wait times.
• Complexity: LOOK ALGORITHM
ADVANTAGES AND DISADVANTAGES • Advantages • Reduced Seek Time • Efficiency • Simplicity • Disadvantages • Starvation • Less Uniform Wait Times • Potential for Increased Latency SOURCES
• https://www.geeksforgeeks.org/disk-scheduling-algorithms/ • https://www.tutorialspoint.com/disk-scheduling-and-manage ment • https://www.studocu.com/in/document/manipal-university-jaip ur/bca-mathematics-1/advantages-and-disadvantages-of-vari ous-disk-scheduling-algorithms/91585744 • https://code.pieces.app/blog/intro-to-disk-scheduling-algorith ms THANK YOU
