PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
Building Secure and Reliable Network Applications
Building Secure and Reliable Network Applications
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
Algorithm-Based Diskless Checkpointing for Fault-Tolerant Matrix Operations
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
MPI: A Message-Passing Interface Standard
MPI: A Message-Passing Interface Standard
Efficient Parallelized Network Coding for P2P File Sharing Applications
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
A grid-based programming approach for distributed linear algebra applications
Multiagent and Grid Systems
Efficient execution of parallel applications in grid with MPI library
MMACTEE'09 Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
An algorithm for solving massive matrix inversion in cloud computing systems
Proceedings of the 2011 ACM Symposium on Research in Applied Computation
Concurrency and Computation: Practice & Experience
Benefits of using parallelized non-progressive network coding
Journal of Network and Computer Applications
Exploiting SIMD parallelism on dynamically partitioned parallel network coding for P2P systems
Computers and Electrical Engineering
Parallel implementation of the sherman-morrison matrix inverse algorithm
PARA'12 Proceedings of the 11th international conference on Applied Parallel and Scientific Computing
Hi-index | 0.00 |
This paper presents a parallel adaptive version of the block-based Gauss-Jordan algorithm, utilized to invert large matrices. This version includes a characterization of the workload and a mechanism of its folding/unfolding. Furthermore, this paper proposes a work scheduling strategy and an application-oriented solution for the fault tolerance problem. The application is implemented and experimented with MARS1 in dedicated and non-dedicated environments. The results show that an absolute efficiency of 92% is possible on a cluster of DEC/ALPHA processors interconnected by a Gigaswitch network and an absolute efficiency of 67% can be obtained on an Ethernet network of SUN-Sparc 4 workstations. Moreover, the algorithm is tested on a meta-system including both the two parks of machines. Finally, an out-of-core solution for the algorithm is proposed. This solution allows a gain of 66% of data input operations and reduces the central memory space required for storing the data space of the algorithm by a factor q, where q is the dimension of the matrix to be inverted in terms of data blocks.