Filtrer vos résultats
- 96
- 34
- 49
- 33
- 22
- 15
- 4
- 4
- 1
- 1
- 1
- 19
- 122
- 16
- 3
- 2
- 4
- 3
- 5
- 9
- 10
- 3
- 7
- 12
- 9
- 12
- 9
- 17
- 5
- 5
- 5
- 5
- 2
- 2
- 1
- 130
- 116
- 109
- 25
- 17
- 15
- 11
- 9
- 7
- 6
- 6
- 6
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 130
- 22
- 16
- 15
- 11
- 11
- 10
- 9
- 8
- 8
- 8
- 7
- 7
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
130 résultats
|
|
High performance tensor-vector multiplication on shared-memory systemsPPAM 2019 - 13th International Conference on Parallel Processing and Applied Mathematics, Sep 2019, Bialystok, Poland. pp.1-11
Communication dans un congrès
hal-02332496v1
|
||
Scheduling for Large-Scale SystemsAllen Tucker; Teofilo Gonzalez; Heikki Topi; Jorge Diaz-Herrera. The Computing Handbook - Two-Volume Set, 1, Chapman and Hall/CRC Press, pp.3816, 2014, 9781439898444
Chapitre d'ouvrage
hal-00763372v1
|
|||
Partitioning regular meshes for minimizing the total communication volumeSIAM Conference on Parallel Processing for Scientific Computing (PP10), Feb 2010, Seattle, WA, United States
Communication dans un congrès
hal-00786561v1
|
|||
|
|
Fast and high quality topology-aware task mapping29th IEEE International Parallel & Distributed Processing Symposium, May 2015, Hyderabad, India
Communication dans un congrès
hal-01159677v1
|
||
On hypergraph partitioning based sparse matrix orderingM. Beckers and J. Lotz and V. Mosenkis and U. Naumann. Abstracts of the 5th SIAM Workshop on Combinatorial Scientific Computing, SIAM, pp.36--38, 2011, Technical Report
Chapitre d'ouvrage
hal-00945071v1
|
|||
Adapting iterative-improvement heuristics for scheduling file-sharing tasks on heterogeneous platformsF. Xhafa and A. Abraham. Metaheuristics for Scheduling in Distributed Computing Environments, Springer-Verlag Berlin Heidelberg, pp.121--151, 2008, Studies in Computational Intelligence
Chapitre d'ouvrage
hal-00803471v1
|
|||
|
|
Semi-two-dimensional partitioning for parallel sparse matrix-vector multiplicationPCO2015 (IPDPSW), May 2015, Hyderabad, India. pp.1125--1134
Communication dans un congrès
hal-01159692v1
|
||
|
|
Combinatorial Tiling for Sparse Neural Networks2020 IEEE High Performance Extreme Computing (virtual conference), Sep 2020, Waltham, MA, United States
Communication dans un congrès
hal-02910997v3
|
||
|
|
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed verticesJournal of Parallel and Distributed Computing, 2008, 68, pp.609--625
Article dans une revue
hal-00803479v1
|
||
On optimal tree traversals for sparse matrix factorizationIPDPS'2011, the 25th IEEE International Parallel and Distributed Processing Symposium, 2011, Unknown
Communication dans un congrès
hal-00945078v1
|
|||
|
|
Acyclic partitioning of large directed acyclic graphs[Research Report] RR-9163, Inria - Research Centre Grenoble – Rhône-Alpes. 2018
Rapport
hal-01744603v1
|
||
|
|
UMPa: A Multi-objective, multi-level partitioner for communication minimizationDavid A. Bader; Henning Meyerhenke; Peters Sanders; Dorothea Wagner. Graph Partitioning and Graph Clustering 2012, 588, AMS, pp.53--66, 2013, Contemporary Mathematics, ⟨10.1090/conm/588/11704⟩
Chapitre d'ouvrage
hal-00763563v1
|
||
|
|
Design, implementation, and analysis of maximum transversal algorithmsACM Transactions on Mathematical Software, 2011, 38, pp.13:1--13:31. ⟨10.1145/2049673.2049677⟩
Article dans une revue
hal-00786548v1
|
||
|
|
Scalable sparse tensor decompositions in distributed memory systemsInternational Conference for High Performance Computing, Networking, Storage and Analysis (SC15), Nov 2015, Austin, TX, United States. ⟨10.1145/2807591.2807624⟩
Communication dans un congrès
hal-01148202v2
|
||
|
|
A backward/forward recovery approach for the preconditioned conjugate gradient methodJournal of computational science, 2016, 17 (3), pp.522-534. ⟨10.1016/j.jocs.2016.04.008⟩
Article dans une revue
hal-01354682v1
|
||
On partitioning problems with complex objectivesParallel Processing Workshops (Euro-Par 2011), Aug 2011, Bordeaux, France. pp.334-344, ⟨10.1007/978-3-642-29737-3_38⟩
Communication dans un congrès
hal-00763548v1
|
|||
|
|
Reducing elimination tree height for parallel LU factorization of sparse unsymmetric matricesHiPC 2014, Dec 2014, Goa, India. pp.1--10
Communication dans un congrès
hal-01114413v1
|
||
|
|
Scheduling series-parallel task graphs to minimize peak memoryTheoretical Computer Science, 2018, 707, pp.1-23. ⟨10.1016/j.tcs.2017.09.037⟩
Article dans une revue
hal-01891937v1
|
||
|
|
High-performance parallel algorithms for the Tucker decomposition of higher order sparse tensors[Research Report] RR-8801, Inria - Research Centre Grenoble – Rhône-Alpes. 2015
Rapport
hal-01219316v1
|
||
|
|
Partitioning, matching, and ordering: Combinatorial scientific computing with matrices and tensorsComputer Science [cs]. ENS de Lyon, 2019
HDR
tel-02377874v1
|
||
|
|
Matrix symmetrization and sparse direct solversCSC 2020 - SIAM Workshop on Combinatorial Scientific Computing, Feb 2020, Seattle, United States. pp.1-10
Communication dans un congrès
hal-02417778v1
|
||
|
|
Engineering fast almost optimal algorithms for bipartite graph matchingESA 2020 - European Symposium on Algorithms, Sep 2020, Pisa, Italy
Communication dans un congrès
hal-02463717v3
|
||
|
|
Open Problems in (Hyper)Graph Decomposition2023
Pré-publication, Document de travail
hal-04251953v2
|
||
|
|
Constructing elimination trees for sparse unsymmetric matricesSIAM Journal on Matrix Analysis and Applications, 2013, 34 (2), pp.345-354. ⟨10.1137/110825443⟩
Article dans une revue
inria-00567970v4
|
||
|
|
A Symmetry Preserving Algorithm for Matrix ScalingSIAM Journal on Matrix Analysis and Applications, 2014, 35 (3), pp.25. ⟨10.1137/110825753⟩
Article dans une revue
inria-00569250v4
|
||
The Multifrontal MethodDavid Padua. Encyclopedia of Parallel Computing, Springer, pp.1209-1216, 2011, 978-0-387-09765-7. ⟨10.1007/978-0-387-09766-4_86⟩
Chapitre d'ouvrage
hal-00787015v1
|
|||
Overview of MUMPS (A multifrontal Massively Parallel Solver)2008
Autre publication scientifique
hal-00803490v1
|
|||
|
|
Acyclic Partitioning of Large Directed Acyclic GraphsCCGRID 2017 - 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, May 2017, Madrid, Spain. pp.371-380, ⟨10.1109/CCGRID.2017.101⟩
Communication dans un congrès
hal-01672010v1
|
||
|
|
A scalable clustering-based task scheduler for homogeneous processors using DAG partitioningIPDPS 2019 - 33rd IEEE International Parallel & Distributed Processing Symposium, May 2019, Rio de Janeiro, Brazil. pp.155-165, ⟨10.1109/IPDPS.2019.00026⟩
Communication dans un congrès
hal-02082794v1
|
||
|
|
Combinatorial problems in solving linear systems2011
Pré-publication, Document de travail
ensl-00411638v3
|