Ajinkya Mandhare: Advanced Microprocessors

Monday, 2 May 2011

Tagged under: Advanced Microprocessors, TE VI SEM

Advanced MicroProcessors

AMP All Programs
you can download all the programs from the download box alongside

Note: It does not include EFlags

Anonymous 7:41 pm No comment

Friday, 8 April 2011

Tagged under: Advanced Microprocessors, Superscaler Architecture, TE VI SEM

SUPERSCALAR ARCHITECTURE in terms of Pipelining

Superscaler Program

/***********To Study The SUPERSCALAR ARCHITECTURE in terms of Pipelining****************/

import java.util.*;
class  superscalar
{
	public static void main(String[] args) 
	{
		int n,i,j,k;
		Scanner sc=new Scanner(System.in);
		System.out.print("Enter number of instructions: ");
		n=sc.nextInt();
		if(n<=0)
		{
		System.out.println("No instructions available for execution!!!");
		System.exit(0);
		}
		System.out.println("Fetch\tDecode\tExecute\tWrite");
		for(i=1;i<=n;i++)
		{
			if(i%2==0)
			      even(i);
			else
			       odd(i);   
		}
		
		for(i=n-1;i>=(n-5)&&i>0;i--)
		{
			System.out.print("   \t"+i);
			i--;
		}
		System.out.println();
		for(i=n;i>=(n-4)&&i>0;i--)
		{
			System.out.print("   \t"+i);
			i--;
		}
		System.out.println();

System.out.print("   \t");
		for(i=n-1;i>=(n-3)&&i>0;i--)
		{
			System.out.print("   \t"+i);
			i--;
		}
		System.out.println();
		
		System.out.print("   \t");
		for(i=n;i>=(n-2)&&i>0;i--)
		{
			System.out.print("   \t"+i);
			i--;
		}
		System.out.println();

if((n-1)>0)
			System.out.println("   \t\t\t"+(n-1));
		System.out.println("   \t\t\t"+n);
	}

static void even(int i)
	{
		int count=0,l;

for(l=i;l>=2;l--)
		{
			if(count==4)
			{
//                                System.out.println();
				break;
			}
			if(l%2==0)
			{
				System.out.print(l+"   \t");
				count++;
			}
		}
		System.out.println();
	}

static void odd(int i)
	{
		int count=0,l;
		for(l=i;l>=1;l--)
		{
			if(count==4)
			{
//                                System.out.println();
				break;
			}
			if(l%2==1)
			{
				System.out.print(l+"   \t");
				count++;
			}
		}
		System.out.println();
	}
}
/******************OUTPUT*****************
Enter number of instructions: 5
Fetch   Decode  Execute Write
1
2
3       1
4       2
5       3         1
        4         2
        5         3       1
                  4       2
                  5       3
                          4
                          5
*/

Anonymous 8:04 pm No comment

Wednesday, 6 April 2011

Tagged under: Advanced Microprocessors, Arithmetic Pipelining, TE VI SEM

Arithmetic Pipelining for multiplicaion

ARITHMETIC PIPELINING
This the final prog for arithmetic pipelining. It works upto 8bit X 8bit multiplication. There were some minor changes in the datatypes of some variables as compared to the previous prog.

//Arithmetic Pipelining Program by Ajinkya
#include<iostream.h>
#include<math.h>
#include<conio.h>
#include<stdio.h>

int a1[20],a2[20],x[20],p[8][20],q[8][20],q2[8][20],i,j,k;
long q3[8][20];
int a,b;
void dectobin(int a, int a1[]);
void csa(int p[8][20]);
void cpa(int p[8][20]);

void main()
{
for(i=0;i<20;++i)
a1[i]=a2[i]=x[i]=0;
for(i=0;i<8;++i)
for(j=0;j<20;++j)
{p[i][j]=0;
q2[i][j]=0;
q3[i][j]=0;
}
clrscr();
cout<<"Enter multiplicand";
cin>>a;
cout<<"Enter multiplier";
cin>>b;
cout<<"A= ";
dectobin(a,a1);
for(i=0;i<8;++i)
cout<<a1[i];
cout<<endl<<"B= ";
dectobin(b,a2);
for(i=0;i<8;++i)
cout<<a2[i];
cout<<endl;
for(i=0;i<8;++i)
{
for(j=15;j>16-i-1;--j)
p[i][j]=0;
if(a2[i]==1)
{
k=0;
for(j=i;j<16;++j)
p[i][16-j-1]=a1[k++];
}
else
{for(j=i;j<16;++j)
p[i][16-j-1]=0;
}
}
for(i=0;i<8;++i)
{
cout<<"P"<<i<<" = ";
for(j=0;j<16;++j)
cout<<p[i][j];
cout<<endl;
}
i=0;
j=0;

csa(p);
i=i+3;
j++;
csa(p);
int z;
for(j=0;j<3;++j)
for(z=0;z<16;++z)
{if(j==0||j==1)
 {p[2*j][z]=q[j][z];
  p[2*j+1][z]=q2[j][z];
 }
 else
 {p[2*j][z]=p[3*j][z];
  p[2*j+1][z]=p[3*j+1][z];
 }
}
i=0;
j=0;
csa(p);
i=i+3;
++j;
csa(p);
for(j=0;j<3;++j)
for(z=0;z<16;++z)
{if(j==0||j==1)
 {p[2*j][z]=q[j][z];
  p[2*j+1][z]=q2[j][z];
 }
}
i=0;
j=0;
csa(p);
for(j=0;j<2;++j)
for(z=0;z<16;++z)
{if(j==0)
 {p[2*j][z]=q[j][z];
  p[2*j+1][z]=q2[j][z];
 }
 else
 p[2*j][z]=p[3*j][z];
}
i=0;j=0;
csa(p);
for(j=0;j<1;++j)
for(z=0;z<16;++z)
{p[2*j][z]=q[j][z];
 p[2*j+1][z]=q2[j][z];
}
i=0;j=0;
cpa(p);

getch();
}
void dectobin(int a, int a1[])
{i=0;
while(a>0)
{
x[i]=a%2;
a=a/2;
++i;
}
--i;
j=0;
while(i>=0)
{
a1[i]=x[i];

--i;
}
}
void csa(int p[8][20])
{
cout<<"CSA";
int z;
cout<<"Exor"<<endl;
 for(z=0;z<16;++z)
 {if((p[i][z]==p[i+1][z]==p[i+2][z]==0)||(p[i][z]==p[i+1][z]==1&&p[i+2][z]==0)||(p[i][z]==0&&p[i+1][z]==p[i+2][z]==1)||(p[i+1][z]==0&&p[i][z]==p[i+2][z]==1))
 q[j][z]=0;
 else
 q[j][z]=1;
 cout<<q[j][z];
 }

q2[j][15]=0;
 int r=0;
cout<<"Carry"<<endl;
 for(z=15;z>0;--z)
 {
 if((p[i][z]==0&&p[i+1][z]==0&&p[i+2][z]==0)||(p[i][z]==0&&p[i+1][z]==0)||(p[i+1][z]==0&&p[i+2][z]==0)||(p[i][z]==0&&p[i+2][z]==0))
{ //cout<<endl<<p[i][z]<<p[i+1][z]<<p[i+2][z];

q2[j][z-1]=0;
}  else
  q2[j][z-1]=1;

}

for(z=0;z<16;++z)
   cout<<q2[j][z];
   cout<<endl;

}

void cpa(int p[8][20])
{
cout<<"CPA";
cout<<endl<<"P= ";
   int z;
   int c=0;
   for(z=15;z>=0;--z)
   {if(q[j][z]==0&&q2[j][z]==0&&c==0)
    {q3[j][z]=0;
    }
    else
    {if((q[j][z]==1&&q2[j][z]==0&&c==0)||(q2[j][z]==1&&q[j][z]==0&&c==0)||(q[j][z]==0&&q2[j][z]==0&&c==1))
    { q3[j][z]=1;
       c=0;
     }
     else
     {if((q[j][z]==1&&q2[j][z]==1&&c==0)||(q[j][z]==1&&q2[j][z]==0&&c==1)||(q[j][z]==0&&q2[j][z]==1&&c==1))
      {q3[j][z]=0;
	c=1;
       }
      else
      {q3[j][z]=1;
	c=1;
       }
     }
    }
   }
   if(c==1)
   q3[j][16]=1;
cout<<"Sum: ";
   for(z=0;z<16;++z)
   cout<<q3[j][z];
   cout<<endl;
cout<<"Carry: "<<c;
for(z=0;z<16;++z)
{q3[j][z]=abs(q3[j][z])*pow(2,15-z);
}
float ans=0;
for(z=0;z<16;++z)
ans=ans+q3[j][z];
cout<<endl<<"Ans "<<ans;

}
/*******OUTPUT**************
Enter Multiplicand 181
Enter Multiplier 147

A=10110101
B=10010011

P0=000000010110101
P1=000000111101010
P2=000000000000000
P3=000000000000000
P4=000101101010000
P5=000000000000000
P6=000000000000000
P7=101101010000000

CSA
Exor: 000000111011111
Carry: 0000000001000000

CSA
Exor: 0000101101010000
Carry: 0000000000000000

CSA
Exor: 0000101011001111
Carry: 0000001010100000

CSA
Exor: 0101101010000000
Carry: 0000000000000000

CSA
Exor: 0101001011101111
Carry: 0001010100000000

CSA
Exor: 0100011111101111
Carry: 0010000000000000

CPA
Sum= 0110011111101111
Carry=0
 
P=0110011111101111
Ans=26607
***************************/