EN FR
EN FR
ROMA - 2012
ROMA - 2012




Team Roma
Members
Overall Objectives
Application Domains
Software
New Results
Partnerships and Cooperations
Dissemination
Bibliography




Team Roma
Members
Overall Objectives
Application Domains
Software
New Results
Partnerships and Cooperations
Dissemination
Bibliography


previous Previous | up Home


Bibliography

Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 1J.-Y. L'Excellent.

    Multifrontal Methods: Parallelism, Memory Usage and Numerical Aspects, Ecole normale supérieure de Lyon - ENS LYON, September 2012, Habilitation à Diriger des Recherches.

    http://hal.inria.fr/tel-00737751
  • 2P. Renaud-Goud.

    Energy-aware scheduling : complexity and algorithms, Ecole normale supérieure de Lyon - ENS LYON, July 2012.

    http://hal.inria.fr/tel-00744247

Articles in International Peer-Reviewed Journals

  • 3K. Agrawal, A. Benoit, F. Dufossé, Y. Robert.

    Mapping filtering streaming applications, in: Algorithmica, 2012, vol. 62, no 1, p. 258-308.
  • 4P. R. Amestoy, I. S. Duff, J.-Y. L'Excellent, Y. Robert, F.-H. Rouet, B. Uçar.

    On computing inverse entries of a sparse matrix in an out-of-core environment, in: SIAM Journal on Scientific Computing (SISC), 2012, vol. 34, no 4, p. A1975-A1999.
  • 5G. Aupy, A. Benoit, F. Dufossé, Y. Robert.

    Reclaiming the energy of a schedule: models and algorithms, in: Concurrency and Computation: Practice and Experience, 2012, To appear. Available on-line at the journal website.
  • 6A. Benoit, L.-C. Canon, E. Jeannot, Y. Robert.

    Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms, in: Journal of Scheduling, 2012, vol. 15, no 5, p. 615-627.

    http://dx.doi.org/10.1007/s10951-011-0236-y
  • 7A. Benoit, U. Catalyurek, Y. Robert, E. Saule.

    A survey of pipelined workflow scheduling: models and algorithms, in: ACM Computing Surveys, 2012, To appear.
  • 8A. Benoit, Y. Robert, A. L. Rosenberg, F. Vivien.

    Static strategies for worksharing with unrecoverable interruption, in: Theory of Computing Systems, 2012, To appear..

    http://dx.doi.org/10.1007/s00224-012-9426-z
  • 9K. Kaya, J. Langguth, F. Manne, B. Uçar.

    Push-relabel based algorithms for the maximum transversal problem, in: Computers & Operations Research, 2012, To appear.
  • 10S. K. Prasad, A. Gupta, K. Kant, A. Lumsdaine, D. A. Padua, Y. Robert, A. L. Rosenberg, A. Sussman, C. C. Weems.

    Literacy for all in parallel and distributed computing: guidelines for an undergraduate core curriculum, in: CSI Journal of Computing, 2012, To appear.
  • 11S. K. Prasad, A. Gupta, K. Kant, A. Lumsdaine, D. A. Padua, Y. Robert, A. L. Rosenberg, A. Sussman, C. C. Weems.

    Toward a core undergraduates curriculum in parallel and distributed computing, in: Computer Education (China), 2012, p. 76-90.
  • 12M. L. Stillwell, F. Vivien, H. Casanova.

    Dynamic Fractional Resource Scheduling versus Batch Scheduling, in: Parallel and Distributed Systems, IEEE Transactions on, 2012, vol. 23, no 3.

    http://dx.doi.org/10.1109/TPDS.2011.183

