Communications of the ACM
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Paradigms for process interaction in distributed programs
ACM Computing Surveys (CSUR)
Transparent process migration: design alternatives and the sprite implementation
Software—Practice & Experience
Supercomputing out of recycled garbage: preliminary experience with Piranha
ICS '92 Proceedings of the 6th international conference on Supercomputing
Anonymous Remote Computing: A Paradigm for Parallel Programming on Interconnected Workstations
IEEE Transactions on Software Engineering
Communicating sequential processes
Communications of the ACM
Adaptive load migration systems for PVM
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Efficient Process Migration in the EMPS Multiprocessor System
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Moset: An anonymous remote mobile cluster computing paradigm
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part I
Avalanche Dynamics in Grids: Indications of SOC or HOT?
Proceedings of the 2005 conference on Self-Organization and Autonomic Informatics (I)
Netfiles: an enhanced stream-based communication mechanism
ISHPC'05/ALPS'06 Proceedings of the 6th international symposium on high-performance computing and 1st international conference on Advanced low power systems
GDP: a paradigm for intertask communication in grid computing through distributed pipes
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
| Hi-index | 0.00 |
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.