D. E. Bakken and R. D. Schlichting. Supporting fault-tolerant parallel programming in Linda. IEEE Transactions on Parallel and Distributed Systems, 6(3):287--302, Mar. 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....[5] A number of systems (based on algorithms that perform a set of tasks) have been developed to incorporate fault tolerance into distributed applications. They use various techniques such as random scheduling of tasks [11] scheduling based on Manager Worker models ( 2] stable tuple spaces ([1]) This paper focuses on an analytical performance model ( 14] and on a prototype ( 15] for analyzing systems that perform a fixed set of tasks (i.e. no arrival process) The former is modeled as a transient M G P queue while the latter is based on an asynchronous algorithm. The model and the ....

D. Bakken, R. Schlichting, "Supporting FaultTolerant Parallel Programming in Linda", IEEE, Vol. 6, No. 3, 1995.

....practicality in developing distributed systems. When constructing an analytic performance model, it is imperative that one focus on a particular application domain. In the eld of high performance scienti c computing, applications that are based on processing a bag of tasks form a large domain [2, 3, 27]. These applications are also referred to as iterative, grid and data parallel. Some examples are: Simulation, Image Processing, Discrete Optimization, Transformation, and Computational Geometry. A task can easily be de ned in these applications. For example, in image processing, classifying a ....

D. Bakken, R. Schlichting, \Supporting Fault-Tolerant Parallel Programming in Linda", IEEE, Vol. 6, No. 3, March 1995.

....processes. Their client server approach is significantly different from that of LIME, as we target mobile ad hoc applications with implicit access to the remote data of other hosts, and support mobile agents. Distributed Linda implementations have been studied extensively for fault tolerance [36, 2] and data availability [27] The main disadvantage with these approaches is their need for high degrees of connectivity among the hosts of the distributed portions of the tuple spaces, a property inherently not present in the mobile environment. One of the first applications of Linda to mobility ....

D.E. Bakken and R. Schlichting. Supporting fault-tolerant parallel programming in Linda. IEEE Transactions on Parallel and Distributed Systems, 1994.

....is a new technology that goes beyond the possibilities offered by message passing. Its advantages concerning its conceptually higher abstraction of the underlying hardware, and its advantages concerning caching and replication have intensively been discussed in scientific literature (see e.g. [1 3]) An obvious tendency towards virtual shared memory replacing or accompanying client server technology can be observed. CeRse concepts CORSO is a layered software component for the development of robust and parallel applications that supports the virtual shared memory paradigm. It has been ....

D. E. Bakken, Supporting fault-tolerant parallel programming in LINDA, Ph.D. thesis, University of Arizona, Department of Computer Science, 1994.

....but also ones which are tailor made for requirements such as speed, security and fault tolerance. For the above reasons, many researchers concluded that it was necessary for Linda to embrace multiple distinct tuple spaces and a number of prototype solutions have appeared, as described below [Bakken,94] Carriero,94] Douglas,95] Hupfer,90] Minsky,94] FT Linda is a variant of Linda designed to support fault tolerant applications through properties such as tuple stability, multiple operation atomicity and strong semantics [Bakken,94] The FT Linda model features a collection of ....

.... prototype solutions have appeared, as described below [Bakken,94] Carriero,94] Douglas,95] Hupfer,90] Minsky,94] FT Linda is a variant of Linda designed to support fault tolerant applications through properties such as tuple stability, multiple operation atomicity and strong semantics [Bakken,94] The FT Linda model features a collection of processors connected by a network that have no physically shared memory. FT Linda supports multiple tuple spaces which can be of either shared or private scope. Shared tuple spaces are accessible by multiple processes while private tuple spaces ....

[Article contains additional citation context not shown here]

D. E. Bakken, "Supporting Fault-Tolerant Parallel Programming in Linda", Ph.D. Thesis, Department of Computer Science, University of Arizona, Tucson, Arizona 85271, U.S., 8th August 1994.

....should maintain a consistent view of a distributed data space, which is a classical problem. Full P2P systems devoted to file storage and retrieval have implemented broker faut tolerance based on redundancy. Failure resilient distributed data space at the programming level have been defined in [8] and in JavaSpaces. 4.1 Volatile Workers At the worker level, a GCS has to ensure that the computation will make some progress, at long as functional resources are available. However, defining what is a functional resource is somehow blurred in such systems. The most traditional way is to ....

