This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
DP: A Paradigm for Anonymous Remote Computation and Communication for Cluster Computing
October 2001 (vol. 12 no. 10)
pp. 1052-1065
ASCII Text
x 
 
Binu K. Johnson, R. Karthikeyan, D. Janaki Ram, "DP: A Paradigm for Anonymous Remote Computation and Communication for Cluster Computing," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 10, pp. 1052-1065, October, 2001.
 
 
BibTex
x
 
@article{ 10.1109/71.963417,
author = {Binu K. Johnson and R. Karthikeyan and D. Janaki Ram},
title = {DP: A Paradigm for Anonymous Remote Computation and Communication for Cluster Computing},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {12},
number = {10},
issn = {1045-9219},
year = {2001},
pages = {1052-1065},
doi = {http://doi.ieeecomputersociety.org/10.1109/71.963417},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - DP: A Paradigm for Anonymous Remote Computation and Communication for Cluster Computing
IS - 10
SN - 1045-9219
SP1052
EP1065
EPD - 1052-1065
A1 - Binu K. Johnson,
A1 - R. Karthikeyan,
A1 - D. Janaki Ram,
PY - 2001
KW - Parallel programming
KW - data parallelism
KW - task parallelism
KW - network of workstations
KW - loosely coupled distributed systems
KW - distributed problem solving
KW - distributed pipes
KW - steady state distribution.
VL - 12
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 

Abstract—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 Distributed Pipes (DP) 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 Iterative Grid Computations using DP 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 Steady State Equilibrium Problem, 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 Iterative Grid Computations 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.

[1] M. Litzkow and M. Solomon, “Supporting Checkpointing and Process Migration Outside the UNIX Kernel,” Proc. Usenix Winter Conf., pp. 283-290, Jan. 1992.
[2] D. Gelernter and D. Kaminsky, “Supercomputing Out of Recycled Garbage: Preliminary Experience with Piranha,” Proc. Sixth ACM Int’l Conf. Supercomputing, ACM, New York, 1991, pp. 417-427.
[3] J. Casas, R. Konuru, S.W. Otto, R. Prouty, and J. Walpole, “Adaptive Load Migration Systems for PVM,” Proc. Supercomputing‘94, pp. 390–399, Nov. 1994.
[4] R.K. Joshi and D. Janaki Ram, “Anonymous Remote Computing: A Paradigm for Parallel Programming on Interconnected Workstations,” IEEE Trans. Software Eng., vol. 25, no. 1, pp. 75-90, Jan. 1999.
[5] F. Douglis and J. Ousterhout, "Transparent Process Migration: Design Alternatives and the Sprite Implementation," Software Practice&Experience, Vol. 21, Aug. 1991, pp. 757-785.
[6] D. Cheriton, "The V Distributed System," Comm. ACM, vol. 31, no. 3, pp. 314-333, Mar. 1988.
[7] G.J.W. Van Dijk and M.J. Van Gils, “Efficient Process Migration in the EMPS Multiprocessor System,” Proc. Sixth Int'l Parallel Processing Symp., pp. 58-66, Mar. 1992.
[8] G. Fox,M. Johnson,G. Lyzenga,S. Otto,J. Salmon,, and D. Walker,Solving Problems on Concurrent Processors, Vol. I: General Techniques andRegular Problems.Englewood Cliffs, N.J.: Prentice Hall 1988.
[9] T.H. Sreenivas, “A Class of Suboptimal Algorithms for Schedule Optimization Problems,” PhD thesis, Dept. of Computer Science and Eng., Indian Insti. of Technology Madras, Chennai, July 1998.
[10] C.A.R. Hoare,“Communicating sequential processes,” Comm. of the ACM, vol. 21, no. 8, pp. 666-677, Aug. 1978.
[11] G. Andrews, “Paradigms for Process Interaction in Distributed Programs,” ACM Computing Surveys, Vol. 23, No. 1, Mar. 1991, pp. 49‐90.

Index Terms:
Parallel programming, data parallelism, task parallelism, network of workstations, loosely coupled distributed systems, distributed problem solving, distributed pipes, steady state distribution.
Citation:
Binu K. Johnson, R. Karthikeyan, D. Janaki Ram, "DP: A Paradigm for Anonymous Remote Computation and Communication for Cluster Computing," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 10, pp. 1052-1065, Oct. 2001, doi:10.1109/71.963417
Usage of this product signifies your acceptance of the Terms of Use.