Consider a file system on a disk that has both logical and physical block sizes of 512 bytes. Assume that the information about each file is already in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer the following question: If we are currently at logical block 10 (the last block accessed was block 10) and want to access logical block 4, how many physical blocks must be read from the disk?

Consider a file system on a disk that has both logical and physical block sizes of 512 bytes. Assume that the information about each file is already in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer the following question: If we are currently at logical block 10 (the last block accessed was block 10) and want to access logical block 4, how many physical blocks must be read from the disk?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 12P

See similar textbooks

Similar questions

Suppose the head of a moving head disk with 200 tracks numbered 0-199 is currently servinga request at track 143. It has just finished a request at track 125. If the queue of requests iskept in the FIFO order,86,147,85,177,94,150,102,175,130What is the total head movement to satisfy these requests for the following disk schedulingalgorithms? First Come First Served Shortest Seek Time First SCAN
a) The physical size of a given file is 16384 bytes in a magnetic disk, with each cluster consisting of 8 sectors, each of which having a fixed size of 512 bytes. How many sectors and clusters will the above file take? What will the logical size of the above file be if there is a slack space of 2930 B? How can we make sure that there will be no residues from previously deleted files? discuss b) Suppose that a car has passed the checkpoint, A, towards the checkpoint, B, with an average speed of 150 Km/hr and reached B at 10:35:40. 1- Express the recorded time at point B in seconds. 2- If the car has reached the next checkpoint, B at 10:35:40, what will be time that this car has passed the checkpoint, A, if the distance between A and B is 100 Km? The time should be in hrs-min-sec format. Show all your calculation steps.
Consider a file whose size varies between 2KB and 8MB during its lifetime. It is required that the file be accessible in the face of corrupted disk blocks. State, with reasons, whether or not the following block allocation schemes will be appropriate for implementing the file storage: contiguous, linked and table/indexed
Consider a disk with a sector size of 512 bytes, 1,000 tracks per plater, 100 sectors per track, 10 tracks per cylinder and a block size of 2,048 bytes including 48 bytes for non-data overhead. Suppose that a file containing 1,000,000 records of 100 bytes each is to be stored on such a disk and that no record can span two blocks. a) How many records fit onto a block? b) How many cylinders are required to store the entire file?
Suppose a disk has N cylinders, numbered from 0 to P. At some time, the disk arm is at cylinder X, and there is a queue of disk access requests for cylinders R1, R2, R3, R4. Explain which Disk scheduling algorithm should be the best to be used between the following a) FIFO b) CSCAN c) SSTF d) FSCAN e) CLOOK N: B • • Choose any acceptable numeric numbers for N, P, X, R1, R2, R3 and R4 • • Plagiarism Will be penalized heavily
Suggest an efficient scheme for maintaining a per-user protection scheme.That is, the system maintains one directory per user, and that directory lists allthe objects to which the user is allowed access. Your design should address theneeds of a system with 1000 users, of whom no more than 20 are active at anytime. Each user has an average of 200 permitted objects; there are 50,000 totalobjects in the system
UNIX treats file directories in the same fashion as files; that is, both are defined by the same type of data structure, called an inode. As with files, directories include a nine-bit protection strong. If care is not taken, this can create access control problems. For example, consider a file with protection mode 644(octal) contained in a directory with protection mode 730. How might the file be compromised in this case? What can we do to stop this vulnerability without changing the protection mode 730 for the directory?
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 133, and the previous request was at cylinder 115. The queue of pending requests, in FIFO order, is:76,1460, 903, 1764, 938, 1499, 1012,1740,120. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? (a) FCFS (b).SSTF (c) SCAN (d) LOOK (e) C-SCAN (f) C-LOOK
Consider a server that has 20 users, each of which has 50 files in their home directory. Each user should have read and write access to every file in their own home directory. a.If this policy were expressed as a DAC matrix, how many non-empty entries (cells) would the matrix need to have? b. Express this policy as a single if-then sentence, such as might be used in an Attribute-based Access Control (ABAC) system. The sentence should be English, but imagine that it could be translated into a logical constraint.
Consider a file system that uses indexed allocation with a maximum of one index node per file. Suppose the index node occupies 4096 bytes, that each block pointer occupies 4 bytes. Ignore the metadata associated with the file that is usually contained in the index node. How large should a block be (in bytes) so that this scheme is able to completely access files on a 1 GB file system?
Suppose a file system is based on the indexed allocation strategy for managingblocks. Assume each file has a directory entry giving the file name, first index block,and the length of the file. The first index block points in turn to 128 file blocks andto the next index block. Suppose that each file block contains 4KB of data and theuser is currently reading the 441K-th byte of a file. If the user’s next operation is toread the 1201k-th byte of the same file, how many physical disk I/O operations mustbe performed in order to read that byte? Explain your answer in detail usingdiagrams as appropriate.
Consider a file system that uses indexed file allocation. Disk block size is 1K-byte, and a file pointer is 64 bits (8-bytes). If we assume that an i-node just holds 2 direct entries and 4 single indirect entries, what is the maximum size of a file the system can allow? List the steps that lead to your conclusion.