Filter your results
- 92
- 34
- 49
- 33
- 20
- 15
- 4
- 2
- 1
- 1
- 1
- 19
- 118
- 16
- 1
- 4
- 3
- 5
- 9
- 10
- 3
- 7
- 12
- 8
- 13
- 8
- 18
- 5
- 5
- 5
- 5
- 2
- 2
- 1
- 126
- 112
- 109
- 25
- 17
- 15
- 9
- 7
- 6
- 6
- 6
- 4
- 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
- 126
- 22
- 16
- 15
- 11
- 11
- 10
- 9
- 8
- 7
- 7
- 6
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 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
- 1
- 1
126 Results
|
On optimal and balanced sparse matrix partitioning problems2012 IEEE International Conference on Cluster Computing, Sep 2012, Beijing, China. pp.257--265, ⟨10.1109/CLUSTER.2012.77⟩
Conference papers
hal-00763535v1
|
||
|
Integrated data placement and task assignment for scientific workflows in cloudsProceedings of the fourth international workshop on Data-intensive distributed computing, Jun 2011, New York, NY, USA, United States. pp.45--54, ⟨10.1145/1996014.1996022⟩
Conference papers
hal-00786551v1
|
||
|
Preconditioning Techniques Based on the Birkhoff–von Neumann DecompositionComputational Methods in Applied Mathematics, 2016, ⟨10.1515/cmam-2016-0040⟩
Journal articles
hal-01318486v4
|
||
|
High performance tensor-vector multiplies on shared memory systems[Research Report] RR-9274, Inria - Research Centre Grenoble – Rhône-Alpes. 2019, pp.1-20
Reports
hal-02123526v2
|
||
|
Efficient and effective sparse tensor reorderingICS 2019 - ACM International Conference on Supercomputing, Jun 2019, Phoenix, United States. pp.227-237, ⟨10.1145/3330345.3330366⟩
Conference papers
hal-02306569v1
|
||
|
Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector MultipliesSIAM Journal on Scientific Computing, 2004, 25 (6), pp.1837--1859
Journal articles
hal-00807276v1
|
||
Out-of-core solution for singleton right hand-side vectorsDagstuhl Seminar on Combinatorial Scientific Computing, Feb 2009, Saarbrucken, Germany
Conference papers
hal-00786566v1
|
|||
Partitioning problems on trees and simple meshesSIAM Conference on Parallel Processing for Scientific Computing, Feb 2012, Savannah, GA, United States
Conference papers
hal-00789660v1
|
|||
|
Investigations on push-relabel based algorithms for the maximum transversal problem[Research Report] RR-8093, INRIA. 2012, pp.27
Reports
hal-00739360v3
|
||
|
Comments on the hierarchically structured bin packing problemInformation Processing Letters, 2015, 115 (2), pp.306--309. ⟨10.1016/j.ipl.2014.10.001⟩
Journal articles
hal-01071414v2
|
||
|
Karp-Sipser based kernels for bipartite graph matchingALENEX20 - SIAM Symposium on Algorithm Engineering and Experiments, Jan 2020, Salt Lake City, Utah, United States. pp.1-12
Conference papers
hal-02350734v1
|
||
|
Fully-dynamic Weighted Matching Approximation in PracticeACDA 2021 - SIAM Conference on Applied and Computational Discrete Algorithms, SIAM, Jul 2021, Virtual, France. ⟨10.1137/1.9781611976830.4⟩
Conference papers
hal-03210915v1
|
||
|
A Matrix Partitioning Interface to PaToH in MATLABParallel Computing, 2010, 36 (5--6), pp.254--272. ⟨10.1016/j.parco.2009.12.008⟩
Journal articles
ensl-00536959v1
|
||
|
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a RecipeSIAM Journal on Scientific Computing, 2010, 32 (2), pp.656--683. ⟨10.1137/080737770⟩
Journal articles
ensl-00536961v1
|
||
Minimizing Communication Cost in Fine-Grain Partitioning of Sparse MatricesComputer and Information Sciences - ISCIS 2003, 2003, Unknown, pp.926--933
Conference papers
hal-00807377v1
|
|||
Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositoriesJournal of Parallel and Distributed Computing, 2007, 67, pp.271--285
Journal articles
hal-00803511v1
|
|||
|
Push-relabel based algorithms for the maximum transversal problemComputers and Operations Research, 2013, 40 (5), pp.1266-1275. ⟨10.1016/j.cor.2012.12.009⟩
Journal articles
hal-00763920v1
|
||
|
Algorithms and data structures for hyperedge queries[Research Report] RR-9390, Inria Grenoble Rhône-Alpes. 2022, pp.28
Reports
hal-03127673v4
|
||
|
Combinatorial Tiling for Sparse Neural Networks2020 IEEE High Performance Extreme Computing (virtual conference), Sep 2020, Waltham, MA, United States
Conference papers
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
Journal articles
hal-00803479v1
|
||
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
Book sections
hal-00763372v1
|
|||
|
Acyclic partitioning of large directed acyclic graphs[Research Report] RR-9163, Inria - Research Centre Grenoble – Rhône-Alpes. 2018
Reports
hal-01744603v1
|
||
Partitioning regular meshes for minimizing the total communication volumeSIAM Conference on Parallel Processing for Scientific Computing (PP10), Feb 2010, Seattle, WA, United States
Conference papers
hal-00786561v1
|
|||
|
Semi-two-dimensional partitioning for parallel sparse matrix-vector multiplicationPCO2015 (IPDPSW), May 2015, Hyderabad, India. pp.1125--1134
Conference papers
hal-01159692v1
|
||
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
Book sections
hal-00803471v1
|
|||
|
Fast and high quality topology-aware task mapping29th IEEE International Parallel & Distributed Processing Symposium, May 2015, Hyderabad, India
Conference papers
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
Book sections
hal-00945071v1
|
|||
On optimal tree traversals for sparse matrix factorizationIPDPS'2011, the 25th IEEE International Parallel and Distributed Processing Symposium, 2011, Unknown
Conference papers
hal-00945078v1
|
|||
|
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
Conference papers
hal-02332496v1
|
||
|
Fill-in reduction in sparse matrix factorizations using hypergraphs[Research Report] RR-8448, INRIA. 2014
Reports
hal-00932882v2
|