Dealing with performance/portability and performance/accuracy trade-offs in heterogeneous computing systems: a case study with matrix multiplication modulo primes

Wezowicz, Matthew; Saunder, B. David; Taufer, Michela

doi:10.1117/12.919323

Search citation statements

Order By: Relevance

Paper Sections

Select...

New Algorithms For the Mul Solution1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

Publication Types

Select...

Book1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Work on parallelizations using OpenCL, OpenMP or XKaapi for dense or sparse matrix multiplication include [4,9,20].…”

Section: New Algorithms For the Mul Solutionmentioning

confidence: 99%

Elements of Design for Containers and Solutions in the LinBox Library

Boyer

Dumas

Giorgi

et al. 2014

Mathematical Software – ICMS 2014

View full text Add to dashboard Cite

We describe in this paper new design techniques used in the C++ exact linear algebra library LinBox, intended to make the library safer and easier to use, while keeping it generic and efficient. First, we review the new simplified structure for containers, based on our founding scope allocation model. We explain design choices and their impact on coding: unification of our matrix classes, clearer model for matrices and submatrices, etc. Then we present a variation of the strategy design pattern that is comprised of a controller-plugin system: the controller (solution) chooses among plug-ins (algorithms) that always call back the controllers for subtasks. We give examples using the solution mul. Finally we present a benchmark architecture that serves two purposes: Providing the user with easier ways to produce graphs; Creating a framework for automatically tuning the library and supporting regression testing.

show abstract

“…Work on parallelizations using OpenCL, OpenMP or XKaapi for dense or sparse matrix multiplication include [4,9,20].…”

Section: New Algorithms For the Mul Solutionmentioning

confidence: 99%