Consider a swapping system in which memory consists of the holes as shown in Fig.A. Note that A to I represent processes in memory, and H1 to Hs are eight holes. Process P1. P2. .. Ps are generated sequentially, and their sizes are as follows: i Pi requests 8 KB. i Pz requests 10KB. 111. P3 requests 13KB. iv. Pa requests 5KB V. Ps requests 4KB Answer the following questions: Hị_ A 4KB H: | 10KB H3 в 5KB H4 | 16KB Hs D 8KB He E 9KB Hs 13КВ G 15КВ Fig. A (a) When using First-fit algorithm, (1) which hole will P1 will be loaded into? (2) which hole will P5 will be loaded into? (b) When using Best-fit algorithm, (3) which hole will P1 will be loaded into? (4) which hole will P5 will be loaded into? (c) When using worst-fit algorithm, (5) which hole will P1 will be loaded into? (6) which hole will P4 will be loaded into? (7) which hole will P5 will be loaded into? (d) When using Next-fit algorithm, (8) which hole will P2 will be loaded into? (9) which hole will P3 will be loaded into? (10) which hole will P4 will be loaded into?

Consider a swapping system in which memory consists of the holes as shown in Fig.A. Note that A to I represent processes in memory, and H1 to Hs are eight holes. Process P1. P2. .. Ps are generated sequentially, and their sizes are as follows: i Pi requests 8 KB. i Pz requests 10KB. 111. P3 requests 13KB. iv. Pa requests 5KB V. Ps requests 4KB Answer the following questions: Hị_ A 4KB H: | 10KB H3 в 5KB H4 | 16KB Hs D 8KB He E 9KB Hs 13КВ G 15КВ Fig. A (a) When using First-fit algorithm, (1) which hole will P1 will be loaded into? (2) which hole will P5 will be loaded into? (b) When using Best-fit algorithm, (3) which hole will P1 will be loaded into? (4) which hole will P5 will be loaded into? (c) When using worst-fit algorithm, (5) which hole will P1 will be loaded into? (6) which hole will P4 will be loaded into? (7) which hole will P5 will be loaded into? (d) When using Next-fit algorithm, (8) which hole will P2 will be loaded into? (9) which hole will P3 will be loaded into? (10) which hole will P4 will be loaded into?

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