International Conferences with Proceedings

  • 13G. Aupy, A. Benoit, Y. Robert.

    Energy-aware scheduling under reliability and makespan constraints, in: International Conference on High Performance Computing (HiPC'2012), IEEE Computer Society Press, 2012.
  • 14O. Beaumont, N. Bonichon, L. Eyraud-Dubois, L. Marchal.

    Minimizing weighted mean completion time for malleable tasks scheduling, in: Proceedings of IPDPS 2012, IEEE, 2012.
  • 15A. Benoit, M. Coqblin, J.-M. Nicod, L. Philippe, V. Rehn-Sonigo.

    Throughput optimization for pipeline workflow scheduling with setup times, in: Proceedings of CGWS 2012, the CoreGRID/ERCIM Workshop on Grids, Clouds and P2P Computing, in conjunction with EuroPar 2012, Rhodes Island, Greece, August 2012, Also available as Inria Research report RR-7886, Version 2, June 2012.
  • 16A. Benoit, H. Larchevêque, P. Renaud-Goud.

    Optimal algorithms and approximation algorithms for replica placement with distance constraints in tree networks, in: Proceedings of IPDPS 2012, IEEE, 2012.
  • 17A. Benoit, R. Melhem, P. Renaud-Goud, Y. Robert.

    Power-aware Manhattan routing on chip multiprocessors, in: IPDPS'2012, the 26th IEEE International Parallel and Distributed Processing Symposium, IEEE Computer Society Press, 2012.
  • 18H. Casanova, F. Dufossé, Y. Robert, F. Vivien.

    Mapping tightly-coupled applications on volatile resources, in: PDP'2013, the 21st Euromicro Int. Conf. on Parallel, Distributed, and Network-Based Processing, IEEE Computer Society Press, 2013.
  • 19J. Dongarra, M. Faverge, T. Hérault, J. Langou, Y. Robert.

    Hierarchical QR factorization algorithms for multi-core cluster systems, in: IPDPS'2012, the 26th IEEE International Parallel and Distributed Processing Symposium, IEEE Computer Society Press, 2012.
  • 20A. Grandjean, J. Langguth, B. Uçar.

    On optimal and balanced sparse matrix partitioning problems, in: 2012 IEEE International Conference on Cluster Computing, Los Alamitos, CA, USA, IEEE Computer Society, 2012, p. 257–265.
  • 21K. Kaya, F.-H. Rouet, B. Uçar.

    On partitioning problems with complex objectives, in: Euro-Par 2011: Parallel Processing Workshops, M. Alexander, P. D'Ambra, A. Belloum, G. Bosilca, M. Cannataro, M. Danelutto, B. Di Martino, M. Gerndt, E. Jeannot, R. Namyst, J. Roman, S. Scott, J. Traff, G. Vallée, J. Weidendorfer (editors), Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 2012, vol. 7155, p. 334-344.
  • 22Y. Robert, F. Vivien, D. Zaidouni.

    On the complexity of scheduling checkpoints for computational workflowss, in: FTXS'2012, the Workshop on Fault-Tolerance for HPC at Extreme Scale, in conjunction with the 42nd Annual IEEE/IFIP Int. Conf. on Dependable Systems and Networks (DSN 2012), IEEE Computer Society Press, 2012.

    http://dx.doi.org/10.1109/DSNW.2012.6264675
  • 23M. L. Stillwell, F. Vivien, H. Casanova.

    Virtual Machine Resource Allocation for Service Hosting on Heterogeneous Distributed Platforms, in: proceedings of IPDPS 2012, IEEE, 2012.

    http://dx.doi.org/10.1109/IPDPS.2012.75
  • 24Ü. V. Çatalyürek, M. Deveci, K. Kaya, B. Uçar.

    Multithreaded clustering for multi-level hypergraph partitioning, in: 26th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2012,, Shanghai, China, IEEE Computer Society, 2012, p. 848–859.
  • 25Ü. V. Çatalyürek, K. Kaya, B. Uçar.

    On shared-memory parallelization of a sparse matrix scaling algorithm, in: 2012 41st International Conference on Parallel Processing, Los Alamitos, CA, USA, IEEE Computer Society, September 2012, p. 68–77.

Scientific Books (or Scientific Book chapters)

  • 26A. Benoit, L. Marchal, Y. Robert, B. Uçar, F. Vivien.

    Scheduling for large-scale systems, in: The Computing Handbook Set, vol. 1, Chapman and Hall/CRC Press, 2013, To appear.
  • 27I. S. Duff, B. Uçar.

    Combinatorial problems in solving linear systems, in: Combinatorial Scientific Computing, U. Naumann, O. Schenk (editors), CRC Press, 2012, chap. 2, p. 21–68.
  • 28M. Sathe, O. Schenk, B. Uçar, A. Sameh.

    A scalable hybrid linear solver based on combinatorial algorithms, in: Combinatorial Scientific Computing, U. Naumann, O. Schenk (editors), CRC Press, 2012, chap. 4, p. 95–127.
  • 29Ü. V. Çatalyürek, K. Kaya, J. Langguth, B. Uçar.

    A Partitioning-based divisive clustering technique for maximizing the modularity, in: Graph Partitioning and Graph Clustering, D. A. Bader, H. Meyerhenke, P. Sanders, D. Wagner (editors), Contemporary Mathematics, AMS, 2012, to appear.
  • 30Ü. V. Çatalyürek, M. Deveci, K. Kaya, B. Uçar.

    UMPA: A Multi-objective, multi-level partitioner for communication minimization, in: Graph Partitioning and Graph Clustering, D. A. Bader, H. Meyerhenke, P. Sanders, D. Wagner (editors), Contemporary Mathematics, AMS, 2012, to appear.

Internal Reports

  • 31P. R. Amestoy, I. S. Duff, J.-Y. L'Excellent, F.-H. Rouet.

    Parallel computation of entries of A-1, Inria, December 2012, no RR-8142.

    http://hal.inria.fr/hal-00759556
  • 32G. Aupy, A. Benoit.

    Approximation algorithms for energy, reliability and makespan optimization problems, Inria, October 2012, no RR-8107, 32 p.

    http://hal.inria.fr/hal-00742754
  • 33G. Aupy, A. Benoit, Y. Robert.

    Energy-aware scheduling under reliability and makespan constraints, Inria, February 2012, no RR-7757, 25 p.

    http://hal.inria.fr/inria-00630721
  • 34G. Aupy, Y. Robert, F. Vivien, D. Zaidouni.

    Impact of fault prediction on checkpointing strategies, Inria, October 2012, no RR-8023.

    http://hal.inria.fr/hal-00720401
  • 35O. Beaumont, H. Larchevêque, L. Marchal.

    Non-Linear divisible loads: There is no free lunch, Inria, December 2012, no RR-8170, 20 p.

    http://hal.inria.fr/hal-00762008
  • 36A. Benoit, M. Coqblin, J.-M. Nicod, L. Philippe, V. Rehn-Sonigo.

    Throughput optimization for pipeline workflow scheduling with setup times, Inria, February 2012, no RR-7886, 29 p.

    http://hal.inria.fr/hal-00674057
  • 37A. Benoit, J. Langguth, B. Uçar.

    Semi-matching algorithms for scheduling parallel tasks under resource constraints, Inria, October 2012, no RR-8089, 30 p.

    http://hal.inria.fr/hal-00738393
  • 38G. Bosilca, A. Bouteiller, É. Brunet, F. Cappello, J. Dongarra, A. Guermouche, T. Hérault, Y. Robert, F. Vivien, D. Zaidouni.

    Unified Model for Assessing Checkpointing Protocols at Extreme-Scale, Inria, October 2012, no RR-7950.

    http://hal.inria.fr/hal-00696154
  • 39M. Bougeret, H. Casanova, Y. Robert, F. Vivien, D. Zaidouni.

    Using group replication for resilience on exascale systems, Inria, February 2012, no RR-7876.

    http://hal.inria.fr/hal-00668016
  • 40H. Casanova, F. Dufossé, Y. Robert, F. Vivien.

    Mapping Tightly-Coupled Applications on Volatile Resources, May 2012.

    http://hal.inria.fr/ensl-00697621
  • 41H. Casanova, Y. Robert, F. Vivien, D. Zaidouni.

    Combining Process Replication and Checkpointing for Resilience on Exascale Systems, Inria, May 2012, no RR-7951.

    http://hal.inria.fr/hal-00697180
  • 42K. Kaya, J. Langguth, F. Manne, B. Uçar.

    Investigations on push-relabel based algorithms for the maximum transversal problem, Inria, October 2012, no RR-8093, 27 p.

    http://hal.inria.fr/hal-00739360
  • 43P. A. Knight, D. Ruiz, B. Uçar.

    A Symmetry preserving algorithm for matrix scaling, Inria, October 2012, no revision of RR-7552.

    http://hal.inria.fr/inria-00569250
  • 44L. Marchal, O. Sinnen, F. Vivien.

    Scheduling tree-shaped task graphs to minimize memory and makespan, Inria, October 2012, no RR-8082, 21 p.

    http://hal.inria.fr/hal-00740105
  • 45Y. Robert, F. Vivien, D. Zaidouni.

    On the complexity of scheduling checkpoints for computational workflows, Inria, March 2012, no RR-7907.

    http://hal.inria.fr/hal-00680386

Other Publications

  • 46E. Agullo, P. R. Amestoy, A. Buttari, A. Guermouche, J.-Y. L'Excellent, F.-H. Rouet.

    Robust memory-aware mappings for parallel multifrontal factorizations, February 2012, Presentation at the 15th SIAM conference on Parallel Processing for Scientific Computing (PP12), Savannah, GA, USA.
  • 47P. R. Amestoy, C. Ashcraft, A. Buttari, J.-Y. L'Excellent, C. Weisbecker.

    Improving Multifrontal methods by means of Low-Rank Approximations techniques, June 2012, Presentation at the 2012 SIAM conference on Applied Linear Algebra, Valencia, Spain.
  • 48P. R. Amestoy, A. Buttari, A. Guermouche, J.-Y. L'Excellent, M. Sid-Lakhdar.

    Exploiting Multithreaded Tree Parallelism for Multicore Systems in a Parallel Multifrontal Solver, February 2012, Presentation at the 15th SIAM conference on Parallel Processing for Scientific Computing (PP12), Savannah, GA, USA.
  • 49B. Uçar.

    Partitioning problems on trees and simple meshes, February 2012, Presentation at 15th SIAM Conference on Parallel Processing for Scientific Computing (PP12), Savannah, Georgia, USA.
References in notes
  • 50S. C. Eisenstat, J. W. H. Liu.

    The theory of elimination trees for sparse unsymmetric matrices, in: SIAM Journal on Matrix Analysis and Applications, 2005, vol. 26, no 3, p. 686–705.
  • 51S. C. Eisenstat, J. W. H. Liu.

    Algorithmic aspects of elimination trees for sparse unsymmetric matrices, in: SIAM Journal on Matrix Analysis and Applications, 2008, vol. 29, no 4, p. 1363–1381.
  • 52K. Ferreira, J. Stearley, J. H. I. Laros, R. Oldfield, K. Pedretti, R. Brightwell, R. Riesen, P. G. Bridges, D. Arnold.

    Evaluating the viability of process replication reliability for exascale systems, in: Proc. 2011 Int. Conf. High Performance Computing, Networking, Storage and Analysis SC '11, ACM Press, 2011.
  • 53K. Kaya, B. Uçar.

    Constructing elimination trees for sparse unsymmetric matrices, Inria, February 2011, no RR-7549.
  • 54J. W. H. Liu.

    An application of generalized tree pebbling to sparse matrix factorization, in: SIAM Journal on Algebraic and Discrete Methods, 1987, vol. 8, no 3, p. 375–395.
  • 55D. Ruiz, B. Uçar.

    A symmetry preserving algorithm for matrix scaling, Inria, 2011, no RR-7552.


previous Previous | up Home