The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—This paper explores the transparent programmability of communicating parallel tasks in a Network of Workstations (NOW). Programs which are tied up with specific machines will not be resilient to the changing conditions of a NOW. The <it>Distributed Pipes (DP)</it> model enables location independent intertask communication among processes across machines. This approach enables migration of communicating parallel tasks according to runtime conditions. A transparent programming model for a parallel solution to <it>Iterative Grid Computations</it> using <it>DP</it> is also proposed. Programs written using the model are resilient to the heterogeneity of nodes and changing conditions in the NOW. They are also devoid of any network related code. The design of runtime support and function library support are presented. An engineering problem, namely, the <it>Steady State Equilibrium Problem</it>, is studied over the model. The performance analysis shows the speedup due to parallel execution and scaled down memory requirements. We present a case where the effect of communication overhead can be nullified to achieve a linear to super-linear speedup. The analysis discusses performance resilience of <it>Iterative Grid Computations</it> and characterizes synchronization delay among subtasks and the effect of network overhead and load fluctuations on performance. The performance saturation characteristics of such applications are also studied.</p>
Parallel programming, data parallelism, task parallelism, network of workstations, loosely coupled distributed systems, distributed problem solving, distributed pipes, steady state distribution.

B. K. Johnson, R. Karthikeyan and D. Janaki Ram, "DP: A Paradigm for Anonymous Remote Computation and Communication for Cluster Computing," in IEEE Transactions on Parallel & Distributed Systems, vol. 12, no. , pp. 1052-1065, 2001.
84 ms
(Ver 3.3 (11022016))