Question 4 (File Systems) a. List one advantage and one disadvantage for each of the following file systems: i. Contiguous ii. Linked List ii. File Allocation Table iv. I-nodes b. Disk scheduling: i. Briefly explain the benefits of using disk scheduling algorithms for traditional rotational hard drives. ii. Consider a disk with 300 tracks, and the following sequence of requested tracks 50, 55, 74, 21, 55, 182, 145, 152, 23, 91, 158, 164, 189, 127, 20, 90, 288, 290. Calculate the number of tracks crossed for the algorithms below. Assume that the disk starts at position 72 and is moving towards position 300 (i.e., 0 to 300). Show your calculations. • Shortest seek time first • Circular scan algorithm (i.e. the arm does not move to the boundaries of the disk if not required), moving in the up position. c. Virtualisation and Cloud Computing: i. Briefly explain the main approaches to virtualisation ii. Briefly explain the role of virtualisation in Cloud Computing i. List the different layers in Cloud Computing.

Question 4 (File Systems) a. List one advantage and one disadvantage for each of the following file systems: i. Contiguous ii. Linked List ii. File Allocation Table iv. I-nodes b. Disk scheduling: i. Briefly explain the benefits of using disk scheduling algorithms for traditional rotational hard drives. ii. Consider a disk with 300 tracks, and the following sequence of requested tracks 50, 55, 74, 21, 55, 182, 145, 152, 23, 91, 158, 164, 189, 127, 20, 90, 288, 290. Calculate the number of tracks crossed for the algorithms below. Assume that the disk starts at position 72 and is moving towards position 300 (i.e., 0 to 300). Show your calculations. • Shortest seek time first • Circular scan algorithm (i.e. the arm does not move to the boundaries of the disk if not required), moving in the up position. c. Virtualisation and Cloud Computing: i. Briefly explain the main approaches to virtualisation ii. Briefly explain the role of virtualisation in Cloud Computing i. List the different layers in Cloud Computing.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Question A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, I indirect block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. The maximum possible file size in this file system will be ?
Compare between the different Input-Output control techniques: programmed I/O, interrupt, DMA, and Channel IO. There are 3 major methods that can be used for allocating disk space; one is the contiguous allocation method. Search for one of the other 2 methods (Linked Allocation and Indexed Allocation) and compare its performance with the performance of contiguous allocation methods.
Question#4: Consider a file system that uses inodes to represent files. Disk blocks are 8 KB in size, and a pointer to a disk block requires 4 bytes. This file system has 12 direct disk blocks, as well as single, double, and triple indirect disk blocks. What is the maximum size of a file that can be stored in this file system?
b. Disk scheduling: i. Briefly explain the benefits of using disk scheduling algorithms for traditional rotational hard drives. ii. Consider a disk with 300 tracks, and the following sequence of requested tracks 50, 55, 74, 21, 55, 182, 145, 152, 23, 91, 158, 164, 189, 127, 20, 90, 288, 290. Calculate the number of tracks crossed for the algorithms below. Assume that the disk starts at position 72 and is moving towards position 300 (i.e., 0 to 300). Show your calculations. • Shortest seek time first • Circular scan algorithm (i.e. the arm does not move to the boundaries of the disk if not required), moving in the up position.
Explain why peripherals are not connected directly to the system bus? Compare between the different Input-Output control techniques: programmed I/O, interrupt, DMA, and Channel IO. There are 3 major methods that can be used of allocating disk space; one is contiguous allocation method. Search for one of the other 2 methods (Linked Allocation and Indexed Allocation) and compare its performance with the performance of contiguous allocation method.
c. In a dynamic partitioning approach for memory management we could use a bitmap or a linked list to keep track of free and used memory. i. Briefly explain why linked lists are normally the preferred option. ii. Briefly explain a situation where bitmaps may be preferred. iii. Briefly explain the working of the best fit algorithm to allocate processes to memory when dynamic partitioning is used. iv. Does the best fit algorithm result in external fragmentation? v. Does the worst fit algorithm result in internal fragmentation?
c) Suppose a disk has 300 cylinders, numbered from 0 to 299. The drive is currently serving an I/O request at cylinder 111 and the disk head was previously serving a request at cylinder 99, and there is a queue of disk access requests for cylinders as below: 181, 199, 150, 160, 85, 178, 109, 75 Starting from the current head position, calculate the total head movements using the following disk scheduling algorithms.(i) SSTF scheduling (ii) SCAN scheduling
Explain and contrast among the different schemes for organizing a file system: - contiguous allocation - linked-list - linked-list using a table in memory - i-nodes. State with reason, which of the above schemes would be appropriate for implementing storage for a file that can vary between 4KB and 4MB during its lifetime.
A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is 4 bytes in size. Given a 100 × 106 bytes disk on which the file system is stored and data block size is 10³ bytes, the maximum size of a file that can be stored on this disk in units of 106bytes is
5) A hard disk (with sectors numbered 0 - 255) currently has its head positioned at sector 73. We have the following queue of disk requests: 98, 183, 37, 210, 12, 153, 122, 14, 124, 65, 91, 67, 243. Show the order and costs for reading the disk blocks using SSTF, SCAN, LOOK and C-SCAN.
17. A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is 1 ms and to read a block from the disk is 10 ms. Assume that the cost of checking whether a block exists in the
A. Suppose the following disk request sequence (track numbers) for a disk with 200 tracks is given: 95, 180, 34, 119, 11, 123, 62, 64. Assume that the initial position of the R/W head is on track 50. Which of the following algorithms is better in terms of the total head movements for each algorithm? - First Come -First Serve (FCFS) Shortest Seek Time First (SSTF) algorithm B. Suggest and discuss two disk scheduling algorithms for the systems that place a heavy load on the disk. Give the reason.