Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Ayal Zaks"'
Autor:
Christopher Gearing, Ayal Zaks
Publikováno v:
International Workshop on OpenCL.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3814ce324ac762e613f07f72826247fb
https://doi.org/10.1145/3585341.3587953
https://doi.org/10.1145/3585341.3587953
Autor:
Mary Lou Soffa, Ayal Zaks
Publikováno v:
2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b88b7019c6af92692155408015d9a935
https://doi.org/10.1109/cgo51591.2021.9370338
https://doi.org/10.1109/cgo51591.2021.9370338
Publikováno v:
PACT
Several classes of algorithms for combinatorial search and optimization problems employ memoization data structures to speed up their serial convergence. However, accesses to these data structures impose dependences that obstruct program parallelizat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8531dc648b252aed311bee1d5421aabf
https://doi.org/10.1145/3243176.3243193
https://doi.org/10.1145/3243176.3243193
Autor:
Ayal Zaks, Joseph Zaks
Publikováno v:
Journal of Geometry. 109
We have recently exhibited neighborly families in $$E^{3}$$ consisting of either 16 3-pyramids based on a quadrangle, or else 24 3-cubes. We extend these results to neighborly families consisting of either $$2\,\hbox {x}\,2^{d} \quad d$$ -pyramids ov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5df50053ce1e6ff3659901c9a0c0238f
https://doi.org/10.1007/s00022-018-0452-0
https://doi.org/10.1007/s00022-018-0452-0
Publikováno v:
2016 Third Workshop on the LLVM Compiler Infrastructure in HPC (LLVM-HPC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08c37a5cfb8c29811dd40d2cde6d001e
https://doi.org/10.1109/llvm-hpc.2016.008
https://doi.org/10.1109/llvm-hpc.2016.008
Publikováno v:
PLDI
Workload, platform, and available resources constitute a parallel program's execution environment. Most parallelization efforts statically target an anticipated range of environments, but performance generally degrades outside that range. Existing ap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b347d0c7879e76cae8ebbb142b5b911b
https://doi.org/10.1145/2345156.2254082
https://doi.org/10.1145/2345156.2254082
Autor:
Uzi Shvadron, Ravi Nair, Nobuyuki Ohba, Cheng-Hong Li, Ayal Zaks, Alfred J. Park, Eugen Schenfeld
Publikováno v:
SIMULATION. 88:832-851
Stream processing is an important emerging computational model for performing complex operations on and across multi-source, high-volume, unpredictable dataflows. We present Flow, a platform for parallel and distributed stream processing system simul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10abbae0e552b975f6bc51196702c276
https://doi.org/10.1177/0037549711412981
https://doi.org/10.1177/0037549711412981
Publikováno v:
IPDPS Workshops
Taking full advantage of SIMD instructions in C programs still requires tedious and non-portable programming using intrinsics, despite considerable efforts spent developing auto-vectorization capabilities in recent decades. Whole Function Vectorizati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b4d4566618bd43424cf8490b9b67f9e
https://doi.org/10.1109/ipdpsw.2015.37
https://doi.org/10.1109/ipdpsw.2015.37
Publikováno v:
PLDI
Most implementations of the Single Instruction Multiple Data (SIMD) model available today require that data elements be packed in vector registers. Operations on disjoint vector elements are not supported directly and require explicit data reorganiza
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cbb5e93ce8a672b884cac7fb592ab639
https://doi.org/10.1145/1133255.1133997
https://doi.org/10.1145/1133255.1133997
Publikováno v:
Discrete Applied Mathematics. 149(1-3):154-173
For any two n-bit numbers a ≤ b define the Boolean function f[a,b] : {0, 1}n → {0, 1} to be the function for which f[a,b] (x) = 1 if and only if x is the binary representation of a number in the interval [a, b]. We consider the disjunctive normal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc1e2949533d1e3f5f71bed79b8a37ea