Ajinkya Mandhare: Superscaler Architecture

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
*/