Restructuring expression dags for efficient parallelization

April 09, 2018 Β· Declared Dead Β· πŸ› The Sea

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Martin Wilhelm arXiv ID 1804.03256 Category cs.CG: Computational Geometry Cross-listed cs.DC, cs.DS, cs.PF Citations 1 Venue The Sea Last Checked 3 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Computational Geometry

R.I.P. πŸ‘» Ghosted

Dynamic Planar Convex Hull

Riko Jacob, Gerth StΓΈlting Brodal

cs.CG πŸ› The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. πŸ“š 240 cites 7 years ago

Died the same way β€” πŸ‘» Ghosted