Restructuring expression dags for efficient parallelization

04/09/2018
by   Martin Wilhelm, et al.
0

In the field of robust geometric computation it is often necessary to make exact decisions based on inexact floating-point arithmetic. One common approach is to store the computation history in an arithmetic expression dag and to re-evaluate the expression with increasing precision until an exact decision can be made. We show that exact-decisions number types based on expression dags can be evaluated faster in practice through parallelization on multiple cores. We compare the impact of several restructuring methods for the expression dag on its running time in a parallel environment.

READ FULL TEXT
research
02/19/2018

Multithreading for the expression-dag-based number type Real_algebraic

Many algorithms, especially in the field of computational geometry, are ...
research
10/12/2017

Balancing expression dags for more efficient lazy adaptive evaluation

Arithmetic expression dags are widely applied in robust geometric comput...
research
07/11/2018

On error representation in exact-decisions number types

Accuracy-driven computation is a strategy widely used in exact-decisions...
research
01/19/2022

A Mixed Precision, Multi-GPU Design for Large-scale Top-K Sparse Eigenproblems

Graph analytics techniques based on spectral methods process extremely l...
research
03/10/2020

Parallel Robust Computation of Generalized Eigenvectors of Matrix Pencils

In this paper we consider the problem of computing generalized eigenvect...
research
12/09/2019

Implementing the Exponential Mechanism with Base-2 Differential Privacy

Despite excellent theoretical support, Differential Privacy (DP) can sti...
research
05/01/2018

Computable decision making on the reals and other spaces via partiality and nondeterminism

Though many safety-critical software systems use floating point to repre...

Please sign up or login with your details

Forgot password? Click here to reset