ویراساینس.
سند علمی

Transparent Fault Tolerance for Parallel Applications on Networks of Workstations

Daniel J. Scales, Monica S. Lam

چکیده

This paper describes a new method for providing transparent fault tolerance for parallel applications on a network of workstations. We have designed our method in the context of shared object system called SAM, a portable run-time system which provides a global name space and automatic caching of shared data. SAM incorporates a novel design intended to address the problem of the high communication overheads in distributed memory environments and is implemented on a variety of distributed memory platforms. Our fundamental approach to providing fault tolerance is to ensure the replication of all data on more than one workstation using the dynamic caching already provided by SAM. The replicated data is accessible to the local processor like other cached data, making access to shared data faster and potentially offsetting some of the fault tolerance overhead. In addition, our method uses information available in SAM applications on how processes access shared data to enable several optimizations which reduce the fault-tolerance overhead. We have built an implementation of our faulttolerance method in SAM for heterogeneous networks of workstations running PVM3. In this paper, we present our fault-tolerance method and describe its implementation in detail. We give performance results and overhead numbers for several large SAM applications running on a cluster of Alpha workstations connected by an ATM network. Our method is successful in providing transparent fault tolerance for parallel applications running on a network of workstations and is unique in requiring no global synchronizations and no disk operations to a reliable file server. Author’s current address: Digital Equipment Corporation Western Research Laboratory, 250 University Ave., Palo Alto, CA 94301. This research was supported in part by DARPA contract DABT6391-K-0003.

اسناد مشابه

  • Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules: A Programmer's Perspective

    سند علمی۲۰۰۶Research Results of the DICS ProgramSebastian Gerlach, Basile Schaeli, Roger D. Hersch

    Dynamic Parallel Schedules (DPS) is a flow graph based framework for developing parallel applications on clusters of workstations. The DPS flow graph execution model enables automatic pipelined parallel execution of applications. DPS supports graceful degradation of parallel appl

  • Fault Tolerant Parallel Image Generation on a Workstation Network

    سند علمی۲۰۰۷Karim R. Mazouni, Geurt de Raad

    Image generation for computer movies is a good candidate application for parallelisation. This application was used as a starting point to design a fault tolerant distributed computing environment aimed to run parallel applications. The paper rst describes the context of this wor

  • Application Level Fault Tolerance in Heterogenous Networks of Workstations

    سند علمی۱۹۹۷J. Parallel Distrib. Comput.Adam Beguelin, Erik Seligman, Peter Stephan

    We have explored methods for checkpointing and restarting processes within the Distributed object migration environment (Dome), a C++ library of data parallel objects that are automatically distributed over heterogeneous networks of workstations (NOWs). System level checkpointing

  • Application-transparent fault tolerance in distributed systems

    سند علمی۱۹۹۴CDSThomas Becker

    We present a new software architecture in which all concepts necessary to achieve fault tolerance can be added to an application automatically without any source code changes. As a case study, we consider the problem of providing a reliable service despite node failures by execut

  • Fault Tolerant Hierarchical Interconnection Network for Parallel Computers (fth)

    سند علمی۲۰۱۲Rajashree Sukla, Chinmaya Kumar Nayak

    In this paper we introduce a new interconnection network Fault Tolerant Hierarchical Interconnection network for parallel Computers denoted by FTH(k, 1).This network has fault tolerant hierarchical structure which overcomes the fault tolerant properties of Extended hypercube(EH).

  • Modular fault tolerance in a network-transparent language

    سند علمی۲۰۱۱Peter Van Roy

    A programming system is said to be network transparent if program source text executed over several nodes gives the same result as if it were executed on a single node, provided network delays are ignored and no failure occurs. The system is said to be network aware if programs c