| Hong, H., Schreiner, W., Neubacher, A., Siegl, K., Loidl, H.-W., Jebelean, T., Zettler, P. (1992). PACLIB User Manual. Technical Report 92--32, RISC-Linz. |
....When several exact divisions have to be executed in parallel, our method will add another level of parallelism to the program. 6 Experiments We ran a sequential and a parallel implementation of our method on the shared memory architecture of the Sequent Symmetry. We used the PACLIB environment [3] which combines the computer algebra library SACLIB [2] with the parallel features of the System library [1] Table 1 lists computing times and computing time ratios for inputs of various lengths. The row heading 20=15 refers to a dividend of 20 words and a divisor of 15 words. The column heading ....
H. Hong et al. PACLIB User Manual. Technical Report 92-32, RISC-Linz 1992.
No context found.
Hong, H., Schreiner, W., Neubacher, A., Siegl, K., Loidl, H.-W., Jebelean, T., Zettler, P. (1992). PACLIB User Manual. Technical Report 92--32, RISC-Linz.
....on a Sequent Symmetry shared memory computer with 20 processors under the Dynix ptx version of Unix. The system is portable to any machine supported by the System package (a port to a multi processor Silicon Graphics is on the way) The Paclib programming model is explained in large detail in [5]; a comprehensive description of the Paclib kernel is given in [6] The development of Paclib applications is illustrated in [8] and [4] 2 Programming Interface 2.1 Functional Model Algebraic algorithms are mostly based on purely mathematical functions that are entirely defined by their ....
....stream and passes it to two tasks producer and consumer that generate and process a stream of values, respectively. In general, networks of tasks connected by streams may be constructed. By utilizing the non deterministic features of get, even manager worker schemes of computation are possible [5]. P 1 j P 2 j P 3 j Pn j : j j j j ready queue GAVAIL SACLIB heap A A A AU Phi Phi Phi Phi Phi ffl Figure 3: System Design 3 System Design The Paclib kernel consists of the following main components (depicted in Figure 3) 1. Ready Queue: This ....
H. Hong, W. Schreiner, A. Neubacher, et al. PACLIB User Manual. Technical Report 92-32, RISC-Linz, Johannes Kepler University, Linz, Austria, May 1992.
....supported by the System package [ Buhr and Stroobosscher, 1990 ] This report is intended as a detailed description of the internal structure of the paclib kernel. It explains how the system has been designed , not how it can be used . The actual user interface of paclib is described in [ Hong et al. 1992 ] 2 SACLIB saclib is a library of algebraic algorithms that supports ffl Arbitrary precision integer and rational arithmetic. ffl Polynomial arithmetic. ffl Linear algebra. ffl Polynomial GCD and resultant computation. ffl Polynomial factorization. ffl Real root calculation. ffl Algebraic ....
....that denote the start and the end of the time slice (in ms) during which task was running. From this information, the tools pacgraph and pacutil generate L a T E X pictures that visualize the behavior of the program and the utilization of the processors during the program run, respectively (see [ Hong et al. 1992 ] for details) 11 BENCHMARKS 15 11 Benchmarks The basic time overhead imposed by the paclib system is negligible. A sequential program runs as fast when compiled with paclib as with saclib. Moreover, even a sequential saclib program compiled with paclib profits from the parallelized garbage ....
Hoon Hong, Wolfgang Schreiner, Andreas Neubacher, Kurt Siegl, HansWolfgang Loidl, Tudor Jebelean, and Peter Zettler. PACLIB User Manual. Technical Report 92-32, RISC-Linz, Johannes Kepler University, Linz, Austria, May 1992.
....embeddability. These requirements were met mainly by adopting a conservative garbage collection scheme where the system stack is used for identifying the potential roots of active list cells. The second part of this paper describes the work on developing a parallel version of Saclib, namely Paclib [Hong et al., 1992]. The kernel of Paclib was designed to meet the following requirements: upward compatibility to the Saclib kernel, high level parallel programming model, light weight concurrency, non determinism and speculative parallelism, communication by heap references, and parallel garbage collection. For ....
....by the computation) and forwards a sequence of results to other tasks. Therefore Paclib supports an additional form of task communication by streams i.e. automatically synchronized lists that may be used for this purpose. For a comprehensive description of the Paclib programming model, see [Hong et al., 1992]. The Design of the SACLIB PACLIB Kernels 11 4.4. Task Management We applied and considerably extended the features of the System in order to implement the Paclib parallel programming model which is higher level and more general than the native one. There were two major problems that had to be ....
H. Hong, W. Schreiner, A. Neubacher, K. Siegl, H.-W. Loidl, T. Jebelean, and P. Zettler. PACLIB User Manual. Technical Report 92-32, RISC-Linz, Johannes Kepler University, Linz, Austria, May 1992.
....with the results reported for a system that was developed elsewhere with similar objectives in mind. In part our observations turn out to be significantly different. The parallel programming package we refer to in this paper is the runtime kernel of the PACLIB system for parallel computer algebra [3]. This system represents the core of a long term project of our group that deals with the systematic construction of a library of parallel algorithms for symbolic algebra and related areas. The PACLIB kernel efficiently provides light weight concurrency on shared memory multi processors with a ....
....virtual processors implemented by UNIX processes. We have applied and considerably extended the mechanisms of the System to develop a suitable parallel programming interface for SACLIB. Most SACLIB functions are entirely defined by their argument result behavior. The PACLIB programming model [3] reflects this view: t = pacStart(f, a i ) creates a new task that asynchronously executes f(a i ) The task handle t is a first order object that can be passed to other functions tasks and stored in any SACLIB data structure. v = pacWait( t, ts) returns the result v of one of the denoted ....
Hoon Hong, Wolfgang Schreiner, et al. PACLIB User Manual. Technical Report 92-32, RISC-Linz, Johannes Kepler University, Linz, Austria, May 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC