A Parallel Adaptive Gauss-Jordan Algorithm
The Journal of Supercomputing
Communications of the ACM - Web science
On the Use of Cloud Computing for Scientific Workflows
ESCIENCE '08 Proceedings of the 2008 Fourth IEEE International Conference on eScience
A break in the clouds: towards a cloud definition
ACM SIGCOMM Computer Communication Review
Matrix Inversion on the Cell/B.E. Processor
HPCC '09 Proceedings of the 2009 11th IEEE International Conference on High Performance Computing and Communications
A New Parallel Paradigm for Block-Based Gauss-Jordan Algorithm
GCC '09 Proceedings of the 2009 Eighth International Conference on Grid and Cooperative Computing
Communications of the ACM
What is Twitter, a social network or a news media?
Proceedings of the 19th international conference on World wide web
Hi-index | 0.00 |
In this paper we introduce a parallel approach to calculate massive matrix inversion. It needs large size of memory to compute with large size of matrices. Because of the memory requirements, we consider an algorithm to optimize memory distribution in cloud computing system. In matrix inversion using Gauss-Jordan algorithm, we found out a lot of regional memory access tendency in the algorithm. We also consider this memory access tendency. To solve these problems, we divide the matrix data as many as numbers of processors which was assigned to calculate matrix inversion. Dividing directions both horizontal and vertical are possible to imply. Matrix inversion has steps, and this step is increase according to the size of the matrix, and previous step calculation results are used at each step calculation results. To do above process, we use a parallel scheduler. Parallel scheduler manages the all processors and synchronizes these processors calculation. Research is focused on solving massive matrix inversion, so we test our research in cloud computing system, and we obtain the progress results.