Y. Jayanta Singh, Department of Information Technology, Skyline College, UAE
S.C. Mehrotra, Department of Computer Science and IT, Dr. B. Ambedkar Marathwada University. Aurangabad, India

A parallel processing system is such a system that a large amount of work is distributed equally among many processors and are made to work for a single solution. Hypercube computers are used for parallel processing. Hypercube computers are introduced under different names like cosmic cube, n-cube, binary n-cube, boolean n-cube etc. The some of commercial hypercube available are binary hypercube, like, iPSC/2, nCUBE, and Mark III etc. The excellent performance of this type of computer on complex applications and its modest cost and open-ended expandability give an effective means of achieving faster and cheap computing in the near future. For example a 64-node machine has five to ten times faster than a VAX1 l/780. Due to their structural regularity and high potential for the parallel execution of various algorithms, hypercube computers have drawn considerable attention in recent years from both Academic and industrial communities.

A simulation study had performed on hypercube computer to bring the optimization for (i) the distribution timing of workloads among the neighbor processors from server or originating processor, (ii) computing time and (iii) effects of different setup timing of proces-sors on total processing time.

Keywords: Parallel processing, Hypercube, computing time, setup timing

Suggested citation: Singh, Y.J. & Mehrotra, S.C.(2005). Performance evolution of Hypercube Computers through Simulation. Skyline Business Journal, Volume 1, Issue 1. pp 41-44

{jd_file file==138}

Singh, Y.J. & Mehrotra, S.C.(2005). Performance evolution of Hypercube Computers through Simulation. Skyline Business Journal, Volume 1, Issue 1. pp 41-44