Skip to main content

Characteristics of Computer Memory

The key characteristics of computer memory systems are listed below.

  • Location
  • Capacity
  • Unit of Transfer
  • Performance
  • Access method
  • Physical type & characteristics

The internal memory capacity is expressed in terms of bytes or words whereas the external memory capacity is expressed in bytes.

The size of a word is equal to the number of bits used to represent an integer and the instruction length.

The relationship between the length in bits A of an address and the number N of addressable units is 2A = N.

The Unit of transfer is the number of bits read out of or written into memory at a time for main memory.

The important performance parameters are access time, memory cycle time and transfer rate.

The access time is the time it takes to perform a read or write operation for random access memory and time it takes to position the read–write mechanism at the desired location for non random access memory.

The access time plus any additional time required before a second access can commence is memory cycle time. The memory cycle time is concerned with the system bus, not the processor.

The transfer rate is the rate at which data can be transferred into or out of a memory unit.

For random access memory,

Transfer time = 1/Cycle Time

For non random access memory,




where

Tn - Average time to read or write n bits

TA - Average access time

n - No of bits

R - Transfer rate in bps

The relation between capacity, access time and cost of a memory is

  • Faster access time, High cost per bit
  • Larger capacity, Low cost per bit
  • Larger capacity, slower access time

Popular posts from this blog

Exercise 1 - Amdahl's Law

A programmer is given the job to write a program on a computer with processor having speedup factor 3.8 on 4 processors. He makes it 95% parallel and goes home dreaming of a big pay raise. Using Amdahl’s law, and assuming the problem size is the same as the serial version, and ignoring communication costs, what is the speedup factor that the programmer will get? Solution Speedup formula as per Amdahl's Law, N - no of processor = 4 f - % of parallel operation = 95% Speedup = 1 / (1 - 0.95) + (0.95/4) = 1 / 0.5 + (0.95/4) Speedup = 3.478 The programmer gets  3.478 as t he speedup factor.

Exercise 2 - Amdahl's Law

A programmer has parallelized 99% of a program, but there is no value in increasing the problem size, i.e., the program will always be run with the same problem size regardless of the number of processors or cores used. What is the expected speedup on 20 processors? Solution As per Amdahl's law, the speedup,  N - No of processors = 20 f - % of parallel operation = 99% = 1 / (1 - 0.99) + (0.99 / 20) = 1 / 0.01 + (0.99 / 20) = 16.807 The expected speedup on 20 processors is 16.807

Gaussian Elimination - Row reduction Algorithm

 Gaussian elimination is a method for solving matrix equations of the form, Ax=b.  This method is also known as the row reduction algorithm. Back  Substitution Solving the last equation for the variable and then work backward into the first equation to solve it.  The fundamental idea is to add multiples of one equation to the others in order to eliminate a variable and to continue this process until only one variable is left. Pivot row The row that is used to perform elimination of a variable from other rows is called the pivot row. Example: Solving a linear equation The augmented matrix for the above equation shall be The equation shall be solved using back substitution. The eliminating the first variable (x1) in the first row (Pivot row) by carrying out the row operation. As the second row become zero, the row will be shifted to bottom by carrying out partial pivoting. Now, the second variable (x2)  shall be eliminated by carrying out the row operation again. ...