Cited By
View all- Diaz AHitz MKaltofen ELobo AValente T(1993)Process scheduling in DSC and the large sparse linear systems challengeDesign and Implementation of Symbolic Computation Systems10.1007/BFb0013169(66-80)Online publication date: 1993
Programming in PACLIB
Abstract
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, non-determinism, 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.
References
[1]
Peter A. Buhr and Richard A. Stroobosscher. The μSystem: Providing Light-weight Concurrency on Shared-Memory Multiprocessor Computers Running UNIX. Software --- Practice and Experience, 20(9):929--964, September 1990.
[2]
Bruce W. Char. Progress report on a system for general-purpose parallel symbolic algebraic computation. In Proceedings of the ISSAC'90, Tokyo, Japan, August 20--24, pages 96-103, Department of Computer Science, University of Tennessee, Knoxville, TN 37996-1301, 1990. ACM Press, New York.
[3]
George Collins, Hoon Hong, Mark Encarnation, Jeremy Johnson, Werner Krandick, and Andreas Neubacher. A SACLIB Primer. Technical Report 92--34, RISC-Linz, Johannes Kepler University, Linz, Austria, 1992. To appear.
[4]
Wolfgang Kuechlin. A Parallel SAC-2 Based on Threads. Technical report, Computer and Information Sciences, Ohio State University, Columbus, Ohio, April 1990.
[5]
Wolfgang Schreiner. PACLIB User Manual. Technical Report 92--32, RISC-Linz, Johannes Kepler University, Linz, Austria, May 1992.
[6]
Wolfgang Schreiner. PACLIB --- Structure and Implementation. Technical Report 92-33, RISC-Linz, Johannes Kepler University, Linz, Austria, 1992. To appear.
Recommendations
Data-Parallel Programming on MIMD Computers
The implementation of two compilers for the data-parallel programming language Dataparallel C is described. One compiler generates code for Intel and nCUBE hypercube multicomputers; the other generates code for Sequent multiprocessors. A suite of ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1992 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 November 1992
Published in SIGSAM Volume 26, Issue 4
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 124Total Downloads
- Downloads (Last 12 months)66
- Downloads (Last 6 weeks)10
Reflects downloads up to 30 Nov 2024
Other Metrics
Citations
Cited By
View all- Diaz AHitz MKaltofen ELobo AValente T(1993)Process scheduling in DSC and the large sparse linear systems challengeDesign and Implementation of Symbolic Computation Systems10.1007/BFb0013169(66-80)Online publication date: 1993
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in