Distributed Parallel Computing Using Navigational Programming

Message Passing (MP) and Distributed Shared Memory (DSM) are the two most common approaches to distributed parallel computing. MP is difficult to use, whereas DSM is not scalable. Performance scalability and ease of programming can be achieved at the same time by using navigational programming (NavP...

Full description

Saved in:
Bibliographic Details
Published in:International journal of parallel programming 2004-02, Vol.32 (1), p.1-37
Main Authors: Pan, Lei, Lai, Ming Kin, Noguchi, Koji, Huseynov, Javid J., Bic, Lubomir F., Dillencourt, Michael B.
Format: Article
Language:English
Subjects:
Distributed shared memory
Studies
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Message Passing (MP) and Distributed Shared Memory (DSM) are the two most common approaches to distributed parallel computing. MP is difficult to use, whereas DSM is not scalable. Performance scalability and ease of programming can be achieved at the same time by using navigational programming (NavP). This approach combines the advantages of MP and DSM, and it balances convenience and flexibility. Similar to MP, NavP suggests to its programmers the principle of pivot-computes and hence is efficient and scalable. Like DSM, NavP supports incremental parallelization and shared variable programming and is therefore easy to use. The implementation and performance analysis of real-world algorithms, namely parallel Jacobi iteration and parallel Cholesky factorization, presented in this paper supports the claim that the NavP approach is better suited for general-purpose parallel distributed programming than either MP or DSM. [PUBLICATION ABSTRACT]
ISSN:0885-7458
1573-7640
DOI:10.1023/B:IJPP.0000015563.36375.17