D. E. Bakken and R. D. Schlichting. Supporting fault-tolerant parallel programming in Linda. IEEE Trans. on Parallel and Distributed Systems, 6(3):287--302, 95.

....in a reliable storage. In the event of a process failure, either the a ected process or the whole computation is restarted from its last checkpointed state. In the eld of high performance scienti c computing, applications that are based on processing a bag of tasks form a large domain [3, 4, 11]. Such applications are also referred to as iterative, grid and data parallel. Some examples are: Simulation, Image Processing, Discrete Optimization, Transformation, and Computational Geometry. A task can easily be A preliminary version of this paper appeared in [13] de ned in these ....

....will be less, however the dynamic load balancing phase will not be very ecient. Therefore, one can structure an application as in case 1 to make the dynamic load balancing phase ecient and use r 1 to reduce the overhead of communication) 2 Related Work The FT Linda programming model [3] allows fault tolerant applications to be written using stable tuple spaces (TS) and atomic execution of tuple space operations. The TSs are replicated in order to tolerate processor failures and they are updated using atomic multicast. This model, initially stores the bag of tasks, in the TS. ....

D. Bakken, R. Schlichting, \Supporting Fault-Tolerant Parallel Programming in Linda," IEEE, Vol. 6, No. 3, March 1995.

....parallel computations; for special problems much simpler solutions exist [6] However, also parallel programming models that are more abstract than message passing should allow to deal with fault tolerance in a simpler way. While this is not yet completely true for the coordination language Linda [1], the functional programming model provides this potential to a large degree [7] Distributed Maple runs programs in the imperative language of Maple, but its parallel programming model is essentially functional : it provides the ability to spawn function applications as concurrent tasks and to ....

D. E. Bakken and R. D. Schlichting. Supporting Fault-Tolerant Parallel Programming in Linda. IEEE TPDS, 6(3):287-302, March 1995.

....Piranha [24] is built on top of Linda that dynamically balances system load across available machines. Piranha, like the fish, aggressively harnesses idle machine s resources during program execution. However, it does not handle failures. Extensions to handle failures are implemented in FT Linda [5] and PLinda [32] 94 7.1.3 Memory Coherence Models of the Shared Memory Memory consistency is an important aspect in shared memory systems that deal with the question: what is the correct results when multiple tasks read and write to the same memory location. Maintaining coherent shared memory ....

....fault tolerance separately and provide as an 97 add on feature. Fault tolerant techniques includes check pointing, replication, and migration. Systems that provides fault tolerance features with these techniques are CIRCUS[17] LOCUS[47] Clouds[19] Fail safe PVM [44] PLinda [32] and FT Linda [5]. These systems often provide fault tolerance features independent to other system functions and require user intervention when failures are present. Calypso [6] Chime [51] and our system, belong to a di#erent group in which load balancing and fault tolerance are naturally supported by the ....

D. Bakken and R. Schlichting. Supporting fault-tolerant parallel programming in Linda. Technical Report TR93-18, The University of Arizona, 1993.

....we can maintain the description of all the tasks and all the results collected from the completed tasks in reliable storage and design processes to execute each task atomically. In fact, such a scheme has already been demonstrated in fault tolerant parallel computing systems such as FT Linda[4] and PLinda[38] ffl Using workstations connected by LANs or even WANs, large scale high performance parallel processing is possible for these problems because computation basically consists of a large number of mostly independent tasks. 1 However, it is difficult for the end user to find ....

....Upon disagreement, the minority is ignored. 1.3.3 Fault tolerant Programming Languages Various fault tolerant programming languages have been developed to ease the task of constructing fault tolerant programs. Examples are Argus[47] Avalon[26] Fault tolerant Concurrent C[19] FT Linda[4], Orca[41] and FT SR[56] In general, these fault tolerant programming languages are distinguished by what program structuring paradigms they support since they all assume the fail stop processor failure model. Argus and Avalon support the object action model. Reliability and concurrency control ....

[Article contains additional citation context not shown here]

D. E. Bakken and R. D. Schlichting. Supporting fault tolerant parallel programming in Linda. IEEE Transactions on Parallel and Distributed Systems, 1994.

