Reference no: EM13165820
suppose a file system stores every file under a i-node similar to (but may not be the same as) the Unix V7 File System. The i-node contains 15 addresses, each address has 32 bits (4 bytes).
If an i-node contains 12 direct addresses, 1 single-indirect address, 1 double-indirect address, and 1 triple-indirect address. Suppose every disk block is 4KB. What is the largest file size, in GB, that the file system can store? Round your answer to the nearest integer.
(Note: 1GB = 1024MB; 1MB = 1024KB; 1KB = 1024 bytes)
Continuing from above. Sam is a sound engineer and requires random accesses to large numbers of audio files ranging from 4MB to 16MB in size. You are designing a variation of the file system with different numbers of single, double and triple indirect addresses to minimize Sam's random file access time, while using the same block size and supporting at least the same largest file size. You would --
In both cases above, try to make the change amount minimal. For example, if increasing the number of a particular type of addresses by N could minimize the access time, then don't increase it by N+1.
Continuing from above. Using 4KB block size but potentially any number of direct, single-indirect, double-indirect, and triple-indirect addresses (as long as the total is 15) per i-node, what is the largest possible file size, in GB, that the file system can support? Round your answer to the nearest integer.
(Note: 1GB = 1024MB; 1MB = 1024KB; 1KB = 1024 bytes)
|
Give their telephone numbers using one or more letters
: People sometimes give their telephone numbers using one or more letters. write a program that accespts a 10 digit telephone number that may contain one or more letters. display the corresponding number using numerlas. the numbers and letters are a..
|
|
The state of the waiting thread to blocked
: Which IPC mechanism does not change the state of the waiting thread to blocked?
|
|
Function alter with two parms passed by reference
: Write a function alter with two parms passed by reference: x and y. alter changes the value of x to x+y and changes the value of y to x*y. Write a main function to read in two integers, print the two integers, call the function alter using the two..
|
|
Explores the performance consequences
: This problem explores the performance consequences of having only a single level of cache in a modern processor with 40 ns DRAM column access time and a clock period of 400 ps (clock frequency 2.5 GHz). You are given the following data: A particul..
|
|
A file system stores every file under a i-node
: suppose a file system stores every file under a i-node similar to (but may not be the same as) the Unix V7 File System. The i-node contains 15 addresses, each address has 32 bits (4 bytes).
|
|
Value referenced by the pointer.
: Add 10 to the value referenced by pointer switch.Add 4 to the address stored in pointer switch.Subtract 5 from the value referenced by the pointer.
|
|
Create an application for disney''s cottages
: Create an application for Disney's Cottages, a weekend getaway resort that rents cottages and boats to use on the local lake
|
|
You assign each int with a particular id
: You assign each int with a particular ID.Array (4, 5, 6, 5, 4, 6) ID (1, 2, 3, 4, 5, 6)
|
|
A machine has a 32-bit address space and an 4-kb page
: A machine has a 32-bit address space and an 4-KB page. Suppose a simple OS just boot up on the machine, running a single process. The process uses 2 memory pages for the text and data memory (combined) near the lowest virtual address, and 1 memory pa..
|