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

Matrix Eigenvalues & Eigenvectors

The process of finding an unknown scalar, λ and a nonzero vector, x for a given non zero square matrix, A of dimension n x n is called matrix eigenvalue or eigenvalue. Ax = λ x The λ and x which satisfies the above equation is called eigen value and eigenvector. Ax should be proportional to x. The multiplication will produce a new vector that will have the same or opposite direction as the original vector. The set of all the eigenvalues of A is called the  spectrum of A. The largest of the absolute values of the  eigenvalues of A is called the spectral radius of A. To determine eigenvalue and eigenvector, the equation can be written in matrix notation, (A - λI)x = 0 By Cramer's theorem,  the  homogeneous linear system of equations has a  nontrivial solution if and only if the corresponding determinant of the coefficients is zero. A - λI is called characteristic matrix and D( λ) is characteristic determinant of A. The above equation is called characteristic ...

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. ...

Cache Memory

The supplementary memory system that temporarily stores frequently used instructions and data for quicker processing by CPU of a computer. Main memory consists of up to 2n addressable words, with each word having a unique n-bit address. there are M = 2n/K fixed length of blocks in main memory. where K - words The cache consists of m blocks called lines. The length of a line, not including tag and control bits, is the line size. As there are more blocks in main memory than lines in cache, an individual line cannot be uniquely and permanently dedicated to a particular block. Thus, each line includes a tag that identifies which particular block is currently being stored. The cache connects to the processor via data, control, and address lines. When a cache hit occurs, the data and address buffers  are disabled and communication is only between processor and cache, with no system bus traffic. When a cache miss occurs, the desired address is loaded onto the system bus and the data are r...