....been addressed separately from the issues of parallel processing. There have been three major mechanisms: checkpointing, replication and process groups. Such approaches have been implemented in CIRCUS [Coo85] LOCUS [PWC 81] and Clouds [DLA 90] Isis [BJ87] Fail safe PVM [LFS93] FT Linda [BS93], and Plinda [AS91] However, all these systems add significant overhead, even when there is no failure. More recently several prominent projects have similar goals to us. These include the NOW [Pat 95] project, the HPC [MMB 94] project, The Cilk project [BL97] and the Dome [NAB 95] project. All ....

D. Bakken and R. Schlichting. Supporting FaultTolerant Parallel Programming in Linda. Technical Report TR93-18, The University of Arizona, 1993.

....input data and a way to identify which software should be used to process that data. Again, both NetSolve and Ninf comply. A farming job is one composed of a large number of independent requests that may be serviced simultaneously. This is sometimes referred to as the bag of tasks model [24, 25]. Farming jobs fall into the class of embarrassingly parallel programs, for which it is very clear how to partition the jobs for parallel programming environments. Many important classes of problems, such as Monte Carlo simulations (e.g. 26] and parameter space searches (e.g. 7] fall into ....

D. E. Bakken and R. D. Schilchting. Supporting fault-tolerant parallel programming in linda. IEEE Transactions on Parallel and Distributed Systems, 6(3):287--302, March 1995.

....when reclaimed by their owners. In fact, our daemons are modeled after Piranha. But unlike all of the previous systems, Calypso can mask process crashes. There have been several proposals to provide fault tolerance, mostly by augmenting an existing system. They include FT PVM [32] FT Linda [5], PLinda [19] and Orca [20] A notable exception is DOME [1] that incorporated fault tolerance and load balancing form the onset. These systems provide fault tolerance by using well known mechanisms: checkpointing the data, logging messages, and using reliable atomic broadcasts. In contrast, ....

D. Bakken and R. Schlichting. Supporting fault-tolerant parallel programming in Linda. Technical Report TR9318, The University of Arizona, 1993.

....extensively in the database community. A good general reference is [6] However, these mechanisms are generally perceived as costly and require the use of file I O (logging) which is often prohibitive in the global computing setting. One example of such a relatively costly approach is FT Linda [2]. The original Linda definition ( 35] see also Section 5) does not consider fault tolerance mechanisms. FT Linda is a version of Linda that addresses these concerns by providing two kinds of enhancements: stable tuple spaces, in which tuple values are guaranteed to persist across failures, and ....

D. E. Bakken and R. D. Schlichting. Supporting Fault-Tolerant Parallel Programming in Linda. IEEE Transactions on Parallel and Distributed Systems, 6(3):287--302, Mar. 1995.

.... This has been explored by researchers for transparent runtime libraries that implement distributed shared memory [8,11,22,39] and for programs that make explicit use of data structures with shared memory semantics [5,33] Relatedly, there has been research on fault tolerant shared tuple spaces [3] and other models of parallel programming such as farming [36] master slave [4] and coarse grained dataflow [14] that are more restrictive than general message passing, and facilitate the addition of fault tolerance and computation migration. A great strength of NetSolve is that if a server ....

D. E. Bakken and R. D. Schilchting. Supporting Fault-Tolerant Parallel Programming in Linda. IEEE Transactions on Parallel and Distributed Systems, 6(3):287--302, March 1995.

....Operating Systems (RTOS) There has been much less done in the area of fault tolerant parallel processing systems. Most of the work has concentrated on fault tolerant hardware, e.g. faulttolerant networks and system reconfiguration after a fault. There has been some though, for example, FT Linda [3], PLinda [13] Orca [14] Calypso [4] and Fail safe PVM [15] These systems use a combination of well known mechanisms such as replication, transactions, message logging, or checkpoints and rollbacks to provide fault tolerance. In Mentat, regular objects do not hold state and thus the overhead ....

D. Bakken and R. Schlichting, "Supporting fault-tolerant parallel programming in Linda," Technical Report TR93-18, The University of Arizona, 1993.

.... [KS90,KS91] making the tuple space and processes working on it recoverable, and transaction based or transaction style like language extensions enabling the programmer to define a sequence of tuple space operations as an atomic operation which will be evaluated completely or not at all [BDE94,BS93] In LiPS version 2.4, we follow the approach of [KS90,KS91] Its main advantages allowing (efficient) independent checkpoint generation and not extending the set of tuple space operations have been the pros of our decision. One main drawback, namely the additional cost for message logging, ....

Bakken D. E. and Schlichting R.D. Supporting Fault-Tolerant Parallel Programming in Linda. Technical Report 93.18, Department of Computer Science, The University of Arizona, 6 1993.

