Results 1  10
of
14
Distributed Symbolic Computation with DTS
 PROCEEDINGS OF PARALLEL ALGORITHMS FOR IRREGULARLY STRUCTURED PROBLEMS, LNCS 980
, 1995
"... We describe the design and implementation of the Distributed Threads System (DTS), a programming environment for the parallelization of irregular and highly datadependent algorithms. DTS extends the support for fork/join parallel programming from shared memory threads to a distributed memory enviro ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
We describe the design and implementation of the Distributed Threads System (DTS), a programming environment for the parallelization of irregular and highly datadependent algorithms. DTS extends the support for fork/join parallel programming from shared memory threads to a distributed memory environment. It is currently implemented on top of PVM, adding an asynchronous RPC abstraction and turning the net into a pool of anonymous compute servers. Each node of DTS is multithreaded using the C threads interface and is thus ready to run on a multiprocessor workstation. We give performance results for a parallel implementation of the RSA cryptosystem, parallel long integer multiplication, and parallel multivariate polynomial resultant computation.
Distributed Maple: Parallel Computer Algebra in . . .
 JOURNAL OF SYMBOLIC COMPUTATION
, 2002
"... We describe the design and use of Distributed Maple, an environment for executing parallel computer algebra programs on multiprocessors and heterogeneous clusters. The system embeds kernels of the computer algebra system Maple as computational engines into a networked coordination layer implemen ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We describe the design and use of Distributed Maple, an environment for executing parallel computer algebra programs on multiprocessors and heterogeneous clusters. The system embeds kernels of the computer algebra system Maple as computational engines into a networked coordination layer implemented in the programming language Java. On the basis of a comparatively highlevel programming model, one may write parallel Maple programs that show good speedups in mediumscaled environments. We report
Developing A Distributed System For Algebraic Geometry
 EUROCMPAR'99 Third Euroconference on Parallel and Distributed Computing for Computational Mechanics
, 1999
"... We report on a project on parallelizing parts of the software library CASA for computing with and reasoning about objects in algebraic geometry with applications in computer aided geometric design and solid modeling. CASA is implemented in the language of the computer algebra system Maple; we theref ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
We report on a project on parallelizing parts of the software library CASA for computing with and reasoning about objects in algebraic geometry with applications in computer aided geometric design and solid modeling. CASA is implemented in the language of the computer algebra system Maple; we therefore have developed \Distributed Maple" as an environment for executing parallel Maple programs on multiple computers of a network. Using this environment, we have started the parallelization of some important CASA algorithms; for a particular subproblem we achieve a speedup of 15 on a heterogeneous network with 24 processors distributed among PCs, workstations, and shared memory multiprocessors. 1 Introduction This paper describes an ongoing eort on developing a distributed system for solving problems in algebraic geometry with applications in computer aided geometric design and solid modeling. The starting point of our work is the software library CASA (computer algebra software for cons...
A ParaFunctional Programming Interface for a Parallel Computer Algebra Package
 Journal of Symbolic Computation
, 1994
"... : We describe the design and implementation of pD, a parallel variant of a small functional language that serves as a programming interface for the parallel computer algebra package PACLIB. pD provides several facilities to express parallel algorithms in a flexible way on different levels of abstrac ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
: We describe the design and implementation of pD, a parallel variant of a small functional language that serves as a programming interface for the parallel computer algebra package PACLIB. pD provides several facilities to express parallel algorithms in a flexible way on different levels of abstraction. The compiler translates a pD module into statically typed parallel C code with explicit task creation and synchronization constructs. This target code can be linked with the PACLIB kernel, the multiprocessor runtime system of the computer algebra library SACLIB. The parallelization of several computer algebra algorithms on a shared memory multiprocessor demonstrates the elegance and efficiency of this approach. Keywords: ParaFunctional Programming, Computer Algebra, Compilation. 1 Introduction We present in this paper a small functional language D and its parafunctional variant pD that is used as a parallel programming interface for the computer algebra package PACLIB. Parallelism...
PACLIB  A System for Parallel Algebraic Computation on Shared Memory Multiprocessors
 Johannes Kepler University
