Advertisement

Design and Implementation of an RPC-Based ARC Kernel

  • L. Aruna
  • Yamini Sharma
  • Rushikesh K. Joshi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2110)

Abstract

Anonymous Remote Computing (ARC) is a programming paradigm for parallel and distributed computing on workstation clusters. Workstation clusters are characterized by heterogeneity, node/link failures and changing loads. Typically, a parallel program may not have any control over the changing load patterns. Stealing idle cycles on such systems require that parallel programs should adapt themselves dynamically to changing load patterns. We present a design and implementation of an RPC-based ARC kernel supporting parallel programming through ARC Function Calls in such an environment. ARC Function Calls in a C program are executed on anonymous remote machines making the distribution transparent to the parallel programmer. A Horse Power Factor (HPF) primitive characterizes load and speed for the use of task distribution in a parallel program. The kernel supports fault tolerance by awarding failed tasks to available nodes. Nodes can join and leave dynamically at any time during execution. The kernel was designed using object oriented techniques and implemented as a collection of collaborating RPC servers running on a a Linux cluster. The performance and overheads of implementation have also been discussed.

Keywords

Travel Salesman Problem Task Space Tuple Space Message Queue Object Orient Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rushikesh K Joshi, D. Janaki Ram.:Anonymous Remote Computing, A paradigm for Parallel Programming on interconnected Workstations, IEEE Computer, 25(1):75–90, January 1994.Google Scholar
  2. 2.
    Jack Dongarra, Weicheng Jiang, Robert Manchek, Vaidy Sunderam, Al Geist, Adam Beguelin.: PVM 3 User’s Guide and Reference Manual, MIT Press, 1994.Google Scholar
  3. 3.
    David Gelernter, Nicholas Carriero.: The S/Net’s Linda Kernel, ACM Transactions on Computer Systems, 4(2):110–129, May 1996.Google Scholar
  4. 4.
    S.W. Otto, O.C. Martin.: Combining Simulated Annealing with Local Search Heuristics, Annals of Operations Research, 63:57–75, 1996.zbMATHCrossRefGoogle Scholar
  5. 5.
    Benjamin Wah, Pankaj Mehra.: Synthetic Workload Generation for Load Balancing Experiments, IEEE Parallel and Distributed Technology, 3(2):4–19, Summer 1995.CrossRefGoogle Scholar
  6. 6.
    G. Ricart, A.K. Agrawala.: An Optimal Algorithm for Mutual Exclusion in Computer Networks, ACM Communications, 24(1):9–17, January 1981.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • L. Aruna
  • Yamini Sharma
  • Rushikesh K. Joshi
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of TechnologyMumbaiIndia

Personalised recommendations