Memory-efficient self stabilizing protocols for general networks
Proceedings of the 4th international workshop on Distributed algorithms
Virtual private networks
Architectural Models for Resource Management in the Grid
GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
A Resource Management Architecture for Metacomputing Systems
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Time Optimal Self-Stabilizing Spanning Tree Algorithms
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Resource Manager for Globus-Based Wide-Area Cluster Computing
IWCC '99 Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing
Condor-G: A Computation Management Agent for Multi-Institutional Grids
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Hi-index | 0.00 |
We describe design and implementation of virtual private grid (VPG), a shell that can utilize many machines distributed over multiple subnets. VPG works around common security policies (e.g., firewall, private IP, DHCP) that restrict communication between machines and even break uniqueness of IP addresses. VPG provides the following functions: (1) a unique nickname to each machine that does not depend on a DNS name or a fixed IP address; (2) job submissions to any nicknamed machine; (3) redirections from/to a file on any nicknamed machine; (4) pipes between commands executed on any nicknamed machine. VPG implements the above functions by constructing a self-stabilizing spanning tree among machines and forwarding messages via a path in the tree. We ran VPG on about 100 nodes (270 CPUs) and measured a turn around time of a small job submission with VPG and other tools: rsh, SSH, and globus-job-run. The experimental result shows that VPG can submit a job faster than SSH and globus-job-run, since VPG performs authentication only when it constructs a tree.