the logical file system takes to create a file.
In order to create a new file, an application calls the logical file system that has all the information about the directory structures. First, the system assigns a new FCB(File Control Block). If the system has already generated some FCBs at file creation time, then it is allocated from a set of available FCBs. Finally, the system responsible for reading correct directory to the memory updates it with the new name of file and FCB and is written back to the disk.
Source: Gagne, G., Galvin, P., & Silberschatz, A. (2013). File-System Implementation. (9th ed., p. 545 - 547). John Wiley & Sons.
9. How is a hash table superior to a simple linear list structure? What issue must be handled by hash table implementation?
Linear list and hash table are two different kinds of directory allocation and implementation techniques which considerably affect the performance of a system. The hash table algorithm makes use of a linear list to store directories along with a hash data structure in order to speed up the
…show more content…
(2013). File-System Implementation. (9th ed., p. 552, 553). John Wiley & Sons.
10. What are the factors influencing the selection of a disk-scheduling algorithm?
The performance of selecting disk-scheduling algorithms significantly depends upon the type of requests being taken up. The quantity and complexity of requests can also determine the results of disk-scheduling algorithm. The requests for disk service can be affected by file-allocation method. An application that reads a contiguously allocated file will produce requests which are collaborated in the disk leading to limited head movement, whereas reading of an indexed file may create blocks that are spread across the disk thus resulting in more head movement. Some of the other important factors are location of directories and index blocks, rotational latency and operating system limitations like demand