Results 1  10
of
15
On the Future of Problem Solving Environments

, 2000
"... In this paper we review the current state of the problem solving environment (PSE) field and make projections for the future. First we describe the computing context, the definition of a PSE and the goals of a PSE. The stateoftheart is summarized along with sources (books, bibliographics, web sit ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
In this paper we review the current state of the problem solving environment (PSE) field and make projections for the future. First we describe the computing context, the definition of a PSE and the goals of a PSE. The stateoftheart is summarized along with sources (books, bibliographics, web sites) of more detailed information. The principal components and paradigms for building PSEs are presented. The discussion of the future is given in three parts: future trends, scenarios for 2010/2025, and research
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...
Maple on a Massively Parallel, Distributed Memory Machine
 In Hitz and Kaltofen [24
, 1997
"... We ported the computer algebra system Maple V to the Intel Paragon, a massively parallel, distributed memory machine. In order to take advantage of the parallel architecture, we extended the Maple kernel with a set of message passing primitives based on the Paragon's native message passing library. ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
We ported the computer algebra system Maple V to the Intel Paragon, a massively parallel, distributed memory machine. In order to take advantage of the parallel architecture, we extended the Maple kernel with a set of message passing primitives based on the Paragon's native message passing library. Using these primitives, we implemented a parallel version of Karatsuba multiplication for univariate polynomials over Z p . Our speedup timings illustrate the practicability of our approach. On top of the message passing primitives we have implemented a higher level model of parallel processing based on the managerworker scheme; a Maple application on one node of the parallel machine submits jobs to Maple processes residing on different nodes, then asynchronously collects the results. This model proves to be convenient for interactive usage of a distributed memory machine. Apart from the message passing parallelism we also use localized multithreading to achieve symmetric multiprocessing w...
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...
Process Scheduling in DSC and the Large Sparse Linear Systems Challenge
 J. Symbolic Comput
, 1998
"... this paper appeared in "Design and Implementation of Symbolic Computation Systems," A. Miola (ed.), Springer Lect. Notes Comput. Science, 722, 6680 (1993). ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
this paper appeared in "Design and Implementation of Symbolic Computation Systems," A. Miola (ed.), Springer Lect. Notes Comput. Science, 722, 6680 (1993).
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.
PVMaple: a Distributed Approach to Cooperative Work of Maple Processes
 in Procs.EuroPVM/MPI'00
, 2000
"... In this paper we present the structure and functionality of a prototype system, namely PVMaple, for cooperative Maple applications running on networked workstations in a message passing environment supplied by PVM. ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
In this paper we present the structure and functionality of a prototype system, namely PVMaple, for cooperative Maple applications running on networked workstations in a message passing environment supplied by PVM.
Plotting Algebraic Space Curves By Cluster Computing
 ASCM'2000, 4th Asian Symposium on Computer Mathematics, Chiang Mai
, 2000
"... Introduction We describe a parallel solution to the problem of reliably plotting an algebraic space curve. The starting point of our work is the software library CASA (computer algebra software for constructive algebraic geometry) which has been developed since 1990 by various researchers under the ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Introduction We describe a parallel solution to the problem of reliably plotting an algebraic space curve. The starting point of our work is the software library CASA (computer algebra software for constructive algebraic geometry) which has been developed since 1990 by various researchers under the direction of the third author 1 . CASA is built on top of the computer algebra system Maple. For parallelizing a number of CASA functions, we have developed \Distributed Maple", a system that allows to implement parallel algorithms in Maple and to execute them in any networked environment 2 . The core of this system is a scheduler program written in Java which is in charge of coordinating the activities of multiple Maple kernels running on various machines. The system has evolved from our own experience in the development of parallel computer algebra environments 3 and from the experience of other researchers in adapting Maple t
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...
Parallelism in MuPAD
 In Electronic Proceedings of the 1st International IMACS Conference on Applications of Computer Algebra
, 1995
"... this memory. Instead data with specified properties can be read out. This paradigm is broadly used and accepted [1] and is used by the computeralgebra system Sugarbush [2, 3]. Tuplespace is one form of a virtual shared memory. Though it is very comfortable it is hard to implement it efficiently on ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
this memory. Instead data with specified properties can be read out. This paradigm is broadly used and accepted [1] and is used by the computeralgebra system Sugarbush [2, 3]. Tuplespace is one form of a virtual shared memory. Though it is very comfortable it is hard to implement it efficiently on a distributed computer with slow communication or high latency. [24] introduces a mapping function for data, which is definable by the user, which enables a much more efficient implementation of tuplespace. Tuplespace can be implemented with macroparallelism easily. 4.3 ProcessGraph