RMI approach to cluster based Winograd´s variant of Strassen´s method

Present day´s amount of computational requirements has shifted the processing of data from the regular way to parallel way of computation. Pipelined processors, array processors can be employed to construct design of parallel hardware. These systems constructed can be further extended with the help of scalar and super scalar systems. We provide an efficient way of implementing Winograd´s variant of Strassen´s matrix multiplication on parallel systems by making use of RMI(Remote Method Invocation ) which provides us distributed object oriented programming, multithreading programming. Multithreading approach helps a lot in concurrent, dynamic and asynchronous programming. In this paper clusters have been made from very basic hardware systems which are connected on local area network using switch and a master system connected to this switch uses three NIC. The facility of Winograd´s variant of Strassen´s method to run in divide and conquer approach is the basic fact around which whole analysis has been performed. Actual partitioning (AP) of a given matrix into sub matrix according to cluster size and at each system logical partitioning (LP) of each sub matrix into size 2×2 has been performed which on a whole covers the aspect of SIMD based model. The parallel computing metrics like speed up, efficiency, excessive parallel overhead proves RMI as a better approach for distributed computing as RMI provides look and feel like a user is working on local machine as not much overheads are being there in order to convert a non-distributed application to the distributed one.