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 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

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

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?
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 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?
Consider a file system that uses contiguous allocation method. For a disk consists of 100 data blocks, each block is 4KB. What is the maximum and minimum number of files of size 15KB can it save? Find the number of files the disk able to support using (1) link allocation and (2) index allocation, assuming the address is 32 bit.
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 ?
Suppose that there is a file system with blocks of 512 bytes in size. For each inode, there are 20 direct blocks, 2 singly-indirect blocks, and 2 doubly-indirect blocks. The size of a pointer is 4 bytes. Calculate the maximum possible size of a file in bytes. Show your work.
2. Assume that each block has B = 1000 Bytes, and the buffer pool has m=210+1=1001 frames. What is the exact size of the largest file external memory sorting can sort using 3 passes (pass 0 pass 2; pass 2 produces only 1 run)? What is the scale of the above file, 1KB, 1MB, 1GB, 1TB, or 1PB?
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?
Consider a file F whose data is spread over 1000 physical disk blocks on the disk. Assume the size of a logical block is equal the size of a physical block. Given a logical block number X, what is the maximum number of disk accesses that you would need to retrieve the physical block that corresponds to X? Assume the file control block of F and the directory entry that contains information about F are cached in the main memory.
Suppose that a disk unit has the following parameter: block size B = 1200 bytes Consider a STUDENT file with the following fields: NUMBER, 10 bytes; • LASTNAME, 20 bytes; FIRSTNAME, 20 bytes; BIRTHDATE, 10 bytes; The STUDENT file has r=10000 STUDENT records, fixed-length format, and unspanned blocking. Calculate the following values for the STUDENT file: (a) Calculate the record size R (b) Calculate the blocking factor bfr (c) Calculate the number of disk blocks b
Contrast the performance of the three techniques for allocating disk blocks (contiguous, linked, and indexed) for both sequential and random file access.
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