Programming in Qlisp: A Case Study
Abstract
We describe the results of some experiments with Qlisp-an extension of Common Lisp for shared memory multiprocessors. The experiments involved several parallel implementations of the modular univariate polynomial greatest common divisor algorithm in Qlisp on an Alliant FX/8 multiprocessor. These implementations are described and the requisite Qlisp constructs are described and explained (largely by example). The performance of the parallel implementations is analyzed and some areas of future improvement in the current Qlisp implementation and the algorithm are found. Computer programs. (jes)
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1989
- Accession Number
- ADA209601
Entities
People
- A. Rabinov
- I. Rivin
Organizations
- Stanford University