Compaction Given the following memory status below, compute how much does it cost to compact holes together with the following compaction strategies if 1 kbyte, of movement costs 50 centavos. OS OS OS P1 P3 P2 P1 P2 400k 700k 1200k 1300k 1800k 2100k 2400k 2800k 3100k P1 P2 P3 P4 a) Cost=P P3 P4 b) Cost=P P4 OS P1 P2 c) Cost = P P3 P4 OS P2 P1 P4 P3 d) Cost=P

Compaction Given the following memory status below, compute how much does it cost to compact holes together with the following compaction strategies if 1 kbyte, of movement costs 50 centavos. OS OS OS P1 P3 P2 P1 P2 400k 700k 1200k 1300k 1800k 2100k 2400k 2800k 3100k P1 P2 P3 P4 a) Cost=P P3 P4 b) Cost=P P4 OS P1 P2 c) Cost = P P3 P4 OS P2 P1 P4 P3 d) Cost=P

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider a disk drive specifications. with the following 16 surfaces, 512 tracks/surface, 512 sectors/ track, 1 KB/sector, rotation speed 3000 rpm. The disk is operated in cycle stealing mode whereby whenever one byte word is ready it is sent to memory; similarly, for writing, the disk interface reads a 4 byte word from the memory in each DMA cycle. Memory cycle time is 40 nsec. The maximum percentage of time that the CPU gets blocked during DMA operation?
during DMA operation is Memory cycle time is 40 nsec. The maximum word is ready it is sent to memory; similarly, word from the memory in each DMA cycle. J000 pim. The disk is operated in cycle stealing mode whereby whenever one 4 byte 512 sectors/track, 1 KBscctor, rotation speed percentage of time the CPU gets blocked for writing. the disk interface reads a 4 byte disk drive with the following specifications: surfaces, Consider 512 tracks/surface, The disk is operated in cycle rpem
A common unit of measure for failure rates of electronic components is the Failure unIT (FIT), expressed as a rate of failures per billion device hours. Another well known but less used measure is mean time between failures (MTBF), which is the av- erage time of operation of a particular component until it fails. Consider a 1 MB memory of a 16-bit microprocessor with 256K X 1 L `AMs. Calculate its MTBF as- suming 2000 FITS for each DRAM.
A memory management system uses TLB (Translation lookaside buffer) to enhance memory access time. If time to access a TLB is x nanoseconds and time to access main memory is y nanoseconds (y >>x), determine effective memory access time when TLB hit ratio is p ( 0 < p <1)? Also, determine the effective memory access time when x = 1 nanosec, y=20 nanosec, and p = 0.7.
Consider the free memory layout shown below (the blocks are ordered from top to bottom). To the right, draw to the what the free memory layouts would be after satisfying requests for (in order) memory blocks of size 55K, 210K, 381K, and 395K. Draw one memory layout for the best-fit algorithm, and one for first-fit. 500K 300K 200K 300K
To be able to make some predictions of disk performance, it is useful to have a model of storage allocation. Suppose that the disk is viewed as a linear address space of N» 1 sectors, consisting of a run of data blocks, then a hole, then another run of data blocks, and so on. If empirical measurements show that the probability distributions for data and hole lengths are the same, with the chance of either being i sectors as 2-¹, what is the expected number of holes on the disk?
Computer A has an overall CPI of 1.3 and can be run at a clock rate of 600MHz. Computer B has a CPI of 2.5 and can be run at a clock rate of 750 MHz. We have a particular program we wish to run. When compiled for computer A, this program has exactly 100,000 instructions. How many instructions would the program need to have when compiled for Computer B, in order for the two computers to have exactly the same execution time for this program? Please explain how to solve
- Consider 7 memory partitions of size 470 KB, 400 KB, 600 KB, 200 KB, 500 KB, 300 KB and 250 KB. These partitions need to be allocated to 6 processes of sizes 190 KB, 491 KB, 468 KB and 210 KB, 357 KB and 587 KB in that order. Perform the allocation of processes using- First Fit Algorithm Best Fit Algorithm Worst Fit Algorithm 470 KB 400 KB 600 KB 200 KB 500 KB 300 KB 250 KB (190 KL) P1 491 KB P2 468 KB P3 (210 KB P4 357 KB) P5 587 KL P6
As we have seen, a potential drawback of SSDs is that the underlying flash memory can wear out. For example, for the SSD in (Figure 1), Intel guarantees about 128 petabytes (128×1015128×1015 bytes) of writes before the drive wears out. Given this assumption, estimate the lifetime (in years) of this SSD for the following workloads: Worst case for sequential writes: The SSD is written to continuously at a rate of 470 MB/sMB/s (the average sequential write throughput of the device). Express your answer as an integer. Worst case for random writes: The SSD is written to continuously at a rate of 303 MB/sMB/s (the average random write throughput of the device). Express your answer as an integer. Average case: The SSD is written to at a rate of 20 GB/dayGB/day (the average daily write rate assumed by some computer manufacturers in their mobile computer workload simulations). Express your answer as an integer.
The Pentium 4 Prescott processor, released in 2004, had a clock rate of 3.6 GHz and voltage of 1.25 V. Assume that, on average, it consumed 10 W of static power and 90 W of dynamic power. If the total dissipated power is to be reduced by 10%, how much should the voltage be reduced to maintain the same leakage current? Note: power is defined as the product of voltage and current
A computer uses virtual memory, and a new solid-state drive (SSD) as space for paging. Refer to the last ppt file. In the case presented there, the hard disk drive (HDD) required 25 ms to read in a page, and a rate of 1 page fault per 1000 references introduced a 250 slowdown. If the SSD offers a time of only 80 µs, what is the slowdown in performance caused by 1 pf per 1000 references (you are not concerned with dirty vs. clean pages). What is the maximum rate of page faults you can accept if you want no more than a 5% slowdown in execution using virtual memory? Know your metric prefixes and symbols for time: s for seconds, ms for milliseconds, µs for microseconds, ns for nanoseconds.
Q1: Consider two computers, P1 and P2, of the same instruction set (ISA). We have a program of 7.5x10° instructions and we want to run this program on P1 and P2. The P1 computer is a 5 GHz machine with CPI of 0.8. The P2 computer is a 6 GHz machine with CPI of 1.2. Which computer is faster?