Harris corner detection on a NUMA manycore

O Haggui, C Tadonki, L Lacassagne, F Sayadi… - Future Generation …, 2018 - Elsevier
Corner detection is a key kernel for many image processing procedures including pattern
recognition and motion detection. The latter, for instance, mainly relies on the corner points …

Intermediate representations for explicitly parallel programs

A Susungi, C Tadonki - ACM Computing Surveys (CSUR), 2021 - dl.acm.org
While compilers generally support parallel programming languages and APIs, their internal
program representations are mostly designed from the sequential programs standpoint …

Energy Concerns with HPC Systems and Applications

R Nana, C Tadonki, P Dokládal, Y Mesri - arXiv preprint arXiv:2309.08615, 2023 - arxiv.org
For various reasons including those related to climate changes,{\em energy} has become a
critical concern in all relevant activities and technical designs. For the specific case of …

3D parallel tiled code implementing a modified Knuth's optimal binary search tree algorithm

W Bielecki, P Blaszynski, M Poliwoda - Journal of Computational Science, 2021 - Elsevier
This paper presents an approach to generation of 3D parallel tiled code implementing an
optimal binary search tree (OBST) algorithm. We demonstrate that the features of data …

[PDF][PDF] Proving properties of multidimensional recurrences with application to regular parallel algorithms

D Cachera, P Quinton, S Rajopadhye… - … 15th International Parallel …, 2001 - Citeseer
We present a set of verification methods to prove properties of parallel systems described by
means of multidimensional affine recurrence equations. We use polyhedral analysis and …

Quadratic control signals in linear systolic arrays

S Bowden, D Wilde… - … Conference on Application …, 2000 - ieeexplore.ieee.org
We describe a new problem in the control of systolic arrays that arises with multidimensional
time called the quadratic control problem. We present a solution for the problem as well as …

Basic parallel and distributed computing curriculum

C Tadonki - arXiv preprint arXiv:1802.04211, 2018 - arxiv.org
With the advent of multi-core processors and their fast expansion, it is quite clear that {\em
parallel computing} is now a genuine requirement in Computer Science and Engineering …

[图书][B] Parallelization of the algebraic path problem on linear SIMD/SPMD arrays

D Cachera, S Rajopadhye, T Risset, C Tadonki - 2001 - irisa.fr
We derive an e cient vlsi suitable, linear simd architecture for the algebraic path problem
app. For a graph with n nodes, our array has n processors, each with n+ 3 memory cells, and …

[PS][PS] Contribution à la compilation de nids de boucles sur silicium

T Risset - Habilitation à diriger des recherches, Université de …, 2000 - irisa.fr
Ce document traite de la compilation de circuits intégrés. Aujourd'hui les circuits intégrés
sont décrits “à la main” en langage VHDL avant d'être implémentés. La complexité des …

[PDF][PDF] The algebraic path problem on the Cell/BE processor

K Matsumoto, SG Sedukhin… - The University of Aizu …, 2010 - researchgate.net
Abstract The Algebraic Path Problem (APP) unifies well-known matrix, graph, and language
problems, such as matrix inversion, all-pairs shortest paths (APSP), maximum capacity paths …