An Efficient Parallel Algorithm of Modified Jacobi Approach for Sparse Linear System
Journal: International Journal of Advanced Networking and Applications (Vol.3, No. 01)Publication Date: 2011-07-04
Authors : Bikash Kanti Sarkar; Shib Sankat Sana; G. Sahoo;
Page : 991-998
Keywords : Parallel; Efficient; Communication; Optimization; Distributed Memory; Jacobi;
Abstract
Several parallel approaches have been developed to solve sparse linear system based on well-known memory saving schemes. To solve such a linear system, this article proposes a very simple parallel version of the modified Jacobi iterative method on Distributed Memory Architecture, using the well-known Compressed Sparse Row(CSR) storage format and Recursive Graph Bisection(RGB). The prime contribution of the present investigation is that the individual processors will not update its assigned variables any more, provided the previous iteration achieves smaller than the prescribed accuracy. Consequently, such processors will stop computation as well as communication with other processors to reduce both the computation and the communication time to a great extent.In fact, the use of such local stopping criteria ensures to achieve such overall system performance. The expected benefit of this algorithm is explained through the analytical results.
Other Latest Articles
- Detection Architecture of Application Layer DDoS Attack for Internet
- Current Security Considerations for Issues and Challenges of Trustworthy Semantic Web
- An Integrated Survey in Efficient Energy Management for WSN using Architecture Approach
- Next Generation Large Capacity Long Distance Fiber To The Home
- Role of ANN in Secured Wireless Multicast Routing during Dynamic Channel Allocation for User Demanded Packet Optimality
Last modified: 2015-12-04 16:17:14