Consider a computer system with a 64-bit logical address and 8-KB page size. The system supports...

Consider a computer system with a 64-bit logical address and 8-KB page size. The system supports up to 1024 MB of physical memory:

How many entries are there in each of the following in the page table?

Describe how a logical address may be used to obtain the frame number. You may use the virtual address 14533956 to illustrate your answer.

make it short and clear , please type in your keyboard.

Expert Solution

Logical address=64 bit.So address space is 2⁶⁴.

page size is given as 8KB.

Physical memory size=1024 MB.

Pages and pageframes are of equal size.So page frame size=8KB

So total number of pages in physical memory

=1024MB/8KB=(1024*2¹⁰*2¹⁰)/8*2¹⁰=1024*1024*1024/8*1024=1024*1024/8=128K number of pages in total.

Consider the virtual address 14533956, convert this into 64bit binary address.

0000000100000100000001010000001100000011000010010000010100000110. This Address is divided into page number and an offset.Page number refers to one entry in page table and the offset is copied as like this to get the physical address.

Here total number of pages are 128K.That is 2ⁿ=2⁷*2¹⁰,that is n=17.

17 bits are required out of 64 bits to refer to page table.This entry will provides the frame number.

00000001000001000 this will point to page table,which contains the frame number.Remaining bits are taken as offset.

venereology answered 1 year ago

Consider a simple system with 8-bit block size. Assume the encryption (and decryption) to be a...

Consider a simple system with 8-bit block size. Assume the encryption (and decryption) to be a simple XOR of the key with the input. In other words, to encrypt x with k we simply perform x⊕k giving y. Similarly, to decrypt y, we perform y⊕k giving x. You are given the following 16-bit input 1A2Bin hexadecimal. You are provided IV as 9D in hexadecimal. The key to be used (where appropriate) is 7C in hexadecimal. Compute the encrypted output with...

Consider a file system that uses inodes to represent files. Diskblocks are 8 kb in size,...

Consider a file system that uses inodes to represent files. Diskblocks are 8 kb in size, and a pointer to a disk block requires 4bytes. this file system has 12 direct disk blocks, as well assingle, double, and triple in direct disk blocks. What is themaximum size of a file that can be stored in this file system?Explain a little bit^^ Thank you

Assume a 32-bit system, with a 2-level page table, with a page size of 4KiB (p1=10bits,...

Assume a 32-bit system, with a 2-level page table, with a page size of 4KiB (p1=10bits, p2=10bits, offset=12bits). (i) A program on this system requires 16MiB in total: the program text segment uses 4MiB, the program data requires 2MiB, the program dynamically allocates 8MiB on the heap, and the stack utilises 2MiB. How many page-table pages are required for this process? (Don’t answer with just a number, explain your reasoning. Without your reasoning we cannot award part marks if your...

Consider a memory system with a 14 bit long address. Produce the answer to each of...

Consider a memory system with a 14 bit long address. Produce the answer to each of the following parts using hexadecimal numbers. a. There is a 1.5k byte RAM device, starting at address $200. What is its last address? b. There is a 1k byte EPROM device, starting at address $900.What is is last address? c. There is a 7k byte ROM device, its last address is at the highest system address. What is its first address? d. Use your...

Consider a hypothetical Control Unit which supports 8 k words. The Hardware contains 64 internal control...

Consider a hypothetical Control Unit which supports 8 k words. The Hardware contains 64 internal control signals, 16 bus control signals, 8 Flags and 8 branch conditions. What is the size of control word and control memory in: a) Horizontal Programming b) Vertical programming

A 64 bit computer uses a memory of 32KB. Work out the number of bits of...

A 64 bit computer uses a memory of 32KB. Work out the number of bits of AR, DR, PC, AC, and the HEX code of the address of last memory location. b) The memory attached to a processor has access time of 400ns. When a cache memory is introduced in the system, it is found that on average the access time for the computer was 30% greater than the cache access time for a miss ratio of 0.10. Work out...

write a one-page paper that supports the claim that, in the future, computer criminals will become...

write a one-page paper that supports the claim that, in the future, computer criminals will become more sophisticated and that protecting personal information will become more difficult.

Assume a computer with a cache that holds 64 bytes and has a block size of...

Assume a computer with a cache that holds 64 bytes and has a block size of 32 bytes. Direct address mapping is used and from the beginning the cache is empty. The following program sequence is executed: for (col = 0; col < 2; col++) { for (row = 0; row < 4; row++) A[row][col] = B[row] * C[col]; } Assume that for the variables row and col registers are used. The matrix A consists of 4 rows and 4...

Consider the following program: 1 #define Size 64 int A[Size; Size], B[Size; Size], C[Size; Size]; int...

Consider the following program: 1 #define Size 64 int A[Size; Size], B[Size; Size], C[Size; Size]; int register i, j; for (j = 0; j< Size; j ++) { { for (i = 0; i< Size; i++) C[i; j] = A[i; j] + B[i; j]; } } Assume that the program is running on a system using demand paging and the page size is 1 Kilobyte. Each integer is 4 bytes long. It is clear that each array requires a 16-page...

2. Consider the same computer system used in problem 1. The following trace of accessed page...

2. Consider the same computer system used in problem 1. The following trace of accessed page numbers was recorded over time: 1, 0, 2, 2, 1, 7, 6, 7, 0, 1, 2, 0, 3, 0, 4, 5, 1, 5, 2, 4, 5, 6, 7, 6, 7, 2, 4, 2, 7, 3, 3, 2, 3. The first two page references were reads, while the third was a write, and every third reference after that was also a write operation. c) Assuming...

Question