{"title":"使用RMI Java线程实现分布式应用程序","authors":"A. Keshk","doi":"10.1109/ISSPIT.2007.4458214","DOIUrl":null,"url":null,"abstract":"In this paper, we suggest a mechanism for implementing a distributed application using RMI based on JAVA threads. The application is parallel matrices multiplication depending on distributed the products of rows and columns on different machines. One server and three clients are run to find the product of matrix multiplication. The server distributes the determine blocks of rows and columns on the registered clients. The clients return their product blocks to a server, which calculate the final product of matrix multiplication. Applications of this type will allow loaded servers to transfer part of the load to clients to exploit the computing power available at client side. The time of matrix multiplication with size of 256 times 256 is reduced by 52.5 % by using 3-client and this time can be decreased more in the case of increasing the number of clients.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Implementation of Distributed Application using RMI Java threads\",\"authors\":\"A. Keshk\",\"doi\":\"10.1109/ISSPIT.2007.4458214\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we suggest a mechanism for implementing a distributed application using RMI based on JAVA threads. The application is parallel matrices multiplication depending on distributed the products of rows and columns on different machines. One server and three clients are run to find the product of matrix multiplication. The server distributes the determine blocks of rows and columns on the registered clients. The clients return their product blocks to a server, which calculate the final product of matrix multiplication. Applications of this type will allow loaded servers to transfer part of the load to clients to exploit the computing power available at client side. The time of matrix multiplication with size of 256 times 256 is reduced by 52.5 % by using 3-client and this time can be decreased more in the case of increasing the number of clients.\",\"PeriodicalId\":299267,\"journal\":{\"name\":\"2007 IEEE International Symposium on Signal Processing and Information Technology\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Symposium on Signal Processing and Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSPIT.2007.4458214\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Symposium on Signal Processing and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPIT.2007.4458214","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Implementation of Distributed Application using RMI Java threads
In this paper, we suggest a mechanism for implementing a distributed application using RMI based on JAVA threads. The application is parallel matrices multiplication depending on distributed the products of rows and columns on different machines. One server and three clients are run to find the product of matrix multiplication. The server distributes the determine blocks of rows and columns on the registered clients. The clients return their product blocks to a server, which calculate the final product of matrix multiplication. Applications of this type will allow loaded servers to transfer part of the load to clients to exploit the computing power available at client side. The time of matrix multiplication with size of 256 times 256 is reduced by 52.5 % by using 3-client and this time can be decreased more in the case of increasing the number of clients.