Results 1 
8 of
8
The Design of the SACLIB/PACLIB Kernels
 Journal of Symbolic Computation
, 1995
"... This paper describes the design of the runtime systems of two variants of the SAC2 computer algebra library: Saclib and Paclib. Saclib is a C version of SAC2, supporting automatic garbage collection and embeddability. Paclib is a parallel version of ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
This paper describes the design of the runtime systems of two variants of the SAC2 computer algebra library: Saclib and Paclib. Saclib is a C version of SAC2, supporting automatic garbage collection and embeddability. Paclib is a parallel version of
The Design of the PACLIB Kernel for Parallel Algebraic Computation
 In ACPC2, LNCS vol.734
, 1993
"... . This paper describes the runtime kernel 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 provi ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
. This paper describes the runtime kernel 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 a parallelized garbage collection. We explain the main design decisions as motivated by the special demands of algebraic computation and give several benchmarks that demonstrate the performance of the system. Paclib has been implemented on a Sequent Symmetry multiprocessor and is portable to other shared memory machines and workstations. 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 algeb...
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...
Virtual Tasks for the PACLIB Kernel
 Parallel Processing: CONPAR 94  VAPP VI International Conference on Parallel and Vector Processing
, 1994
"... . We have extended the task management scheme for the parallel computer algebra package PACLIB. This extension supports "virtual tasks" (tasks that are not yet executable) which are created more efficiently than "real tasks" (tasks that are immediately scheduled for execution). Virtual tasks become ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
. We have extended the task management scheme for the parallel computer algebra package PACLIB. This extension supports "virtual tasks" (tasks that are not yet executable) which are created more efficiently than "real tasks" (tasks that are immediately scheduled for execution). Virtual tasks become real only when the system is idling or existing real tasks can be recycled. Consequently, the overhead for task creation and synchronization but also the memory requirements of a parallel program may be reduced. We analyze the system theoretically and experimentally and compare it with another virtual task package. 1 Introduction The purpose of this paper is twofold: first it reports the extension of the task management scheme for a parallel programming package developed at our institute. Second it carefully investigates the semantic and performance consequences of this modification and compares them with the results reported for a system that was developed elsewhere with similar objectives...
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...
The Exact Solution of Linear Equation Systems on a Shared Memory Multiprocessor
 In Submitted to the PARLE 93
, 1992
"... We describe the design of a parallel algorithm for the exact solution of linear equation systems with integer coefficients and the implementation of this algorithm on a shared memory multiprocessor. An efficient solution of the original problem is difficult since the coefficients grow during the com ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We describe the design of a parallel algorithm for the exact solution of linear equation systems with integer coefficients and the implementation of this algorithm on a shared memory multiprocessor. An efficient solution of the original problem is difficult since the coefficients grow during the computation and arithmetic becomes very timeconsuming. Therefore we transform the problem into a problem of determinant computation and apply a modular approach: the system is mapped into several finite fields where the determinants can be efficiently computed. The subresults are combined to yield the original determinants and to compute the solutions of the system. Several parallel versions of this algorithm have been developed and implemented on a shared memory multiprocessor. The programs are applied to equation systems of different characteristics and the results are analyzed and compared. Keywords: Parallel algorithms, scientific computing, computer algebra, shared memory machines. Fund...
Programming in PACLIB
, 1993
"... This paper gives a short overview on 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 concu ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper gives a short overview on 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. 1 Introduction This paper gives a short overview on programming in paclib, a new library 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. paclib is a combination and extension of two public domain software systems: 1. Saclib [3] is a large library of...