About the routing of hypercube Interconnection networks.

1. PERFORMANCE
EVALUATION OF
HYPERCUBE
INTERCONNECTION
NETWORK
BY :-
ANJALI
AYUSHI RATHORE
IT (FINAL YEAR)

2. CONTENTS
 OBJECTIVE
 METHADOLOGY
 EXPECTED INPUT
 EXPECTED OUTPUT
 TOOLS TO BE USED
 ACTIVITY CHART

3. To Evaluate The Performance of
Hypercube Interconnection
Network .

4. IT IS A INTERCONNECTION NETWORK WHERE 2N
NO. OF PROCESSOR ARE CONNECTED WITH EACH
OTHER THROUGH MAXIMUM OF N NO. OF PATHS
FOR EACH NODE. EACH ADJACENT NODE IS
NAMED ON THE GREY CODE BASIS.

5. By Using Hypercube Interconnection Routing Algorithm to Pass
The Messages From Different Sources & Destinations generated
randomly in a n-Processor hypercube.
To Find The Efficiency.

6. Initially, We Take 1000 Messages Being Routed From a Source
& Destination Being Generated randomly on a n-level
Hypercube Network with 2n no. Of Processor.
Then We Keep on Increasing The No. of Messages Exponentially
to Be Routed From different Source Node to Destination Node .

7. We Will Keep Record Of The Total Time Taken To Route Certain no. of
Messages From Random Sources to Destinations.
We Will Have The Total Time Taken To Route Approx N no. of Messages on a
Particular Level of Hypercube Processor.
The Total Time Individually Will Be Plotted on a Graph Showing The Behavior
of The Message Routing.

8.  OS- Windows XP78
 Front end- VB 2008
SOFTWARE REQUIREMENT
hardware REQUIREMENT
Pentium 4 processor or advance processor
512 MB RAM or more
20 GB Hard Disk or more
Keyboard & Mouse
VGA display

9. •Information gathering
•Studying message routing algorithms.
SEPTEMBER
OCTOBER
•Algorithm design
•Software Implementation
NOVEMBER
DECEMBER
JANUARY
•Final Implementation
•Testing & Verification
•Modification if any
FEBRUARY
MARCH