TITLE

AN IMPLEMENTATION OF A PARALLEL ITERATIVE ALGORITHM FOR THE SOLUTION OF LARGE BANDED SYSTEM ON A CLUSTER OF WORKSTATIONS

AUTHOR(S)
Al-Towaiq, M.; Masoud, F. A. M.; Mnaouer, A. B.; Day, K.
PUB. DATE
December 2008
SOURCE
International Journal of Modelling & Simulation;2008, Vol. 28 Issue 4, p378
SOURCE TYPE
Periodical
DOC. TYPE
Article
ABSTRACT
In this paper, we present a parallel iterative solution for large banded systems of linear equations based on incomplete LU-factorization (ILU). A master--workers parallel computing scheme is used. The proposed algorithm incurs reduced storage and communication overhead as compared to previous methods. The reduction in communication overhead has been achieved by pipelining the interworkers message passing and limiting the communication between master and workers to initial work distribution and final results collection. The performance of the proposed algorithm is evaluated analytically and experimentally using Parallel Virtual Machine (PVM) as a parallel programming environment on a cluster of Linux workstations. The obtained performance results show that the proposed algorithm exhibits higher efficiency for coarse grain computations corresponding to large matrix sizes and reduced number of processors.
ACCESSION #
37180972

 

Related Articles

  • Efficient parallel processing with spin-wave nanoarchitectures. Eshaghian-Wilner, Mary; Navab, Shiva // Journal of Supercomputing;Aug2009, Vol. 49 Issue 2, p248 

    In this paper, we study the algorithm design aspects of three newly developed spin-wave architectures. The architectures are capable of simultaneously transmitting multiple signals using different frequencies, and allow for concurrent read/write operations. Using such features, we show a number...

  • AN INVESTIGATIVE STUDY TO DETERMINE THE BEST PARALLEL PROGRAMMING CONSTRUCTS FOR DIFFERENT CASES. Israr, Zohra; Shereen, Muneeba; Farooq, Umar; Rabbi, Ihsan; Khan, Aurangzeb // Science International;Sep/Oct2016, Vol. 28 Issue 5, p4363 

    The well-known programming languages, now adays, provide parallel constructs to utilise the current parallel architectures for faster execution of the programs. In this article, we utilise the three most widely used, parallel repetitive constructs of, C# language, to explore the functionality of...

  • Adaptive load balancing of iterative computation on heterogeneous nondedicated systems. Martínez, J.; Almeida, F.; Garzón, E.; Acosta, A.; Blanco, V. // Journal of Supercomputing;Dec2011, Vol. 58 Issue 3, p385 

    Dynamic load balancing in heterogeneous systems is a fundamental research topic in parallel computing due to the high availability of such systems. The efficient utilization of the heterogeneous resources can significantly enhance the performance of the parallel system. At the same time,...

  • At the computer's parallel face. Wilson, Greg; Brough, Felicity; MacDonald, Alasdair // New Scientist;10/12/91, Vol. 132 Issue 1790, p53 

    Presents several books on computers. 'How to Write Parallel Programs: A First Course,' by Nicholas Carriero and David Gelernter; 'Introduction to Parallel Computing,' by T.G. Lewis, Hesham El-Rewini and Inkyu Kim; 'Exploring Parallel Processing,' by Edward Rietman; 'Parallel Algorithms in...

  • Optimizing I/O server placement for parallel I/O on switch-based irregular networks. Lin, Yih-Fang; Wang, Chien-Min; Wu, Jan-Jan // Journal of Supercomputing;Jun2006, Vol. 36 Issue 3, p201 

    In this paper, we study I/O server placement for optimizing parallel I/O performance on switch-based clusters, which typically adopt irregular network topologies to allow construction of scalable systems with incremental expansion capability. Finding optimal solution to this problem is...

  • Performance Comparison of Parallel Programming Environments for Implementing AIAC Algorithms. Bahi, Jacques; Contassot-Vivier, Sylvain; Couturier, Raphaël // Journal of Supercomputing;Mar2006, Vol. 35 Issue 3, p227 

    AIAC algorithms (Asynchronous Iterations Asynchronous Communications) are a particular class of parallel iterative algorithms. Their asynchronous nature makes them more efficient than their synchronous counterparts in numerous cases as has already been shown in previous works. The first goal of...

  • A multilevel parallel algorithm to solve symmetric Toeplitz linear systems. Bernabeu, Miguel O.; Alonso, Pedro; Vidal, Antonio M. // Journal of Supercomputing;Jun2008, Vol. 44 Issue 3, p237 

    This paper presents a parallel algorithm to solve a structured linear system with a symmetric-Toeplitz matrix. Our main result concerns the use of a combination of shared and distributed memory programming tools to obtain a multilevel algorithm that exploits the actual different hierarchical...

  • Non-Strict Execution in Parallel and Distributed Computing. Cristobal-Salas, Alfredo; Tchernykh, Andrei; Gaudiot, Jean-Luc; Lin, Wen-Yen // International Journal of Parallel Programming;Apr2003, Vol. 31 Issue 2, p77 

    This paper surveys and demonstrates the power of non-strict evaluation in applications executed on distributed architectures. We present the design, implementation, and experimental evaluation of single assignment, incomplete data structures in a distributed memory architecture and Abstract...

  • A Compositional Framework for Developing Parallel Programs on Two-Dimensional Arrays. Emoto, Kento; Hu, Zhenjiang; Kakehi, Kazuhiko; Takeichi, Masato // International Journal of Parallel Programming;Dec2007, Vol. 35 Issue 6, p615 

    Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, but development of efficient parallel programs on two-dimensional arrays is known to be hard. In this paper, we...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics