Article

Free access

Parallel univariate p-adic lifting on shared-memory multiprocessors

Author:

Paul S. WangAuthors Info & Claims

ISSAC '92: Papers from the international symposium on Symbolic and algebraic computation

Pages 168 - 176

https://doi.org/10.1145/143242.143304

Published: 01 August 1992 Publication History

PDF eReader

References

[1]

B. Beauzamy, V. Trevisan and P. Wang, "Polynomia.1 Factorization" Sharp Bounds, Efficient Algorithms," Institute of Computational Mathemal;ics Technical Report No. ICM-9201-26, Department, of Ma.thematics and Computer Science, Kent State University, Kent OH, 1992 (submitted to Journal of Symbolic Computation).

Digital Library

Google Scholar

[2]

S. C. Johnson and R. L. Graham, "SIGSAM problem #7," ACM SIGSAM Bulletin, Feb. 1974, page 4.

Digital Library

Google Scholar

[3]

E. Kaltofen, "Factorization of Polynoll~ials," Computer Algebra-Symbolic and Algebraic Computation, Computing, Suppl. 4, Springer-Verlag, 1982, pp. 95-113.

Google Scholar

[4]

D. E. Knuth. The Art of Computer Programmi1~g. Vol. 2'Semi-numer,zcal Algorithms, Addison- Wesley, Reading, Mass., 1980.

Digital Library

Google Scholar

[5]

R. T. Moenck, "Practical Fast Polynomial Mult, iplication," Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation (SYMSAC'76), pp. 136-145.

Digital Library

Google Scholar

[6]

P. M. A. Moore and A. C. Norman, "implementing a Polynomial Factorization and GCD Package," Proceedings of the 1981 ACM Symposmm on Symbolic and Algebraic Computation, August, 1981, pp. 109-116.

Digital Library

Google Scholar

[7]

J. Moses and D. Y. Y. Yun, "The EZGCD Algorithm," Proceedings, 19 73 ACM National Conference, Pl). 159-166.

Digital Library

Google Scholar

[8]

B. Serpette, j. Vuillemiu, and J. C. Iterv~, "'BigNum" A Fort.able and EflScient Package tot Arbitrary-Precision Arithmetic," Digital Equipmerit ('orp., Paris Research Laboratory, 85, Av. Victor Hugo. 92563 Rueil-Malmaison Cedex, France.

Google Scholar

[9]

N. Sharma and P. S. Wang, "A Guide to Parallel Programming on the Sequent Balance," Technical Report, Institute for Mathematical Computation, Department of Mathematics and Computer Science, Kent State University, 1989.

Google Scholar

[10]

P. S. Wang and B. M. Trager, "New Algorithms for Polynomial Square-free Decomposition over the integers," SIAM J. Computing, Vol. 8, No. 3, Aug. 1979, pp. 300-305.

Digital Library

Google Scholar

[11]

P. S. Wang, "Parallel p-adic Constructions in the Univariate Polynomial Factoring Algorithm," Proceedings, MACSYMA Users' Conference 1979, Cambridge, MA, MIT pp. 310-318.

Google Scholar

[12]

P. S. Wang, "Early Detection of True Factors in Univariate Polynomial Factorization," Proceedings, ACM EUROCAL'83, London, March 28-30, 1983.

Digital Library

Google Scholar

[13]

P. S. Wang, "Parallel Univariate Polynomial Factorization on Shared-Memory Multiprocessors," Proceedings of the ISSAC'90, Addison-Wesley (ISBN 0-201-54892-5), Aug. 1990, pp. 145-151.

Digital Library

Google Scholar

[14]

H. Zassenhaus, "On Hensel Factoriza.tion." J. Number Theory 1 (1969)pp. 291-311.

Crossref

Google Scholar

Cited By

View all

Rayes MWang PWeber KMacCallum M(1994)Parallelization of the sparse modular GCD algorithm for multivariate polynomials on shared memory multiprocessorsProceedings of the international symposium on Symbolic and algebraic computation10.1145/190347.190368(66-73)Online publication date: 1-Aug-1994
https://dl.acm.org/doi/10.1145/190347.190368
Beauzamy BTrevisan VWang P(1993)Polynomial FactorizationJournal of Symbolic Computation10.1006/jsco.1993.102815:4(393-413)Online publication date: 1-Apr-1993
https://dl.acm.org/doi/10.1006/jsco.1993.1028

Index Terms

Parallel univariate p-adic lifting on shared-memory multiprocessors

Recommendations

Parallel univariate polynomial factorization on shared-memory multiprocessors
ISSAC '90: Proceedings of the international symposium on Symbolic and algebraic computation

Using parallelism afforded by shared-memory multiprocessors to speed up systems for polynomial factorization is discussed. The approach is to take the fastest known factoring algorithm for practical purposes and parallelize key parts of it. The ...
A Benchmark Parallel Sort for Shared Memory Multiprocessors

The first parallel sort algorithm for shared memory MIMD (multiple-instruction-multiple-data-stream) multiprocessors that has a theoretical and measured speedup near linear is exhibited. It is based on a novel asynchronous parallel merge that evenly ...
Conservative circuit simulation on shared-memory multiprocessors

We investigate conservative parallel discrete event simulations for logical circuits on shared-memory multiprocessors. For a first estimation of the possible speedup, we extend the critical path analysis technique by partitioning strategies. To ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ISSAC '92: Papers from the international symposium on Symbolic and algebraic computation

August 1992

406 pages

ISBN:0897914899

DOI:10.1145/143242

Editor:
Paul S. Wang
Kent State Univ., Kent, OH

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ISSAC92

Sponsor:

ISSAC92: International Symposium on Symbolic Algebraic Computation

July 27 - 29, 1992

California, Berkeley, USA

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
240
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)2

Reflects downloads up to 11 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Rayes MWang PWeber KMacCallum M(1994)Parallelization of the sparse modular GCD algorithm for multivariate polynomials on shared memory multiprocessorsProceedings of the international symposium on Symbolic and algebraic computation10.1145/190347.190368(66-73)Online publication date: 1-Aug-1994
https://dl.acm.org/doi/10.1145/190347.190368
Beauzamy BTrevisan VWang P(1993)Polynomial FactorizationJournal of Symbolic Computation10.1006/jsco.1993.102815:4(393-413)Online publication date: 1-Apr-1993
https://dl.acm.org/doi/10.1006/jsco.1993.1028

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Parallel univariate polynomial factorization on shared-memory multiprocessors

A Benchmark Parallel Sort for Shared Memory Multiprocessors

Conservative circuit simulation on shared-memory multiprocessors