....in the system design is a N Fault Tolerant Tuple Space Machine. Our current approach to its implementation is presented next together with its runtime data. 2 Related work There are several approaches to integrate different levels of fault tolerance into tuple space based applications. Following [BDE94] these approaches can be divided 3 Unix is licensed exclusively through X Open Company Limited. 3. Generative Communication 3 into extensions to the tuple space runtime system [Xu 88,LX89,CKM92,PTHR93] making the tuple space fault tolerant, resilient data and processes [KS90,KS91] making the ....

.... processes [KS90,KS91] making the tuple space and processes working on it recoverable, and transaction based or transaction style like language extensions enabling the programmer to define a sequence of tuple space operations as an atomic operation which will be evaluated completely or not at all [BDE94,BS93] In LiPS version 2.4, we follow the approach of [KS90,KS91] Its main advantages allowing (efficient) independent checkpoint generation and not extending the set of tuple space operations have been the pros of our decision. One main drawback, namely the additional cost for message ....

Bakken D. E. Supporting Fault-Tolerant Parallel Programming in Linda. PhD thesis, The University of Arizona, 6 1994. Department of Computer Science.

.... [KS90,KS91] making tuple space and processes working on it recoverable, and transaction based or transaction style like language extensions enabling the programmer to define a sequence of tuple space operations as an atomic operation which will be evaluated completely or not at all [BDE94,BS93] In LiPS version 2.4 we follow the approach to resilient data and processes. A more detailed description of the design and the implementation of this concept is given in [Set95] 3 Generative Communication In order to implement distributed applications, a programmer must be supplied with ....

Bakken D. E. and Schlichting R.D. Supporting Fault-Tolerant Parallel Programming in Linda. Technical Report 93.18, Department of Computer Science, The University of Arizona, 6 1993.

....well suited system design. The last section presents the design of our Fault Tolerant Tuple Space Machine along with its integration into the LiPS system. 2 Related work There are different approaches to integrate different levels of fault tolerance into tuple space based applications. Following [BDE94] these approaches can be divided into extensions to the tuple space runtime system [Xu 88,LX89,CKM92,PTHR93] making tuple space fault tolerant, resilient data and processes [KS90,KS91] making tuple space and processes working on it recoverable, and transaction based or transaction style like ....

.... and processes [KS90,KS91] making tuple space and processes working on it recoverable, and transaction based or transaction style like language extensions enabling the programmer to define a sequence of tuple space operations as an atomic operation which will be evaluated completely or not at all [BDE94,BS93] In LiPS version 2.4 we follow the approach to resilient data and processes. A more detailed description of the design and the implementation of this concept is given in [Set95] 3 Generative Communication In order to implement distributed applications, a programmer must be supplied with ....

Bakken D. E. Supporting Fault-Tolerant Parallel Programming in Linda. PhD thesis, The University of Arizona, 6 1994. Department of Computer Science.

....when reclaimed by their owners. In fact, our daemons are modeled after Piranha. But unlike all of the previous systems, Calypso can mask process crashes. There have been several proposals to provide fault tolerance, mostly by augmenting an existing system. They include FT PVM [32] FT Linda [5], PLinda [19] and Orca [20] A notable exception is DOME [1] that incorporated fault tolerance and load balancing form the onset. These systems provide fault tolerance by using well known mechanisms: checkpointing the data, logging messages, and using reliable atomic broadcasts. In contrast, ....

D. Bakken and R. Schlichting. Supporting faulttolerant parallel programming in Linda. Technical Report TR93-18, The University of Arizona, 1993.

No context found.

D. E. Bakken and R. D. Schlichting. Supporting fault-tolerant parallel programming in Linda. IEEE Transactions on Parallel and Distributed Systems, 6(3):287--302, Mar. 1995.

No context found.

D.E. Bakken and R. Schlichting. Supporting fault-tolerant parallel programming in Linda. IEEE Transactions on Parallel and Distributed Systems, 1994.

No context found.

D. Bakken, and R. Schlichting. Supporting Fault-Tolerant Parallel Programming in Linda. Technical report, University of Arizona, Tucson, U.S.A., 1993

No context found.

D. Bakken, R. Schlichting, "Supporting Fault-Tolerant Parallel Programming in Linda", IEEE, Vol. 6, No. 3, March 1995.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC