Jens Gustedt
- Compilation pour les Architectures MUlti-coeurS (CAMUS)
- Informatique et Calcul Parallèle Scientifique (ICube-ICPS)
- Axe Calcul scientifique (ICube-CS)
Publications
Publications
|
|
Modern CManning, 2025, 9781633437777 |
A Provenance-aware Memory Object Model for CISO/IEC TC1/SC22/WG14, pp.131, 2022 |
|
A Common C/C++ Core SpecificationISO TC1/SC22/WG14, pp.629, 2021 |
|
Defer Mechanism for {C}ISO TC1/SC22/WG14, pp.57, 2020 |
|
|
Algorithmic Aspects of Ordered StructuresMathematics [math]. Technische Universität Berlin, 1992. English. ⟨NNT : ⟩ |
|
|
Transparent distributed data management in large scale distributed systemsPervasive Computing, Academic Press, pp.153-194, 2016, 978-0-12-803663-1 |
Development methodologies for GPU and cluster of GPUsRaphaël Couturier. Development methodologies for GPU and cluster of GPUs, Chapman & Hall/CRC, 2013, 978-1-4665-7162-4 |
|
|
|
Generalized Attachment Models for the Genesis of Graphs with High Clustering CoefficientSanto Fortunato and Giuseppe Mangioni and Ronaldo Menezes and Vincenzo Nicosia. Complex Networks - Results of the 2009 International Workshop on Complex Networks (CompleNet 2009), 207, Springer Berlin / Heidelberg, pp.99-113, 2009, Studies in Computational Intelligence, 978-3-642-01205-1. ⟨10.1007/978-3-642-01206-8_9⟩ |
|
|
A modèle, modèle et demi… réflexion participative5èmes Journées de Modélisation des Surfaces Continentales, Jun 2024, Strasbourg, France |
|
|
Pairing GIS and Distributed Hydrological Models Using MATLAB2nd Conference of the Arabian Journal of Geosiences (CAJG 2019), Nov 2019, Sousse, Tunisia. pp.257-259, ⟨10.1007/978-3-030-72543-3_103⟩ |
|
|
C language mechanism for error handling and deferred cleanupSAC 2021 - 36th ACM/SIGAPP Symposium on Applied Computing, Mar 2021, Virtual, South Korea. ⟨10.1145/3412841.3442116⟩ |
Evaluating the impact of modeling uncertainties on decision makers: application to the Maginot's Water Line resourcesILTER Open Science Meeting, Sep 2019, Leipzig, Germany |
|
|
|
Memory access classification for vertical task parallelismPDP 2019 - 27th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, Feb 2019, Pavia, Italy |
Arbogast: 'du calcul des dérivations' to higher order ADJournée du GDR Calcul, Nov 2019, Florence, Italy |
|
|
|
Automatic, Abstracted and Portable Topology-Aware Thread PlacementIEEE Cluster, Sep 2017, Hawaï, United States. pp.389 - 399, ⟨10.1109/CLUSTER.2017.71⟩ |
|
|
Futex based locks for C11's generic atomics (extended abstract)The 31st Annual ACM Symposium on Applied Computing, Apr 2016, Pisa, Italy. ⟨10.1145/2851613.2851956⟩ |
|
|
Resource-Centered Distributed Processing of Large Histopathology Images19th IEEE International Conference on Computational Science and Engineering, Aug 2016, Paris, France |
|
|
Automatic Code Generation for Iterative Multi-dimensional Stencil ComputationsHigh Performance Computing, Data, and Analitics, Dec 2016, Hydarabat, India |
|
|
Le modèle de programmation ORWL pour la parallélisation d'une application de suivi vidéo HD sur architecture multi-coeursConf{\'e}rence d'informatique en Parall{\'e}lisme, Architecture et Syst{\`e}me (COMPAS), Jul 2016, Lorient, France |
|
|
Towards Complete Tracking of Provenance in Experimental Distributed Systems ResearchREPPAR - Second International Workshop on Reproducibility in Parallel Computing -- held together with Euro-Par, Aug 2015, Vienna, Austria |
|
|
EPISCIENCES - an overlay publication platformELPUB2014 - International Conference on Electronic Publishing, Alexander Technological Education Institute of Thessaloniki, Jun 2014, Thessalonique, Greece. pp.78-87, ⟨10.3233/978-1-61499-409-1-78⟩ |
|
|
A workflow-inspired, modular and robust approach to experiments in distributed systemsCCGRID - 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, May 2014, Chicago, United States |
|
|
Resource Centered Computing delivering high parallel performanceHeterogeneity in Computing Workshop (HCW 2014), May 2014, Phenix, AZ, United States |
|
|
Relaxed Synchronization with Ordered Read-Write LocksEuro-Par 2011: Parallel Processing Workshops, Aug 2011, Bordeaux, France. pp.387-397 |
|
|
A Dynamic Distributed Algorithm for Read Write Locks (extended abstract)PDP 2012 - 20th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, Feb 2012, München, Germany. pp.180-184, ⟨10.1109/PDP.2012.32⟩ |
|
|
InterCell: a Software Suite for Rapid Prototyping and Parallel Execution of Fine Grained ApplicationsPARA 2010 - 10th International Conference on Applied Parallel and Scientific Computing, Jun 2010, Reykjavík, Iceland. pp.282-292, ⟨10.1007/978-3-642-28151-8⟩ |
|
|
Modeling and Experimental Validation of the Data Handover APIAdvances in Grid and Pervasive Computing, May 2011, Oulu, Finland. pp.117-126 |
|
|
Methods for Emulation of Multi-Core CPU Performance13th IEEE International Conference on High Performance Computing and Communications (HPCC-2011), Sep 2011, Banff, Canada. pp.288 - 295, ⟨10.1109/HPCC.2011.45⟩ |
|
|
InterCell: a Software Suite for Rapid Prototyping and Parallel Execution of Fine Grained ApplicationsPARA 2010 : State of the Art in Scientific and Parallel Computing, Jun 2010, Reykjavick, Iceland. 4 p |
|
|
Accurate emulation of CPU performance8th International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Platforms - HeteroPar'2010, Aug 2010, Ischia, Italy |
|
|
Experimenting Iterative Computations with Ordered Read-Write Locks18th Euromicro International Conference on Parallel, Distributed and network-based Processing, Feb 2010, Pisa, Italy. pp.155-162, ⟨10.1109/PDP.2010.11⟩ |
Validating Wrekavoc: A tool for heterogeneity emulationHeterogenity in Computing Workshop (HCW 09) in International Parallel and Distributed Processing Symposium - IPDPS 2009, May 2009, Rome, Italy. pp.1-12, ⟨10.1109/IPDPS.2009.5160913⟩ |
|
Cellular based simulation of semiconductors thin filmsInnovations in Thin Film Processing and Characterization - ITFPC 09, Nov 2009, Nancy, France |
|
Engineering Parallel In-Place Random Generation of Integer PermutationsInternational Workshop on Experimental Algorithms, WEA 2008, May 2008, Provincetown, MA, United States. pp.129-141 |
|
|
|
Out-of-Core Wavefront Computations with Reduced Synchronization16th Euromicro International Conference on Parallel, Distributed and network-based Processing, Feb 2008, Toulouse, France. pp.293-300 |
|
|
An Interactive Problem Modeller and PDE Solver, Distributed on Large Scale ArchitecturesThird International Workshop on Distributed Frameworks for Multimedia Applications - DFMA '07, Jun 2007, Paris, France |
|
|
The parXXL Environment: Scalable Fine Grained Development for Large Coarse Grained PlatformsPARA-06: Worshop on state-of-the-art in scientific and parallel computing, Jun 2006, Umea, Sweden. pp.1094-1104, ⟨10.1007/978-3-540-75755-9_127⟩ |
|
|
parXXL: A Fine Grained Development Environment on Coarse Grained ArchitecturesWorkshop on State-of-the-Art in Scientific and Parallel Computing - PARA'06, Jun 2006, Umeå/Sweden, Sweden |
|
|
Bounded Arboricity to Determine the Local Structure of Sparse Graphs32 International Workshop on Graph-Theoretic Concepts in Computer Science - WG 2006, Jun 2006, Bergen, Norway. pp.159-167, ⟨10.1007/11917496_15⟩ |
Data Handover: Reconciling Message Passing and Shared MemoryFoundations of Global Computing, 2006, Dagstuhl, Germany |
|
|
|
An experimental validation of the PRO model for parallel and distributed computation14th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP 2006), Feb 2006, Montbeliard-Sochaux, France. pp.449-456 |
A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent SetItalian Conference on Theoretical Computer Science - ICTCS'03, EATCS, Oct 2003, Bertinoro, Italy, pp.125-136, ⟨10.1007/b13810⟩ |
|
Towards Realistic Implementations of External Memory Algorithms using a Coarse Grained ParadigmInternational Conference on Computer Science and its Applications - ICCSA'2003, 2003, Montréal, Canada, pp.269-278 |
|
|
|
Performance Implications by the Hierarchical Design of ClustersThe 7th world multiconference on Systemics, Cybernetics and Informatics - SCI'2003, Jul 2003, Orlando, USA, 6 p |
|
|
Randomized Permutations in a Coarse Grained Parallel Environment [extended abstract]Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures - SPAA'03, ACM, Jun 2003, San Diego, CA, United States. pp.248-249 |
SSCRAP: An Environment for Coarse Grained Algorithms14th IASTED International Conference on Parallel and Distributed Computing and Systems - PDCS'2002, Nov 2002, Boston, MA, USA, pp.398-403 |
|
The Treewidth of Java Programs4th International Workshop on Algorithm Engineering and Experiments - ALENEX'02, 2002, San Francisco, CA US, 12 p |
|
GRID 2002Ecole thèmatique sur la globalisation des ressources informatiques et des données, Emmanuel Jeannot, Dec 2002, Aussois, France |
|
PRO: a Model for Parallel Resource-Optimal Computation16th Annual International Symposium on High Performance Computing Systems and Applications, Jun 2002, Moncton, New Brunswick, Canada, pp.106-113 |
|
SSCRAP : environnement de développement pour les modèles parallèles à gros grainQuatorzième édition des Rencontres Francophones du Parallélisme - RENPAR'14, Apr 2002, Hammamet, Tunisie, 8 p |
|
Portable List Ranking: an Experimental StudyWAE 2000 - Workshop on Algorithm Engineering, 2000, Saarbrücken, Germany. pp.111-122, ⟨10.1007/3-540-44691-5_10⟩ |
|
|
|
JUMBO : protocole de routage unicast dans les réseaux ad-hoc2ièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications - ALGOTEL 2000, 2000, La Rochelle, France. pp.31-34 |
Graph Coloring on a Coarse Grained Multiprocessor26th International Workshop on Graph-Theoretic Concepts in Computer Science - WG'2000, 2000, Konstanz, Germany, pp.184-195 |
|
|
|
Union-Find Volume Segmentation7th International Workshop on Combinatorial Image Analysis - IWCIA'2000, 2000, Caen, France. pp.181-197 |
Handling Graphs According to a Coarse Grained Approach: Experiments with PVM and MPI7th European PVM/MPI Users' Group Meeting, Sep 2000, Balatonfüred, Hungary. pp.72-79 |
|
Interval Reductions and Extensions of Orders: Bijections to Chains in Lattices10th International Conference on Formal Power Series and Algebraic Combinatorics, 1998, Toronto, Canada |
|
Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel15th Symposium on Theoretical Aspects of Computer Science (STACS '98), 1998, Paris, France. pp.421-431 |
|
Linear-Time Register Allocation for a Fixed Number of Registers and no Stack VariablesNinth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98), 1998, San Francisco, CA, United States. pp.574-583 |
|
Efficient Union-Find for Planar Graphs and other Sparse Graph ClassesGraph-Theoretic Concepts in Computer Science, 1996, Cadenabbia, Italy. pp.181-195 |
|
Weak-Order Extensions of an OrderGraph-Theoretic Concepts in Computer Science, 1997, Berlin, Germany. pp.65-77 |
|
A Pratical and Efficient Algorithm for Substitution DecompositionProceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'97), 1997, New Orleans, United States. pp.26-35 |
|
Memory Management for Union-Find AlgorithmsSTACS: Symposium on Theoretical Aspects of Computer Science, Feb 1997, Lübeck, Germany. pp.67-79, ⟨10.1007/BFb0023449⟩ |
|
|
|
A compact data structure and parallel algorithms for permutation graphs21st Workshop on Graph-Theoretic Concepts in computer Science (WG), 1995, Aachen, Germany. pp.372-380, ⟨10.1007/3-540-60618-1⟩ |
Testing Hereditary Properties Efficiently on AverageProceedings of the International Workshop on Orders, Algorithms and Applications ( ORDAL'94), 1994, Lyon, France. pp.100-116 |
|
Well-Quasi-Ordering Finite PosetsGraph Structure Theory, 1993, Seattle, United States. pp.511-515 |
C semantics for contractsN3739, ISO JCT1/SC22/WG14. 2025 |
|
Properly specify the interaction of library calls for condition variablesN3764, ISO JCT1/SC22/WG14. 2025 |
|
Add type-safe minimum and maximum type-generic macrosISO JCT1/SC22/WG14. 2025 |
|
Clean up atomics, non-normative changesN3761, ISO JCT1/SC22/WG14. 2025 |
|
static_assert without UBN3525, ISO JCT1/SC22/WG14. 2025 |
|
Properly specify the interaction of library calls for mutexesN3763, ISO JCT1/SC22/WG14. 2025 |
|
Array subscripting without decayN3517, ISO JCT1/SC22/WG14. 2025 |
|
Even simpler defer for direct integrationN3497, ISO JCT1/SC22/WG14. 2025 |
|
Another daemon: waiting for condition variablesN3559, ISO JCT1/SC22/WG14. 2025 |
|
The __COUNTER__ predefined macroN3457, ISO JCT1/SC22/WG14. 2025 |
|
Clarify the specification of the width macrosN3496, ISO JCT1/SC22/WG14. 2025 |
|
Chasing Ghosts I: constant expressionsN3558, ISO JCT1/SC22/WG14. 2025 |
|
Clarify status of non-returning functions with respect to function attributesN3494, ISO JCT1/SC22/WG14. 2025 |
|
Chasing Ghosts II: accessing allocated storageN3448, ISO JCT1/SC22/WG14. 2025 |
|
Reproducible expressionsN3499, ISO JCT1/SC22/WG14. 2025 |
|
Objects of known constant sizeN3508, ISO JCT1/SC22/WG14. 2025 |
|
Retire the concept of consume operationsN3607, ISO JCT1/SC22/WG14. 2025 |
|
Clarify syntactic terms for array declaratorsN3414, ISO JCT1/SC22/WG14. 2024 |
|
|
|
Remove imaginary typesN3274, ISO JCT1/SC22/WG14. 2024, pp.12 |
Tail recursion for preprocessor macrosN3307, ISO JCT1/SC22/WG14. 2024 |
|
Inline functions accessing identifiers declared with constexprN3253, ISO JCT1/SC22/WG14. 2024 |
|
Introduce complex literalsN3298, ISO JCT1/SC22/WG14. 2024 |
|
Even simpler defer for direct integrationN3434, ISO JCT1/SC22/WG14. 2024 |
|
Clarify status of non-returning functions with respect to function attributesN3424, ISO JCT1/SC22/WG14. 2024 |
|
Clarify the specification of the width macrosN3413, ISO JCT1/SC22/WG14. 2024 |
|
Reproducible expressionsN3392, ISO JCT1/SC22/WG14. 2024 |
|
Some constants are literally literalsN3239, ISO JCT1/SC22/WG14. 2024 |
|
Array subscripting without decayN3380, ISO JCT1/SC22/WG14. 2024 |
|
Objects of known constant sizeN3391, ISO JCT1/SC22/WG14. 2024 |
|
Clarify array length specifications and sizeof expressionsN3187, ISO JCT1/SC22/WG14. 2023 |
|
Simple TU initialization and cleanup handling with dependenciesN3185, ISO JCT1/SC22/WG14. 2023 |
|
|
|
Parameter Forward DeclarationsN3140, ISO JCT1/SC22/WG14. 2023, pp.3 |
Initialization, allocation and effective typeN3186, ISO JCT1/SC22/WG14. 2023 |
|
The future of imaginary typesN3206, ISO JCT1/SC22/WG14. 2023 |
|
Extensions to the preprocessor for C2YN3190, ISO JCT1/SC22/WG14. 2023 |
|
Identifying array length stateISO JCT1/SC22/WG14. 2023 |
|
Introduce storage-class specifiers for compound literals[Research Report] N3038, ISO JCT1/SC22/WG14. 2022 |
|
|
|
Basic lambdas for CN2892, ISO JCT1/SC22/WG14. 2022, pp.52 |
|
|
Improve type generic programming[Technical Report] N2890, ISO JCT1/SC22/WG14. 2022, pp.82 |
|
|
Properly define blocks as part of the grammar[Research Report] N2937, ISO JCT1/SC22/WG14. 2022, pp.3 |
|
|
Add new optional time bases[Research Report] N2957, ISO JCT1/SC22/WG14. 2022 |
|
|
Type inference for variable definitions and function returns[Research Report] N2923, ISO JCT1/SC22/WG14. 2022, pp.22 |
Pointers and integer types[Research Report] N2889, ISO JCT1/SC22/WG14. 2022 |
|
|
|
Revise spelling of keywords[Research Report] N2934, ISO JTC1/SC22/WG14. 2022 |
Require exact-width integer type interfaces[Research Report] N2888, ISO JTC1/SC22/WG14. 2022 |
|
Primary expressions and constant expressions, clarification request[Research Report] ISO JTC1/SC22/WG14. 2022 |
|
Underspecified object declarations[Research Report] N3006, ISO JCT1/SC22/WG14. 2022 |
|
Unsequenced functions[Research Report] Inria Nancy - Grand Est. 2022, pp.11 |
|
The constexpr specifier for object definitions[Research Report] N3018, ISO JCT1/SC22/WG14. 2022 |
|
Type inference for object definitions[Research Report] N3007, ISO JCT1/SC22/WG14. 2022 |
|
|
|
Make false and true first-class language features[Research Report] N2935, ISO JTC1/SC22/WG14. 2022 |
|
|
Type-generic lambdas[Research Report] N2924, ISO JCT1/SC22/WG14. 2022, pp.14 |
Remove ATOMIC VAR INIT[Research Report] N2886, ISO JTC1/SC22/WG14. 2022 |
|
Introduce the nullptr constant[Research Report] N3042, ISO JTC1/SC22/WG14. 2022 |
|
|
|
Make call_once mandatory[Research Report] 2840, ISO JCT1/SC22/WG14. 2021 |
|
|
Add annotations for unreachable control flow[Research Report] 2826, ISO JCT1/SC22/WG14. 2021, pp.10 |
|
|
Disambiguate the storage class of some compound literals[Research Report] 2819, ISO JCT1/SC22/WG14. 2021, pp.2 |
Types and sizes[Research Report] 2838, ISO JTC1/SC22/WG14. 2021 |
|
A simple defer feature for C[Research Report] N2895, ISO JTC1/SC22/WG14. 2021 |
|
|
|
Lvalue closures[Research Report] N2737, ISO JCT1/SC22/WG14. 2021, pp.12 |
|
|
Enforce storage stability[Research Report] 2756, ISO JCT1/SC22/WG14. 2021, pp.8 |
Indeterminate Values and Trap Representations[Research Report] 2772, ISO TC1/SC22/WG14. 2021, pp.11 |
|
Identifier Syntax using Unicode Standard Annex 31[Research Report] 2836, ISO JCT1/SC22/WG14. 2021, pp.18 |
|
|
|
Only reserve names of optional functions if necessary[Research Report] 2839, ISO JCT1/SC22/WG14. 2021 |
Wide Function Pointer Types for Pairing Code and Data[Research Report] 2787, ISO JCT1/SC22/WG14. 2021 |
|
|
|
Function literals and value closures[Technical Report] N2736, ISO JCT1/SC22/WG14. 2021, pp.55 |
|
|
Deferred cleanup and error handling in C[Research Report] RR-9385, Inria Nancy - Grand Est. 2020, pp.19 |
|
|
C source-to-source compiler enhancement from within[Research Report] RR-9375, INRIA. 2020 |
|
|
C provenance semantics: examples[Technical Report] N2363, ISO JCT1/SC22/WG14. 2019 |
|
|
Remove conditional "WANT" macros from numbered clauses proposal for C2x[Technical Report] N2359, ISO JTC1/SC22/WG14. 2019 |
|
|
Moving to two's complement sign representation[Research Report] N2330, ISO JCT1/SC22/WG14. 2019 |
|
|
ISO/IEC 9899 editor report March 2019[Technical Report] N2348, ISO JCT1/SC22/WG14. 2019 |
|
|
Modernize time.h functions[Research Report] N2417, ISO JCT1/SC22/WG14. 2019 |
|
|
Add an interface to query resolution of time bases[Research Report] N2459, ISO JTC1/SC22/WG14. 2019 |
|
|
Out-of-band bit for exceptional return and errno replacement[Technical Report] N2361, ISO JCT1/SC22/WG14. 2019 |
|
|
ISO/IEC 9899 editor report November 2019[Research Report] N2456, ISO JCT1/SC22/WG14. 2019 |
|
|
Synchronization at thread and execution termination[Research Report] N2461, ISO JTC1/SC22/WG14. 2019 |
|
|
Moving to a provenance-aware memory object model for C: proposal for C2x[Technical Report] N2362, ISO JCT1/SC22/WG14. 2019 |
|
|
intmax\_t, a way out[Research Report] N2425, ISO JCT1/SC22/WG14. 2019 |
|
|
Introduce the term storage instance[Technical Report] N2388, ISO JTC1/SC22/WG14. 2019 |
|
|
Contain the floating point naming explosion[Research Report] N2426, ISO JCT1/SC22/WG14. 2019 |
|
|
Remove support for function definitions with identifier lists[Research Report] N2432, ISO JCT1/SC22/WG14. 2019 |
|
|
Align spelling of keywords with C++ and make them feature tests proposal for C2x[Technical Report] n2368, ISO JCT1/SC22/WG14. 2019 |
|
|
Unify string representation functions[Technical Report] ISO JCT1/SC22/WG14. 2019 |
|
|
Two's complement sign representation for C2x[Research Report] ISO JCT1/SC22/WG14. 2019, pp.N2412 |
|
|
Clean up atomics, non-normative changes[Technical Report] N2389, ISO JTC1/SC22/WG14. 2019 |
|
|
Function failure annotation[Research Report] N2429, ISO JCT1/SC22/WG14. 2019 |
|
|
Clean up atomics[Technical Report] N2329, ISO JCT1/SC22/WG14. 2018 |
|
|
Memory access classification for vertical task parallelism[Research Report] RR-9182, Inria Nancy - Grand Est. 2018, pp.1-20 |
|
|
Arbogast – Origine d'un outil de dérivation automatique[Rapport de recherche] RR-8911, INRIA. 2016 |
|
|
Fully-abstracted affinity optimization for task-based models[Research Report] RR-8993, INRIA Nancy. 2016 |
|
|
Underspecified Aspects of Threads in C[Technical Report] RT-0470, Inria. 2015 |
|
|
Modular C[Research Report] RR-8751, INRIA. 2015 |
|
|
Futex based locks for C11's generic atomics[Research Report] RR-8818, INRIA Nancy. 2015 |
|
|
Data handover on a peer-to-peer system[Research Report] RR-8690, Inria Nancy - Grand Est (Villers-lès-Nancy, France); INRIA. 2015, pp.37 |
|
|
Multi-Site Emulation using Wrekavoc: Validating Distributed Algorithms and Applications[Research Report] RR-6696, INRIA. 2008, 30 p |
|
|
Numerical results for generalized attachment models for the genesis of graphs[Technical Report] RT-0361, INRIA. 2008, 74 p |
|
|
Sublinear Communication for Integer Permutations[Research Report] RR-6403, INRIA. 2007, 20 p |
|
|
SSCRAP : Soft Synchronized Computing in Rounds for Adequate Parallelization[Research Report] RR-5184, INRIA. 2004 |
|
|
Data Handover: Reconciling Message Passing and Shared Memory[Research Report] RR-5383, INRIA. 2004, pp.17 |
|
|
External Memory Algorithms using a Coarse Grained Paradigm[Research Report] RR-5142, INRIA. 2004 |
|
|
Towards Realistic Implementations of External Memory Algorithms using a Coarse Grained Paradigm[Research Report] RR-4719, INRIA. 2003 |
|
|
Randomized Permutations in a Coarse Grained Parallel Environment[Research Report] RR-4639, INRIA. 2002, pp.12 |
|
|
The Treewidth of Java Programs[Research Report] RR-4318, INRIA. 2001, pp.11 |
|
|
PRO: a model for Parallel Resource-Optimal Computation[Research Report] RR-4319, INRIA. 2001, pp.11 |
|
|
A Work-Optimal Algorithm on log delta n Processors for a P-Complete Problem[Research Report] RR-4174, INRIA. 2001, pp.9 |
|
|
List Ranking on PC Clusters[Research Report] RR-3869, INRIA. 2000, pp.14 |
|
|
Graph Coloring on a Coarse Grained Multiprocessor (extended abstract)[Research Report] RR-3906, INRIA. 2000, pp.11 |
|
|
Java Programs do not have Bounded Treewidth[Research Report] RR-3870, INRIA. 2000, pp.6 |
|
|
Communication and Memory Optimized Tree Contraction and List Ranking[Research Report] RR-4061, INRIA. 2000, pp.9 |
|
|
Feasability, Portability, Predictability and Efficiency : Four Ambitious Goals for the Design and Implementation of Parallel Coarse Grained Graph Algorithms[Research Report] RR-3885, INRIA. 2000, pp.34 |
|
|
The Handling of Graphs on PC Clusters : A Coarse Grained Approach[Research Report] RR-3897, INRIA. 2000 |
|
|
Efficient and Practical Algorithms for Sequential Modular Decomposition[Research Report] RR-3804, INRIA. 1999, pp.23 |
|
|
Partially Complemented Representations of Digraphs[Research Report] RR-3832, INRIA. 1999, pp.24 |
|
|
List Ranking on a Coarse Grained Multiprocessor[Research Report] RR-3640, INRIA. 1999, pp.14 |
The General Two-Path Problem in Time O(m log n)[Research Report] 1994 |
|
Fast and Good: Image Segmentation using Edge and Region Criteria Simultaneously[Research Report] 1994 |
|
|
A Provenance-aware memory object model for C (slides)2023 |
|
|
Type inference for variables and functions (slides)2022 |
|
|
Improve type generic programming (slides)2022 |
|
|
Options for lambdas2022 |
|
|
Basic lambdas for C (slides)2021 |
|
|
Add annotations for unreachable control flow (slides)2021 |
|
|
Enforce storage stability (slides)2021 |
|
|
A Hybrid Breaching-Filling method for sink removal adapted to parallel hydrological simulationsEGU 2021, Apr 2021, En ligne, France. 2021, ⟨10.5194/egusphere-egu21-7849⟩ |
Resource-Centered Distributed Processing of Large Histopathology Images19th IEEE International Conference on Computational Science and Engineering, Jun 2016, Paris, France. 2016 |
|
|
|
Optimizing Locality by Topology-aware Placement for a Task Based Programming ModelIEEE Cluster 2016 Conference, Sep 2016, Taipei, Taiwan. , pp.164 - 165, ⟨10.1109/CLUSTER.2016.87⟩ |