GDP: a paradigm for intertask communication in grid computing through distributed pipes

Authors:
D. Janakiram;M. Venkateswara Reddy;A. Vijay Srinivas;M. A. Maluk Mohamed;S. Santosh Kumar
Affiliations:
Distributed & Object Systems Lab, Dept. of Computer Science & Engg., Indian Institute of Technology Madras, Chennai, India;Distributed & Object Systems Lab, Dept. of Computer Science & Engg., Indian Institute of Technology Madras, Chennai, India;Distributed & Object Systems Lab, Dept. of Computer Science & Engg., Indian Institute of Technology Madras, Chennai, India;Distributed & Object Systems Lab, Dept. of Computer Science & Engg., Indian Institute of Technology Madras, Chennai, India;Distributed & Object Systems Lab, Dept. of Computer Science & Engg., Indian Institute of Technology Madras, Chennai, India
Venue:
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Year:
2005

Citing 6
Cited 0

Anonymous Remote Computing: A Paradigm for Parallel Programming on Interconnected Workstations

IEEE Transactions on Software Engineering
Wide-Area Computing: Resource Sharing on a Large Scale

Computer
DP: A Paradigm for Anonymous Remote Computation and Communication for Cluster Computing

IEEE Transactions on Parallel and Distributed Systems
Batrun: Utilizing Idle Workstations for Large-Scale Computing

IEEE Parallel & Distributed Technology: Systems & Technology
A Case for NOW (Networks of Workstations)

IEEE Micro
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

International Journal of High Performance Computing Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Existing grid models target purely data parallel applications without inter-task communication. This paper proposes a transparent programming model to support communicating parallel tasks in a wide area grid. The proposed grid model with Distributed Pipes (DP) abstraction named as, GDP, enables location independent intertask communication among processes on machines spread over a wide area distributed system. This approach enables anonymous migration of communicating parallel tasks adjusting to grid dynamics. The proposed model supports sequential load to coexist with parallel load. A prototype of the proposed model has been implemented over clusters of nodes spread across the Internet. A steady state equilibrium engineering problem was studied over the model. Performance studies show linear to super linear speed up for the application.