8:29 PM Tue Jan 30 Done 1 of 1 nuoodle.norwich.edu CS 270 Spring 2024 Assignment 2...
Fantastic news! We've Found the answer you've been seeking!
Question:
Transcribed Image Text:
8:29 PM Tue Jan 30 Done 1 of 1 nuoodle.norwich.edu CS 270 Spring 2024 Assignment 2 1. Suppose you have a memory system using fixed-size partitions with all partitions the same size, 224 bytes and a total main memory size of 22 bytes. In the process table there is a pointer to a partition for each resident process. How many bits are needed for this pointer? 2. A system has 232 bytes of physical memory and uses paging. Each page is 22 bytes and there are 26 pages total in the virtual address space. (Recall that not all of the physical memory is available for processes.) (a) How many bits are in a virtual address? (b) How many bytes are in a frame? (c) How many bits in the real address specify the start address of the frame? Due: 31 Jan 2024 3. A computer uses virtual memory, using a new solid state drive (SSD) as space for paging. Refer to slides 14 and 15 from Monday's class (22 Jan). In the case presented there, the hard disk drive (HDD) required 25 ms to read in a page, and a rate of 1 pf per 1000 references introduced a 250 slow down. (a) If the SSD offers a time of only 60 s, what is the slow down in performance caused by 1 pf per 1000 references? (you are not concerned with dirty vs. clean pages: assume pages are always clean). (b) What is the maximum rate of page faults you can accept if you want no more than a 10% slow- down in execution using virtual memory? 4. When a running process experiences a page fault, the frame to hold the missing page can only come from those frames allocated to that process, not from frames used by any other process. The memory system chooses which frame to use using a simple first-in first-out technique. That is, the first time it must choose a frame to use to hold a page being loaded to resolve a page fault, it chooses the first frame it loaded originally for that process. The second page fault then uses the now 'oldest' frame (the second one that had been loaded originally), and so on: the first frame (originally) loaded becomes the first frame out' (i.e., to be reused). Each page fault causes only the one missing page to be loaded. A note about symbols used for times: s for seconds, Now suppose a program is executing a straight, linear sequence of instructions that is 100 Kbytes long. That is, from the firs instruction, every next instruction is executed once, so the program moves linearly through its 100 Kbytes (with no loops or branches). This process is allocated 20 frames, each 4 Kbytes big, when put into memory. How many page faults will there be to completely execute this sequence of instructions? [BONUS problem:] Finally, suppose the 100 Kbyte block of instructions is a loop that repeats in- finitely. How many page faults are there on the second iteration of the loop? ms for milliseconds (one thousandth of a second, 10- s), us for microseconds, (one millionth of a second, 10-6 s), ns for nanoseconds. (one billionth of a second, 10- s). 1 @ 19% 0 8:29 PM Tue Jan 30 Done 1 of 1 nuoodle.norwich.edu CS 270 Spring 2024 Assignment 2 1. Suppose you have a memory system using fixed-size partitions with all partitions the same size, 224 bytes and a total main memory size of 22 bytes. In the process table there is a pointer to a partition for each resident process. How many bits are needed for this pointer? 2. A system has 232 bytes of physical memory and uses paging. Each page is 22 bytes and there are 26 pages total in the virtual address space. (Recall that not all of the physical memory is available for processes.) (a) How many bits are in a virtual address? (b) How many bytes are in a frame? (c) How many bits in the real address specify the start address of the frame? Due: 31 Jan 2024 3. A computer uses virtual memory, using a new solid state drive (SSD) as space for paging. Refer to slides 14 and 15 from Monday's class (22 Jan). In the case presented there, the hard disk drive (HDD) required 25 ms to read in a page, and a rate of 1 pf per 1000 references introduced a 250 slow down. (a) If the SSD offers a time of only 60 s, what is the slow down in performance caused by 1 pf per 1000 references? (you are not concerned with dirty vs. clean pages: assume pages are always clean). (b) What is the maximum rate of page faults you can accept if you want no more than a 10% slow- down in execution using virtual memory? 4. When a running process experiences a page fault, the frame to hold the missing page can only come from those frames allocated to that process, not from frames used by any other process. The memory system chooses which frame to use using a simple first-in first-out technique. That is, the first time it must choose a frame to use to hold a page being loaded to resolve a page fault, it chooses the first frame it loaded originally for that process. The second page fault then uses the now 'oldest' frame (the second one that had been loaded originally), and so on: the first frame (originally) loaded becomes the first frame out' (i.e., to be reused). Each page fault causes only the one missing page to be loaded. A note about symbols used for times: s for seconds, Now suppose a program is executing a straight, linear sequence of instructions that is 100 Kbytes long. That is, from the firs instruction, every next instruction is executed once, so the program moves linearly through its 100 Kbytes (with no loops or branches). This process is allocated 20 frames, each 4 Kbytes big, when put into memory. How many page faults will there be to completely execute this sequence of instructions? [BONUS problem:] Finally, suppose the 100 Kbyte block of instructions is a loop that repeats in- finitely. How many page faults are there on the second iteration of the loop? ms for milliseconds (one thousandth of a second, 10- s), us for microseconds, (one millionth of a second, 10-6 s), ns for nanoseconds. (one billionth of a second, 10- s). 1 @ 19% 0
Expert Answer:
Related Book For
Posted Date:
Students also viewed these algorithms questions
-
ttth Suppose that the sequence of bags {Bn | n N} is recursively enumerated by the computable function e(n, x) = fn(x), [7 marks] Hence prove that the set of all recursive bags cannot be recursively...
-
Python and most Python libraries are free to download or use, though many users use Python through a paid service. Paid services help IT organizations manage the risks associated with the use of...
-
The general term that refers to the tendency of a parcel of air to either remain in place or change its initial position is ________. a. adiabatic b. conditional instability c. stasis d. stability
-
Leisa Reed and Randell Thurman lived together in Spring City, Tennessee. Randell and his father, Leroy, formed a cattle-raising operation and opened a bank account in the name of L&R Farm. Within a...
-
Hotel Consolidators purchases blocks of hotel rooms at a discount and resells them on the Internet. In 2003, the company developed a proprietary system to help attract Internet users to its website,...
-
What factors are needed in determining the size of a sample?
-
Using annual, semiannual, and quarterly compounding periods for each of the following, (1) calculate the future value if $5,000 is deposited initially, and (2) determine the effective annual rate...
-
5. The night-shift workers in three of Super Bo's specialty stores stock about 500 products in about 3 hours. How does this rate compare with the stocking done in the other 97 stores in the chain,...
-
Glen Pool Club, Inc., has an installment loan outstanding with a current balance of $150.000. The company makes monthly installments of $1,543, which include interest computed at an annual rate of 6...
-
Discuss at least three different perspectives, or views, about the poor and the causes of poverty. How might these views inform policy responses? How do Smith and Ignatieff contribute to the...
-
Indicate whether each of the following statements is true or false by writing T or F in the answer column. Arbitration clauses in employment contracts are never enforceable.
-
What does ROE measure?
-
How does the federal income tax system treat dividends received by a corporation versus those received by an individual?
-
What is the difference in the tax treatment of interest and dividends paid by a corporation? Does this factor favor debt or equity financing?
-
Explain how the extended, or modified, DuPont equation can be used to reveal the basic determinants of ROE.
-
Find the number of subsets of the set {10, 9, 8, 7, 6, 5} having 3 elements. (Hint: Combination)
-
Define cultural intelligence. Cite the books or journal articles you found in Capella's library. Explain why cultural intelligence is important for HR practitioners and other organizational managers.
-
You have sold one 45-strike put with 180 days to expiration. Compute and graph the 1-day holding period profit if you delta- and gamma-hedge this position using the stock and a 40-strike call with...
-
There are four debt issues with different priorities, each promising $30 at maturity. a. Compute the yield on each debt issue assuming that all four mature in 1 year, 2 years, 5 years, or 10 years....
-
In the previous problem we saw that a ratio spread can have zero initial premium. Can a bull spread or bear spread have zero initial premium? A butterfly spread? Why or why not? Discuss.
-
Define thermal efficiency of a heat engine.
-
What are the limitations of Carnot cycle?
-
Differentiate between a heat pump and a refrigerator.
Study smarter with the SolutionInn App