z-logo
open-access-imgOpen Access
A general compilation algorithm to parallelize and optimize counted loops with dynamic data-dependent bounds
Author(s) -
Jie Zhao,
Albert Cohen
Publication year - 2017
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - computer science , affine transformation , vectorization (mathematics) , locality , loop (graph theory) , spurious relationship , automatic parallelization , parallel computing , computation , algorithm , loop fission , set (abstract data type) , matrix (chemical analysis) , code (set theory) , state (computer science) , compiler , programming language , mathematics , linguistics , philosophy , materials science , combinatorics , machine learning , pure mathematics , composite material

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here