By Topic

Redesigning Parallel Symbolic Computations Packages

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Macariu, G. ; Inst. e-Austria Timisoara, Timisoara ; Frincu, M. ; Carstea, A. ; Petcu, D.
more authors

The ability of multi-core processors to increase application performance depends on the use of multiple threads within applications. Symbolic computations, requiring both CPU power and large memory, are well-suited candidates for deriving advantages from multi-core parallel architectures. This is possible only if the specific libraries and tools are designed to allow multi-threading and multi-processes. In order to promote the changes needed to adapt these libraries and tools to the new architectures, the changes performed on two main algorithms for symbolic computations, parallel integer factorization and parallel Grobner base computation, are described and discussed.

Published in:

Parallel Architecture and Compilation Techniques, 2007. PACT 2007. 16th International Conference on

Date of Conference:

15-19 Sept. 2007