Question

In: Computer Science

Given a memory address of 34Ah (10 bits) with 4 memory banks. Determine the memory bank...

Given a memory address of 34Ah (10 bits) with 4 memory banks. Determine the memory bank address and the address of the word in the bank using Low Order Interleaving (LOI).

Solutions

Expert Solution

Memory Interleaving is a technique used to increase the preformance of the system in terms of memory access. As per this technique, Memory will be divided into banks and these banks will be accessed in parallel so that more than one word can be fetched within a clock cycle. Interleaving is of two types and each has its own advantages and disadvantages. They are :

  1. Higher Order Interleaving (HOI)
  2. Lower Order Interleaving (LOI)

In Higher Order Interleaving, higher order bits of the address (Most significant bits) are used to select the bank, and rest of the bits are used to select the word within the bank. This representation is also known as 'Consecutive words within a bank'. In this requests to different banks can be serviced in parallel because the words are contiguously allocated accross the memory banks. If a new bank need to be added it can be added after the last memory bank without disturbing the other banks. When a block need to be transferred to cache using Higher order interleaving, only one bank access is enough. If any bank fails, then memory requests related to other banks can be carried.

In Lower Order Interleaving, lower order bits of the address (least significant bits) are used to select the bank, and rest of the bits are used to select the word within the bank. This representation is also known as 'Consecutive words in consecutive banks'. As per this interleaving, in one clock cycle, more than one word can be fetched, by accessing banks in parallel. But more than one request cannot be serviced in parallel because a memory request may access all the banks as the consecutive words are in consecuitve banks . If any new bank need to be added, then all the banks should be adjusted so it's diffifcult compared to higher order interleaving. When a block need to be transferred to cache, all banks may be accessed. If any bank fails, then no memory request can be handled because words are distributed across the banks.

The given hexadecimal address is 34A H

Its binary equivalent will be 0011 0100 1010

Since the address is of 10 bits, ignore most significant two bits. So the address will be 1101001010

It is given that 4 memory banks are present. So to access 4 banks, log24 = 2 bits will be needed. As per LOI, least significant two bits will be used to access the bank and rest 8 bits is used to access the word within bank.

Address to the bank Bank Select
11010010 10

So the selected bank is Bank 2 ( 2 is decimal equivalent of 10) and the address of word within bank will be 11010010 = D2 H.


Related Solutions

Determine the memory address of A[3], A[10], A[20] a) given int A[] b) given short A[]...
Determine the memory address of A[3], A[10], A[20] a) given int A[] b) given short A[] c) given char A[]
Given the following memory values and address instruction with an accumulator. Determine the values with the...
Given the following memory values and address instruction with an accumulator. Determine the values with the following instructions load into accumulator. Word 16 contains 22 Word 18 contains 24 Word 20 contains 26 Word 22 contains 28 Word 24 contains 30 Word 26 contains 32 Word 28 contains 34 i. LOAD IMMEDIATE 16 ii. LOAD DIRECT 16 iii. LOAD INDIRECT 16 iv. LOAD IMMEDIATE 18 v. LOAD DIRECT 18 vi. LOAD INDIRECT 20 vii. LOAD IMMEDIATE 24 viii. LOAD DIRECT...
How many bits are required to address the program memory of PIC16F887? What is PCLATH? For...
How many bits are required to address the program memory of PIC16F887? What is PCLATH? For PC absolute addressing, describe how to write assembly program to jump to code located in a different program memory page.
What's the memory address for the following elements arrays given: Base Address: 1000, Dimensions: 10 rows,...
What's the memory address for the following elements arrays given: Base Address: 1000, Dimensions: 10 rows, 5 columns, 4 byte elements. Elements: 0,0; 9,4; 2,2; 4,1; Base Address: 500, Dimensions: 10 rows, 15 columns, 4 byte elements. Elements: 0,0; 9,14; 2,2; 4,11; Base Address: 800, Dimensions: 4 rows, 5 columns, 2 byte elements. Elements: 0,0; 3,4; 2,2; 3,4;
Problem 1. How many bits are required to address a 4M × 16 main memory under...
Problem 1. How many bits are required to address a 4M × 16 main memory under the following conditions. (“4M x 16” means there are 4x220 16-bit words.) a) The main memory is byte-addressable? b) The main memory is word-addressable? (For part b, assume a 16-bit word.)
Given the data-bits m = 11010110, determine the number of k (parity-bits) by using Hamming Code...
Given the data-bits m = 11010110, determine the number of k (parity-bits) by using Hamming Code requirements. Illustrate the error detection and correction scheme using Hamming code method, for both the sender and receiver to detect an error at the following positions: a.6thbit position. b.11thbit position.Assume an odd-parity scheme for this problem.
Given the data-bits m = 11010110, determine the number of k (parity-bits) by using Hamming Code...
Given the data-bits m = 11010110, determine the number of k (parity-bits) by using Hamming Code requirements. Illustrate the error detection and correction scheme using Hamming code method, for both the sender and receiver to detect an error at the following positions: a. 6th bit position. b. 11th bit position. Assume an odd-parity scheme for this problem.
For a direct mapped cache design with 32 bit address, the following bits of the address...
For a direct mapped cache design with 32 bit address, the following bits of the address are used to access the cache Tag Index Offset 31 - 8 7 - 4 3 - 0 What is the cache block size (in words)? How many entries does the cache have? What is the ratio between total bits required for such a cache implementation over the data storage bits? Starting from power on, the following byte-addressed cache references are recorded. Address 0...
Given a system with 4M bytes of address space per process, 64M bytes of physical memory,...
Given a system with 4M bytes of address space per process, 64M bytes of physical memory, pages of size 1K bytes, and page table entries of 8 bytes. How many entries can fit in one page? Select one: a. 128 b. 1K c. 8 d. 64K Given a system with 16G bytes of address space per process, 8G bytes of physical memory, and pages of size 16K bytes. How many entries are there in a linear page table? Select one:...
Given a system with 2T bytes of address space per process, 1T bytes of physical memory,...
Given a system with 2T bytes of address space per process, 1T bytes of physical memory, and pages of size 32M bytes. How many entries are there in a linear page table? Select one: a. 64K b. 32K c. 32M d. 1T Given a system with 8G bytes of address space per process, 2M bytes of physical memory, and pages of size 2K bytes. How bits are needed to specify the virtual page number? Select one: a. 22 b. 10...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT