Implementing data parallel rational multiple-residue arithmetic in Eden

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Residue systems present a well-known way to reduce computation cost for symbolic computation. However most residue systems are implemented for integers or polynomials. This work combines two known results in a novel manner. Firstly, it lifts an integral residue system to fractions. Secondly, it generalises a single-residue system to a multiple-residue one. Combined, a rational multi-residue system emerges. Due to the independent manner of single "parts" of the system, this work enables progress in parallel computing. We present a complete implementation of the arithmetic in the parallel extension e.g.. The parallelisation utilises algorithmic skeletons. A non-trivial example computation is also supplied. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Lobachev, O., & Loogen, R. (2010). Implementing data parallel rational multiple-residue arithmetic in Eden. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6244 LNCS, pp. 178–193). https://doi.org/10.1007/978-3-642-15274-0_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free