Results 1  10
of
235
Transputer Network Configuration Tools for LOGFLOW
 Proc. of the 1st AustrianHungarian Workshop on Distributed and Parallel Systems
, 1996
"... . LOGFLOW is a distributed Prolog implementation running on transputer networks. The configuration of the network topology and the portation of the system to a new architecture is a very timeconsuming procedure. This paper describes several new tools developed for shortening these tasks and providi ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
. LOGFLOW is a distributed Prolog implementation running on transputer networks. The configuration of the network topology and the portation of the system to a new architecture is a very timeconsuming procedure. This paper describes several new tools developed for shortening these tasks
An optimized reconfigurable architecture for Transputer networks
 PROC. OF 25TH HAWAII INT. CONF. ON SYSTEM SCIENCES (HICSS 92
, 1992
"... This paper presents the architecture of a fully reconfigurable distributed memory computing system. It is assumed that the processors communicate via message passing on an application specific regular network of degree four. To realize any network of this class, we use a special multistage Clos netw ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
This paper presents the architecture of a fully reconfigurable distributed memory computing system. It is assumed that the processors communicate via message passing on an application specific regular network of degree four. To realize any network of this class, we use a special multistage Clos
An Advanced Environment for Programming Transputer Networks with Dynamic Reconfiguration
"... this paper we present a programming environment for multicomputers. Among other features, it allows us to evaluate the performance of parallel algorithms running on a multicomputer with both, static and dynamically reconfigurable topologies. The results of this evaluation are obtained by simulating ..."
The Parallel Solution of Partial Differential Equations on Transputer Networks
, 1992
"... We present an implementation of a finitedifference approximation for the solution of partial differential equations on transputer networks. The grid structure associated with the finitedifference approximation is exploited by using geometric partitioning of the data among the processors. This p ..."
Abstract
 Add to MetaCart
We present an implementation of a finitedifference approximation for the solution of partial differential equations on transputer networks. The grid structure associated with the finitedifference approximation is exploited by using geometric partitioning of the data among the processors
Label Inspection using the Hough Transform on Transputer Networks
 Microprocessors and Microsystems
, 1991
"... Avariation on the Hough transform, the special normal#angle Hough transform, #R#sHT # is described detailing its characteristics and advantages and suitablity for a parallel implementation. The transputer is introduced and the application of the R#sHT on two popular types of transputer networks, ..."
Abstract
 Add to MetaCart
Avariation on the Hough transform, the special normal#angle Hough transform, #R#sHT # is described detailing its characteristics and advantages and suitablity for a parallel implementation. The transputer is introduced and the application of the R#sHT on two popular types of transputer networks
The Parallel Solution of Partial DifferentialEquations on Transputer Networks
"... Abstract. We present an implementation of a finitedifference approximationfor the solution of partial differential equations on transputer networks. The grid structure associated with the finitedifference approximation is exploitedby using geometric partitioning of the data among the processors. T ..."
Abstract
 Add to MetaCart
Abstract. We present an implementation of a finitedifference approximationfor the solution of partial differential equations on transputer networks. The grid structure associated with the finitedifference approximation is exploitedby using geometric partitioning of the data among the processors
The Parallel Solution of Partial Differential Equations on Transputer Networks
, 1992
"... . We present an implementation of a finitedifference approximation for the solution of partial differential equations on transputer networks. The grid structure associated with the finitedifference approximation is exploited by using geometric partitioning of the data among the processors. This pr ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
. We present an implementation of a finitedifference approximation for the solution of partial differential equations on transputer networks. The grid structure associated with the finitedifference approximation is exploited by using geometric partitioning of the data among the processors
Label Inspection using the Hough Transform on Transputer Networks
, 1991
"... A variation on the Hough transform, the special normal/angle Hough transform, (R`sHT ) is described detailing its characteristics and advantages and suitablity for a parallel implementation. The transputer is introduced and the application of the R`sHT on two popular types of transputer networks, a ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A variation on the Hough transform, the special normal/angle Hough transform, (R`sHT ) is described detailing its characteristics and advantages and suitablity for a parallel implementation. The transputer is introduced and the application of the R`sHT on two popular types of transputer networks
Parallel Preconditioned ConjugateGradients Methods on Transputer Networks
, 1993
"... . We show how highly efficient parallel implementations of basic linear algebra routines may be used as building blocks to implement efficient higher level algorithms. We discuss the solution of systems of linear equations using a preconditioned ConjugateGradients iterative method on a network of t ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
. We show how highly efficient parallel implementations of basic linear algebra routines may be used as building blocks to implement efficient higher level algorithms. We discuss the solution of systems of linear equations using a preconditioned ConjugateGradients iterative method on a network
Parallel Preconditioned ConjugateGradients Methods on Transputer Networks
, 1993
"... We show how highly efficient parallel implementations of basic linear algebra routines may be used as building blocks to implement efficient higher level algorithms. We discuss the solution of systems of linear equations using a preconditioned ConjugateGradients iterative method on a network of ..."
Abstract
 Add to MetaCart
We show how highly efficient parallel implementations of basic linear algebra routines may be used as building blocks to implement efficient higher level algorithms. We discuss the solution of systems of linear equations using a preconditioned ConjugateGradients iterative method on a network
Results 1  10
of
235