In this paper, we suggest a mechanism for Since this increases the complexity of load balancing, it is implementing a distributed application using RMI based on JA VA often ignored.threads. The application is parallel matrices multiplication Most parallel algorithms are optimized based on the depending on distributed the products of rows and columns on characteristics of the targeting platform. The PC cluster different machines. One server and three clients are run to find the product of matrix multiplication. The server distributes the coXmpting for hasfrecent emrgdos amvial alternative for high-performance and low-cost computing determine blocks of rows and columns on the registered clients. g pt p gThe clients return their product blocks to a server, which calculate [2]. Generally, the PCs in a cluster have a lot of resources the final product of matrix multiplication. Applications of this that can be used simultaneously. They have relatively weak type will allow loaded servers to transfer part ofthe load to clients communication capabilities. They lack high performance to exploit the computing power available at client side. The time of implementation support for data communications compared matrix multiplication with size of256 X 256 is reduced by 52.5 % to supercomputers. They only support some communication by using 3-client and this time can be decreased more in the case channels implemented by software that capitalizes on ofincreasing the number ofclients.canlimlmne bysfwrthtapaizso of increasig thenmberoflients.Ethernet connections. MM operations are embedded in