Describe about address space and memory space, Computer Engineering

Assignment Help:

Q. Describe about Address Space and Memory Space?

An address used by a programmer will be termed as a virtual address and set of such addresses the address space. An address in main memory is known as a physical address. The set of these locations is termed as memory space. So address space is set of addresses produced by programs as they reference instructions and data, memory space comprises actual main memory locations directly addressable for processing.

Supposes a computer which has a main-memory capacity of 64K words (K=1024). 16-bits are required to specify a physical address in memory because 64K = 216. Assume that computer has auxiliary memory for storing information equivalent to capacity of 16 main memories. Let's signify address space by N and memory space by M we then have for this illustration: N = 16 × 64 K = 1024K and M = 64K.

In a multiprogramming computer system, data and programs are transferred to and from auxiliary memory and main memory based on demands obliged by CPU. Suppose program 1 is currently being executed in CPU. Program 1 and a part of its associated data are moved from secondary memory in the main memory as displayed in Figure below. Parts of programs and data require not being in contiguous locations in memory because information is being moved in and out and empty spaces may be available in scattered locations in memory.

1319_Describe about Address Space and Memory Space.png

Figure: Address and Memory Space in Virtual Memory

In our illustration address field of an instruction code will comprise 20 bits however physical memory addresses should be specified with just 16-bits. So CPU will reference data and instructions with a 20 bits address though information at this address should be taken from physical memory since access to auxiliary storage for particular words will be prohibitively long. A mapping table is then required as displayed in Figure below to map a virtual address of 20 bits to a physical address of 16 bits. Mapping is a dynamic operation that means every address is translated instantly as a word is referenced by CPU.  

323_Describe about Address Space and Memory Space1.png

Figure: Memory table for mapping a virtual table


Related Discussions:- Describe about address space and memory space

Use of parallel construct with private clause, Q. Use of parallel construct...

Q. Use of parallel construct with private clause? In this example we would see use of parallel construct with private and firstprivate clauses. At end of program i and j remain

What is delayed branching, What is delayed branching? A method called d...

What is delayed branching? A method called delayed branching can minimize the penalty incurred as a result of conditional branch instructions. The idea is easy. The instruction

What does the logo mean, This comes at the complication time, If we give th...

This comes at the complication time, If we give the LOGO option to the compiler, it take a bitmap file (i.e., ) as logo previous to loading the Application.

Kirchoff''s voltage law , Kirc hoff's Voltage Law   The sum ...

Kirc hoff's Voltage Law   The sum of all the voltage drops around a closed circuit loop will add to zero  V1+(-V2)+(-V3)+(-V4)= 0

The 2''s complement of the decimal number, What is the 2's complement of th...

What is the 2's complement of the number 1101101 ? Ans. 0010011 is the 2's complement of the number 1101101. As 1's complement of the number 1101101 is 0010010 and 2's comple

What is artificial intelligence fuzzy logic, Fuzzy logic is a form of vario...

Fuzzy logic is a form of various-valued logic; it deals with reasoning that is approximate rather than fixed & exact. In contrast with traditional logic theory, where binary sets h

Explain about floating point representation, Q. Explain about Floating Poin...

Q. Explain about Floating Point Representation? Floating-point number representation includes two parts. The first part of number is a signed fixed-point number which is called

Multi-threaded processors, Multi-Threaded Processors In unit 2, we have...

Multi-Threaded Processors In unit 2, we have gone through the use of distributed shared memory in parallel computer architecture. Although the use of distributed shared memory

Computation step in time complexity of an algorithm, Q. Computation step in...

Q. Computation step in time complexity of an algorithm? So First in the computation step the local processor executes an arithmetic and logic operation. Afterwards the several

Optimality - heuristic search strategies, Optimality - Heuristic search str...

Optimality - Heuristic search strategies: The path cost of a solution is considered as the sum of the costs of the actions that led to which solution is given. This is only on

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd