Disk scheduling algorithms


Question 1: Describe in detail different schemes for defining the logical structure of a directory.

Question 2: Describe how mounting and unmounting can be done in the UNIX file systems.

Question 3: Some systems automatically open a file when it is referenced for the first time and close the file when the job terminates. Describe the merits and demerits of this scheme as compared with the more traditional one where the user has to open and close the file explicitly.

Question 4: What are the implications of supporting UNIX consistency semantics for shared access for those files which are stored on remote file systems?

Question 5: Make a comparison of the given disk scheduling algorithms:

a) Shortest Service Time First (SSTF).
b) SCAN.
c) Last In First Out (LIFO).

Solution Preview :

Prepared by a verified Expert
Operating System: Disk scheduling algorithms
Reference No:- TGS03299

Now Priced at $40 (50% Discount)

Recommended (97%)

Rated (4.9/5)