Suppose that a machine has 42-bit virtual addresses and 32-bit physical addresses.{a} How much RAM can the machine support (each byte of RAM must be addressable)?{b} What is the largest virtual address space that can be supported for a process?{c} If pages are 2 KB, how many entries must be in a single-level page table?{d} If pages are 2 KB and we have a two-level page table where the first level is indexed by 15-bits, then how many entries does the first-level page table have?{e} With the same setup as part {d}, how many entries are in each second-level page table?{f} What is the advantage of using a two-level page table over single-level page table?
Q3 Consider a swapping system in which main memory contains the following hole sizes in memory order: 10K, 4K, 20K, 18K, 7K, 9K, 12K, and 15K. Which hole is taken for successive segment requests of (a) 12K, (b) 10K and (c) 9K for Next-Fit? Assume the last allocated hole is 20K.
Consider a program that performs the following steps repeatedly: Use the CPU for 4 milliseconds. By issuing an I/O, use the disk for 14 milliseconds. Use the CPU for 10 milliseconds. By issuing an I/O, use network for 18 milliseconds. Assume that each step depends on data obtained from the previous step (e.g., step 3 cannot start before step 2 is completed. Also assume that each resource (CPU or disk or network) can be used by one process at a time. Answer the following questions: (a) Draw 3 time-line diagrams (horizontal axis is the time line; one line for each resource. That is, 3 parallel rows in the resulted figure.) that illustrate the utilizations of the CPU, disk, and network over the execution of two iterations of the program above by a single process. (b) What are the average utilizations of the CPU, disk and network over these two iterations? (Please note that the “total time” should be the same across all resources, from the entire system starts until all work on any…
Suppose that a computer has a processor with two L1 caches, one for instructions and one for data, and an L2 cache. Let τ be the access time for the two L1 caches. Themiss penalties are approximately 15τ for transferring a block from L2 to L1, and 100τ fortransferring a block from the main memory to L2. For the purpose of this problem, assumethat the hit rates are the same for instructions and data and that the hit rates in the L1 andL2 caches are 0.96 and 0.80, respectively.(a) What fraction of accesses miss in both the L1 and L2 caches, thus requiring accessto the main memory?(b) What is the average access time as seen by the processor?(c) Consider the following change to the memory hierarchy. The L2 cache is removedand the size of the L1 caches is increased so that their miss rate is cut in half. Whatis the average memory access time as seen by the processor in this case
Suppose we have a system with 8-byte words and a cache with 32-byte blocks connected directly to memory. The cache has a hit time of 10 ns. The bus to memory is 8 bytes wide, requesting a word from memory takes 100 ns (total, aka round trip time), and memory bus transactions are serialized (not pipelined). The baseline cache requests each word from memory sequentially on a miss, and waits to respond to the CPU until miss repair is fully complete. Consider a workload with poor locality, with a cache hit rate of only 20%. Show your work. (a) What is the AAT speedup of early restart over baseline? Assume a uniform distribution of accesses to each word in a block (25% chance of each). This means that 25% of misses are for word 1 in a block, 25% for word 2, 25% for word 3, and 25% for word 4. (b) What is the AAT speedup over baseline of early restart if the distribution of accesses to each word in a block is 5%, 15%, 30%, and 50%, respectively? (c) What is the AAT speedup over baseline with…
Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. 8 bits are used for offset, 8 bits are used for page # and the max number of pages a process can have is 256. e. Translate the following virtual addresses to physical addresses, and show how you obtain the answers. (Hint: You do not need to convert hexadecimal numbers to decimal ones.) 0x0389 0xDF78 0x0245 0x8012 f) Now, suppose that the OS uses a two-level page table. Draw the page table. (Assume that frames 7 through 221 are free, so you can allocate space for the page table there.) In addition, suppose that the page-table directory storage comprises a whole number of consecutive full frames. (For examples: if the directory entry is 2 bytes, the entry’s storage comprises 1 frame; if the directory entry is 260 bytes, the entry’s storage comprises 2 consecutive frames.) g)What is the size of the two-level page table…
Suppose a byte-addressable computer using set associative cache has 2^24 bytes of main memory and a cache size of 64K bytes, and each cache block contains 32 bytes. a) If this cache is 2-way set associative, what is the format of a memory address as seen by the cache, that is, what are the sizes of the tag, set, and offset fields? b) If this cache is 4-way set associative, what is the format of a memory address as seen by the cache?
Let's pretend for a moment that we have a byte-addressable computer with 16-bit main memory addresses and 32-bit cache memory blocks, and that it employs two-way set associative mapping. Knowing that each block has eight bytes, please calculate the size of the offset field and provide evidence of your calculations.
Consider a memory system with a cache access time of 100ns and a memory access timeof 1200ns. If the effective access time is 10% greater than the cache access time, what is thehit ratio H?
Suppose a byte-addressable computer using set associative cache has 8M byes of main memory and a cache of 128 blocks, where each cache block contains 64 bytes. a) If this cache is 4-way set associative, what is the format of a memory address as seen by the cache, that is, what are the sizes of the tag, set, and offset fields? b) If this cache is 16-way set associative, what is the format of a memory address as seen by the cache
Consider the following situation: we have a byte-addressable computer with 2-way set associative mapping, 16-bit main memory addresses, and 32 blocks of cache memory. Based on the fact that each block has 8 bytes, figure out how big the offset field should be, and then show your work.
Consider a cache memory with blocks of 23 = words (1 word = 4 bytes) , with a bus Main Memory - Cache of 32 bits, and with 1 clock cycle to send the address, a row cycle time (DRAM) of 17 cycles (5 less clock cycles for the column access time) and 1 clock cycle to return a word. Assuming that each word is in a different DRAM row, calculate the bandwidth of the system in byte per clock cycles (bandwidth = number of bytes per clock cycles) for the transfer of one block from Main Memory to Cache Memory (not interleaved memory system). Provide the solution with at least 2 decimals