Skip to main content

Brief about Computer function

 All contemporary computer designs are based on concepts developed by John von Neumann.

Key Concepts of von Neumann architecture:

Data and instructions are stored in a single read–write memory

The contents of this memory are addressable by location

Execution occurs in a sequential fashion

The CPU exchanges data with memory by using memory address register (MAR) and memory buffer register (MBR).

MAR specifies the address in memory for the next read or write.

MBR contains the data to be written into memory or receives the data read from memory.

Similarly, I/O address register (I/OAR) specifies a particular I/O device. An I/O buffer register (I/OBR) is used to exchange data between an I/O module and the CPU.

Memory module

set of locations, defined by sequentially numbered addresses. Each location contains a binary number.

In a typical processor, a register called the program counter (PC) holds the address of the instruction to be fetched next.

The processor reads (fetches) instructions from memory one at a time and executes each instruction. The fetched instruction is loaded into a register in the processor known as the instruction register (IR).

Program execution consists of repeating the process of instruction fetch (fetch cycle) and instruction execution (execute cycle).

The processing required for a single instruction is called an instruction cycle.

Virtually all computers provide a mechanism by which other modules (I/O, memory) may interrupt the normal processing of the processor.

Classes of Interrupts

  • Program
  • Timer
  • I/O
  • Hardware failure

Interrupts are provided primarily as a way to improve processing efficiency.

Popular posts from this blog

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

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

Minor, Cofactor, Determinant, Adjoint & Inverse of a Matrix

Consider a matrix Minor of a Matrix I n the above matrix A, the minor of first element a 11  shall be Cofactor The Cofactor C ij  of an element a ij shall be When the sum of row number and column number is even, then Cofactor shall be positive, and for odd, Cofactor shall be negative. The determinant of an n x n matrix can be defined as the sum of multiplication of the first row element and their respective cofactors. Example, For a 2 x 2 matrix Cofactor C 11 = m 11 = | a 22 | = a 22  = 2 Determinant The determinant of A is  |A| = (3 x 2) - (1 x 1) = 5 Adjoint or Adjucate The Adjoint matrix of A , adjA is the transpose of its cofactor matrix. Inverse Matrix A matrix should be square matrix to have an inverse matrix and also its determinant should not be zero. The multiplication of matrix and its inverse shall be Identity matrix. The square matrix has no inverse is called Singular. Inv A = adjA / |A|           [ adjoint A / determ...