Results 1  10
of
31
Distributed pC++: Basic Ideas for an Object Parallel Language
 Scientific Programming
"... pC++ is an objectparallel extension to the C++ programming language. This paper describes the current language definition and illustrates the programming style. Examples of parallel linear algebra operations are presented and a fast poisson solver is described in complete detail. ..."
Abstract

Cited by 105 (2 self)
 Add to MetaCart
pC++ is an objectparallel extension to the C++ programming language. This paper describes the current language definition and illustrates the programming style. Examples of parallel linear algebra operations are presented and a fast poisson solver is described in complete detail.
A Unified Vector/Scalar FloatingPoint Architecture
, 1989
"... research relevant to the design and application of high performance scientific computers. We test our ideas by designing, building, and using real systems. The systems we build are research prototypes; they are not intended to become products. There is a second research laboratory located in Palo Al ..."
Abstract

Cited by 33 (8 self)
 Add to MetaCart
research relevant to the design and application of high performance scientific computers. We test our ideas by designing, building, and using real systems. The systems we build are research prototypes; they are not intended to become products. There is a second research laboratory located in Palo Alto, the Systems Research Center (SRC). Other Digital research groups are located in Paris (PRL) and in Cambridge,
Overview of recent supercomputers
, 1997
"... In this report we give an overview of parallel and vector computers which are currently available or will become available within a short time frame from vendors; no attempt is made to list all machines that are still in the research phase. The machines are described according to their architectura ..."
Abstract

Cited by 30 (2 self)
 Add to MetaCart
In this report we give an overview of parallel and vector computers which are currently available or will become available within a short time frame from vendors; no attempt is made to list all machines that are still in the research phase. The machines are described according to their architectural class. Shared and distributed memory SIMD and MIMD machines are discerned. The information about each machine is kept as compact as possible. Moreover, no attempt is made to quote prices as these are often even more elusive than the performance of a system.
The Unsymmetric Lanczos Algorithms And Their Relations To Padé Approximation, Continued Fractions, And The QD Algorithm
, 1990
"... . First, several algorithms based on the unsymmetric Lanczos process are surveyed: the biorthogonalization (BO) algorithm for constructing a tridiagonal matrix T similar to a given matrix A (whose extreme spectrum is sought typically); the "BOBC algorithm", which generates directly the LU ..."
Abstract

Cited by 25 (6 self)
 Add to MetaCart
(Show Context)
. First, several algorithms based on the unsymmetric Lanczos process are surveyed: the biorthogonalization (BO) algorithm for constructing a tridiagonal matrix T similar to a given matrix A (whose extreme spectrum is sought typically); the "BOBC algorithm", which generates directly the LU factors of T ; the Biores (Lanczos/Orthores), Biomin (Lanczos/Orthomin or biconjugate gradient (BCG)), and the Biodir (Lanczos/Orthodir) algorithms for solving a nonsymmetric system of linear equations. The possibilities of breakdown in these algorithms are discussed and brought into relation. Then the connections to formal orthogonal polynomials, Pad'e approximation, continued fractions, and the qd algorithm are reviewed. They allow us to deapen our understanding of breakdowns. Next, three types of (bi)conjugate gradient squared (CGS) algorithms are presented: Biores 2 , Biomin 2 (standard CGS), and Biodir 2 . Finally, fast Hankel solvers related to the Lanczos process are described. 1 Key ...
High Performance Distributed Computing
 Syracuse University
, 1995
"... High Performance Distributed Computing (HPDC) is driven by the rapid advance of two related technologies  those underlying computing and communications, respectively. These technology pushes are linked to application pulls, which vary from the use of a cluster of some 20 workstations simulating fl ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
High Performance Distributed Computing (HPDC) is driven by the rapid advance of two related technologies  those underlying computing and communications, respectively. These technology pushes are linked to application pulls, which vary from the use of a cluster of some 20 workstations simulating fluid flow around an aircraft, to the complex linkage of several hundred million advanced PCs around the globe to deliver and receive multimedia information. The review of base technologies and exemplar applications is followed by a brief discussion of software models for HPDC, which are illustrated by two extremes  PVM and the conjectured future World Wide Web based WebWork concept. The narrative is supplemented by a glossary describing the diverse concepts used in HPDC.
MultiEDA: A Programming Environment for Parallel Computations
"... This report presents the software implementation of the Extended Dataflow Actor model, EDA, using the Parallel Virtual Machine, PVM, system [2]. A formal description of the EDA model can be found in [1]. The goal of our research has been to develop MultiEDA, which is a programming environment for t ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
This report presents the software implementation of the Extended Dataflow Actor model, EDA, using the Parallel Virtual Machine, PVM, system [2]. A formal description of the EDA model can be found in [1]. The goal of our research has been to develop MultiEDA, which is a programming environment for testing and evaluating the different aspects of the EDA model using PVM. Several applications were tested in this environment using a cluster of workstations. The remainder of this report is organized as follows. Section 2 briefly introduces the EDA model. In section 3 an overview of the most important features of the PVM system is given. Section 4 describes the MultiEDA, mEDA, environment and the next section presents some applications which were developed using mEDA. Our conclusions are given in section 6. 2 The EDA Model
Array Processing Machines
 Budach (Ed.), Fundamentals of Computational Theory 1985, Cottbus GDR, SpringerVerlag, LNCS 199
, 1984
"... We present a new model of parallel computation called the "array processing machine" or APM (for short). The APM was designed to closely model the architecture of existing vector and array proces sots, and to provide a suitable unifying framework for the complexity theory of parallel com ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present a new model of parallel computation called the "array processing machine" or APM (for short). The APM was designed to closely model the architecture of existing vector and array proces sots, and to provide a suitable unifying framework for the complexity theory of parallel combinatorial and numerical algorithms. After an introduction to the model and its basic programming techniques, we show that the APM can efficiently simulate a variety of extant models of parallel computation and vector processing. In particular it is shown that APMs satisfy Ooldschlager's "parallel computation thesis".
Potential of mean force calculations on an Ltype calcium channel model
"... To understand the mechanisms of Na/Li permeation at submicromolar Ca2 concentrations, Na/Li blocking at higher Ca2 concentrations (10–6–10–4 M) and Ca2 permeation at millimolar Ca2 concentrations, we used our recently described Ltype calcium channel model. For this purpose, we obtained potenti ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
To understand the mechanisms of Na/Li permeation at submicromolar Ca2 concentrations, Na/Li blocking at higher Ca2 concentrations (10–6–10–4 M) and Ca2 permeation at millimolar Ca2 concentrations, we used our recently described Ltype calcium channel model. For this purpose, we obtained potential of mean force (pmf) curves for the position change of one Na and one Ca2 ion inside the channel and for the position change of a second Ca2 ion when the EEEE locus is coordinated to Ca2. The pmf curves suggest that (i) at submicromolar Ca2 concentrations, because of the low velocity of Ca2 entry in the channel, monovalent ion flux occurs; (ii) at Ca2 concentrations between 10–6 and 10–4 M, thermodynamic equilibrium between the channel and Ca2 is achieved; as the coordination of Ca2with the locus is more favorable than the coordination of Na, the monovalent ion flux is blocked; and (iii) to put a second Ca2 ion inside the channel at an appropriate rate, the Ca2 concentration should reach millimolar levels. Nevertheless, the entry of a second Ca2 is thermodynamically unfavorable, indicating that the competition of two Ca2 ions for the locus leads to Ca2 permeation.