Results 1  10
of
64,648
AN OPEN STRUCTURE FOR PDE SOLVING SYSTEMS
, 1994
"... Most PDE solving systems have a closed structure. That is, they use a certain set of problems, methods, data structures, etc., that they support and all the software must adhere to the resulting standards. Of course there are systems which allow usc of a general purpose programming language (e.g., F ..."
Abstract
 Add to MetaCart
Most PDE solving systems have a closed structure. That is, they use a certain set of problems, methods, data structures, etc., that they support and all the software must adhere to the resulting standards. Of course there are systems which allow usc of a general purpose programming language (e
The Architecture of PDE Solving Systems'
, 1992
"... We presenL an architecture for high level systems for solving partial differential equations. The solution process is examined in some detail and components offuture systems systematically identified. We discuss the principal nonnumerical technical challenges: software integration and reuse, resour ..."
Abstract
 Add to MetaCart
We presenL an architecture for high level systems for solving partial differential equations. The solution process is examined in some detail and components offuture systems systematically identified. We discuss the principal nonnumerical technical challenges: software integration and reuse
GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems
 SIAM J. SCI. STAT. COMPUT
, 1986
"... We present an iterative method for solving linear systems, which has the property ofminimizing at every step the norm of the residual vector over a Krylov subspace. The algorithm is derived from the Arnoldi process for constructing an l2orthogonal basis of Krylov subspaces. It can be considered a ..."
Abstract

Cited by 2076 (41 self)
 Add to MetaCart
We present an iterative method for solving linear systems, which has the property ofminimizing at every step the norm of the residual vector over a Krylov subspace. The algorithm is derived from the Arnoldi process for constructing an l2orthogonal basis of Krylov subspaces. It can be considered
The Weakest Failure Detector for Solving Consensus
, 1996
"... We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In [CT91], it is shown that 3W, a failure detector that provides surprisingly little information about which processes have crashed, is sufficien ..."
Abstract

Cited by 484 (21 self)
 Add to MetaCart
We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In [CT91], it is shown that 3W, a failure detector that provides surprisingly little information about which processes have crashed
Unreliable Failure Detectors for Reliable Distributed Systems
 Journal of the ACM
, 1996
"... We introduce the concept of unreliable failure detectors and study how they can be used to solve Consensus in asynchronous systems with crash failures. We characterise unreliable failure detectors in terms of two properties — completeness and accuracy. We show that Consensus can be solved even with ..."
Abstract

Cited by 1094 (19 self)
 Add to MetaCart
We introduce the concept of unreliable failure detectors and study how they can be used to solve Consensus in asynchronous systems with crash failures. We characterise unreliable failure detectors in terms of two properties — completeness and accuracy. We show that Consensus can be solved even
Memory Coherence in Shared Virtual Memory Systems
, 1989
"... This paper studies the memory coherence problem in designing said inaplementing a shared virtual memory on looselycoupled multiprocessors. Two classes of aIgoritb. ms for solving the problem are presented. A prototype shared virtual memory on an Apollo ring has been implemented based on these a ..."
Abstract

Cited by 957 (17 self)
 Add to MetaCart
This paper studies the memory coherence problem in designing said inaplementing a shared virtual memory on looselycoupled multiprocessors. Two classes of aIgoritb. ms for solving the problem are presented. A prototype shared virtual memory on an Apollo ring has been implemented based
Time, Clocks, and the Ordering of Events in a Distributed System
, 1978
"... The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events. The use of the total ordering i ..."
Abstract

Cited by 2869 (14 self)
 Add to MetaCart
The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events. The use of the total ordering
Distributed Snapshots: Determining Global States of Distributed Systems
 ACM TRANSACTIONS ON COMPUTER SYSTEMS
, 1985
"... This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps to s ..."
Abstract

Cited by 1208 (6 self)
 Add to MetaCart
to solve an important class of problems: stable property detection. A stable property is one that persists: once a stable property becomes true it remains true thereafter. Examples of stable properties are “computation has terminated,” “the system is deadlocked” and “all tokens in a token ring have
Virtual time and global states of distributed systems.
 Proc. Workshop on Parallel and Distributed Algorithms,
, 1989
"... Abstract A distributed system can be characterized by the fact that the global state is distributed and that a common time base does not exist. However, the notion of time is an important concept in every day life of our decentralized \ r eal world" and helps to solve problems like getting a c ..."
Abstract

Cited by 744 (5 self)
 Add to MetaCart
Abstract A distributed system can be characterized by the fact that the global state is distributed and that a common time base does not exist. However, the notion of time is an important concept in every day life of our decentralized \ r eal world" and helps to solve problems like getting a
The RungeKutta discontinuous Galerkin method for conservation laws V: multidimensional systems
, 1997
"... This is the fifth paper in a series in which we construct and study the socalled RungeKutta Discontinuous Galerkin method for numerically solving hyperbolic conservation laws. In this paper, we extend the method to multidimensional nonlinear systems of conservation laws. The algorithms are describ ..."
Abstract

Cited by 508 (44 self)
 Add to MetaCart
This is the fifth paper in a series in which we construct and study the socalled RungeKutta Discontinuous Galerkin method for numerically solving hyperbolic conservation laws. In this paper, we extend the method to multidimensional nonlinear systems of conservation laws. The algorithms
Results 1  10
of
64,648