, 1993
"... This paper gives an overview on the structure and the use of Paclib, a new system for parallel algebraic computation on shared memory computers. Paclib has been developed as a professional tool for the simple design and efficient implementation of parallel algorithms in computer algebra and related ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
This paper gives an overview on the structure and the use of Paclib, a new system for parallel algebraic computation on shared memory computers. Paclib has been developed as a professional tool for the simple design and efficient implementation of parallel algorithms in computer algebra and related areas. It provides concurrency, shared memory communication, nondeterminism, speculative parallelism, streams and pipelining and a parallelized garbage collection. Paclib has been implemented on a Sequent Symmetry multiprocessor and is portable to other shared memory machines and workstations. Several algebraic algorithms have been implemented in Paclib and demonstrate the effectiveness of the system. 1 Introduction Computer algebra is that branch of computer science that aims to provide exact solutions of scientific problems. Research results of this area are e.g. algorithms for symbolic integration, polynomial factorization or the exact solution of algebraic equations and inequalities...
On Solving a Problem in Algebraic Geometry by Cluster Computing
 In EuroPar 2000, 6th International EuroPar Conference
, 2000
"... We describe a parallel solution to the problem of reliably plotting a plane algebraic curve. The sequential program is implemented in the software library CASA on top of the computer algebra system Maple. The parallel version is based on Distributed Maple, a parallel programming extension written in ..."
Abstract

Cited by 8 (7 self)
 Add to MetaCart
We describe a parallel solution to the problem of reliably plotting a plane algebraic curve. The sequential program is implemented in the software library CASA on top of the computer algebra system Maple. The parallel version is based on Distributed Maple, a parallel programming extension written in Java. We evaluate its performance on a cluster of workstations and PCs, on a massively parallel multiprocessor, and on a cluster that couples workstations and multiprocessor.
Parsac2: Parallel Computer Algebra On The DeskTop
, 1995
"... We give an introduction to programming methods, software systems, and algorithms, suitable for parallelizing Computer Algebra on modern multiprocessor workstations. As concrete examples we present multithreaded programming and its use in the PARSAC2 system for parallel symbolic computation, and we ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
We give an introduction to programming methods, software systems, and algorithms, suitable for parallelizing Computer Algebra on modern multiprocessor workstations. As concrete examples we present multithreaded programming and its use in the PARSAC2 system for parallel symbolic computation, and we present some examples of parallel algorithms useful for solving systems of polynomial equations.
A Parallel SymbolicNumerical Approach to Algebraic Curve Plotting
 CASC2000, Third International Workshop on Computer Algebra in Scienti Computing
, 2000
"... We describe a parallel hybrid symbolicnumerical solution to the problem of reliably plotting a plane algebraic curve. The original sequential program is implemented in the software library CASA on the basis of the computer algebra system Maple. The new parallel version is based on Distributed Maple ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
We describe a parallel hybrid symbolicnumerical solution to the problem of reliably plotting a plane algebraic curve. The original sequential program is implemented in the software library CASA on the basis of the computer algebra system Maple. The new parallel version is based on Distributed Maple, a distributed programming extension written in Java. We describe the mathematical foundations of the algorithm, give sequential algorithmic improvements and discuss our parallelization approach.
Application of a ParaFunctional Language to Problems in Computer Algebra
 In HPFC'95  High Performance Functional Computing
, 1995
"... We describe how a parafunctional programming language is applied to implementing parallel computer algebra algorithms on a shared memory multiprocessor. The language we use is pD, a small functional language that we have developed as a highlevel programming interface for the parallel computer alge ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We describe how a parafunctional programming language is applied to implementing parallel computer algebra algorithms on a shared memory multiprocessor. The language we use is pD, a small functional language that we have developed as a highlevel programming interface for the parallel computer algebra package PACLIB. pD provides several facilities to express parallel algorithms in a flexible way on different levels of abstraction. The compiler translates a pD program into parallel C code with explicit task creation and synchronization constructs. The implemented parafunctional programs perform as efficient as manually coded parallel C programs. 1 Introduction While most computer algebra algorithms [3] are based on the concept of pure functions, realworld computer algebra programs are for performance reasons usually written in a lowlevel imperative style (typically in C). Consequently, there is little resemblance between the notation in which the mathematical theory is formulated a...
Componentlevel Parallelization of Triangular Decompositions
, 2007
"... We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a componentlevel parallelism for which the number of processors in use depends on the geometry of the solution set of the input system. Our long term goal is t ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a componentlevel parallelism for which the number of processors in use depends on the geometry of the solution set of the input system. Our long term goal is to achieve an efficient multilevel parallelism: coarse grained (component) level for tasks computing geometric objects in the solution sets, and medium/fine grained level for polynomial arithmetic such as GCD/resultant computation within each task.