Answer only 3 and 4 Suppose memory has 256KB, OS use low address 20KB, there is one program sequence: (20) • Prog1 request 80KB, prog2 request 16KB, • Prog3 request 140KB • Prog1 finish, Prog3 finish; • Prog4 request 80KB, Prog5 request 120kb • Use first match and best match to deal with this sequence • (from high address when allocated) • (1)Draw allocation state when prog1,2,3 are loaded into memory? • (2)Draw allocation state when prog1, 3 finish? • (3)use these two algorithms to draw the structure of free queue after prog1 , 3 finish(draw the allocation descriptor information,) • (4) Which algorithm is suitable for this sequence ? Describe the allocation process?

Answer only 3 and 4 Suppose memory has 256KB, OS use low address 20KB, there is one program sequence: (20) • Prog1 request 80KB, prog2 request 16KB, • Prog3 request 140KB • Prog1 finish, Prog3 finish; • Prog4 request 80KB, Prog5 request 120kb • Use first match and best match to deal with this sequence • (from high address when allocated) • (1)Draw allocation state when prog1,2,3 are loaded into memory? • (2)Draw allocation state when prog1, 3 finish? • (3)use these two algorithms to draw the structure of free queue after prog1 , 3 finish(draw the allocation descriptor information,) • (4) Which algorithm is suitable for this sequence ? Describe the allocation process?

Name: Answer only 3 and 4 Suppose memory has 256KB, OS use low address 20KB
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Answer only 3 and 4 Suppose memory has 256KB, OS use low address 20KB, there is one program sequence: (20) • Prog1 request 80KB, prog2 request 16KB, • Prog3 request 140KB • Prog1 finish, Prog3 finish; • Prog4 request 80KB, Prog5 request

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 2PE: If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the...

See similar textbooks

Similar questions

If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the fetch cycle is 40% of the processor cycle time, what memory access speed is required to implement load operations with zero wait states and load operations with two wait states?
Consider a memory system that generates 16-bits addresses and the frame size is 32-byte. At time To the status of the page table is given below. Page Table Entry Page # 1911 11 561 56 644 1068 1884 52 58 42 194 46 a) What is the maximum number of entries within a single page/frame? b) What is the maximum number of page table entries in the memory system? c) Using the given page table, determine the physical addresses for the following logical addresses. Write down the physical addresses in binary and decimal format. (i) (iii) 0101000010001011 1110101110010111 (ii) (iv) 0001100001100111 1110111011101001
For a computer system, which utilizes pure segmentation, segmentation table and list of virtual addresses (a: segment number, b: offset) are given below. Please, write corresponding physical addresses for each virtual address given: Segment No Base Limit 219 600 a. 0,430 1 2300 14 b. 1,10 90 100 c. 2,500 3 1327 580 d. 3,400 4 1952 96 e. 4,112 -----
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…
I ONLY NEED 3 AND 4 Suppose memory has 256KB, OS use low address 20KB, there is one program sequence: Prog1 request 80KB, prog2 request 16KB, Prog3 request 140KB Prog1 finish, Prog3 finish; Prog4 request 80KB, Prog5 request 120kb Use first match and best match to deal with this sequence (from high address when allocated) (1)Draw allocation state when prog1,2,3 are loaded into memory? (2)Draw allocation state when prog1, 3 finish? (3)use these two algorithms to draw the structure of free queue after prog1 , 3 finish (4) Which algorithm is suitable for this sequence ? Describe the allocation process?
4. Given that the main memory size is 32KB, the page size is 64B, the word size is 1B, and n-level paging is applied. What is the page number size? If (5, 10) is a record in the outer page table stored in PCB and (9, 7) is a record in the inter page table stored in page frame No.10, what is the physical address of the logical address 0010101001000110 in HEX?
I need the answer for 3rd and 4th ones. Your answer will be updvoted!! 5 Suppose memory has 256KB, OS use low address 20KB, there is one program sequence: (20) Progl request 80KB, prog2 request 16KB, Prog3 request 140KB ● Prog1 finish, Prog3 finish; Prog4 request 80KB, Prog5 request 120kb . Use first match and best match to deal with this sequence . (from high address when allocated) . (1)Draw allocation state when prog1,2,3 are loaded into memory? (5) (2) Draw allocation state when prog1, 3 finish? (5) (3)use these two algorithms to draw the structure of free queue after progl, 3 finish(draw the allocation descriptor information,) (5) (4) Which algorithm is suitable for this sequence2 Describe the allocation process? (5)
(a) The PowerPC uses a hardware managed TLB with an inverted page table. Discuss its advantages and disadvantages. i.e., What are the implications of the inverted page table on the size of each page table entry? What about a page table walk (how many memory references are potentially required on a TLB miss)? Are per-process page tables necessary or can they be eliminated? (b) A stack page replacement algorithm is one that satisfies the inclusion property, i.e., one for which it can be shown that at any given time, the set of pages in memory for n frames is always a subset of the set of pages that would be in memory with n + 1 frames for the same sequence of accesses. Prove that OPT and LRU (least recently used) are stack algorithms.
Question 3 Assume the operating system for LC-3 has had new service routines added to it. Consider the following code fragment that requests one of those new service routines: LD R2, B х31 R2, R2, #-1 LOOP TRAP ADO Also consider the following partial service routine jump table: ADDRESS CONTENTS x0031 x0709 x0032 x0527 x0033 x0913 x0034 х0957 A. What address is used by the code above to access the service routine jump table? B. What is the starting address of the service routine called by the code above? C. If the symbol table shows LOOP is address x3801, what is the return address from the service routine? D. What is the machine code for the instruction the service routine uses to return to the code above? Enter the addresses and the machine code as 4-digit hex values in LC-3 format like the following: X01F3
The 8-bit register AR, BR, CR, and DR initially have the following values: [5]AR = 11010110; BR = 11100111; CR = 10110001; DR = 10111010Determine the 8-bit values in each register after the execution of the following sequenceof microoperations.AR  AR + BR Add BR + ARCR  CR AND DR, BR  BR + 1 AND DR to CR, Increment BRAR AR - CR Subtract CR from AR
A system uses pure segmentation (no paging). A segment table (see below) contains the following segment sizes and starting physical addresses. Segment Table Address Size 5 2048 2000 6 1024 400 2048 6000 1024 8000 11 Translate each of the following logical addresses (LA) into physical addresses (PA) or enter "illegal" if the LA is not within the segment. (1) LA = (5, 2000) (2) LA = (6, 2000) (3) LA = (7, 1000) (4) LA = (11, 500) Put your answer in the following blanks, one per blank, from left to right, case insensitive.
In a computer with a 32-bit data-bus, how many 4-bit wide memory components are used? the answer to this part is 32/4 = 8 components (2-bit wide) I need the answer to part two, please If the size of each 4-bit memory component is 4 x n cells where n = 1G (i.e., 4 x n uniquely addressable locations—n : row, 4 : 2 column/width), what is the total capacity of the memory system? Show your answer in power of 2. (hint: 1000 ~ 210)