Team, Visitors, External Collaborators
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


Bibliography

Major publications by the team in recent years
  • 1P. Clauss, E. Altıntas, M. Kuhn.
    Automatic Collapsing of Non-Rectangular Loops, in: Parallel and Distributed Processing Symposium (IPDPS), 2017, Orlando, United States, IEEE International, May 2017, pp. 778 - 787. [ DOI : 10.1109/IPDPS.2017.34 ]
    https://hal.inria.fr/hal-01581081
  • 2P.-N. Clauss, J. Gustedt.
    Iterative Computations with Ordered Read-Write Locks, in: Journal of Parallel and Distributed Computing, 2010, vol. 70, no 5, pp. 496–504. [ DOI : 10.1016/j.jpdc.2009.09.002 ]
    https://hal.inria.fr/inria-00330024
  • 3A. Ketterlin, P. Clauss.
    Prediction and trace compression of data access addresses through nested loop recognition, in: 6th annual IEEE/ACM international symposium on Code generation and optimization, Boston, USA, ACM, April 2008, pp. 94-103.
    http://dx.doi.org/10.1145/1356058.1356071
  • 4A. Ketterlin, P. Clauss.
    Profiling Data-Dependence to Assist Parallelization: Framework, Scope, and Optimization, in: MICRO-45, The 45th Annual IEEE/ACM International Symposium on Microarchitecture, Vancouver, Canada, December 2012.
    https://hal.inria.fr/hal-00780782
  • 5J. M. Martinez Caamano, M. Selva, P. Clauss, A. Baloian, W. Wolff.
    Full runtime polyhedral optimizing loop transformations with the generation, instantiation, and scheduling of code-bones, in: Concurrency and Computation: Practice and Experience, June 2017, vol. 29, no 15. [ DOI : 10.1002/cpe.4192 ]
    https://hal.inria.fr/hal-01581093
  • 6A. Sukumaran-Rajam, P. Clauss.
    The Polyhedral Model of Nonlinear Loops, in: ACM Transactions on Architecture and Code Optimization, January 2016, vol. 12, no 4. [ DOI : 10.1145/2838734 ]
    https://hal.inria.fr/hal-01244464
Publications of the year

Doctoral Dissertations and Habilitation Theses

Articles in International Peer-Reviewed Journals

  • 9B. Bramas.
    Impact study of data locality on task-based applications through the Heteroprio scheduler, in: PeerJ Computer Science, May 2019. [ DOI : 10.7717/peerj-cs.190 ]
    https://hal.inria.fr/hal-02120736
  • 10B. Bramas.
    Increasing the degree of parallelism using speculative execution in task-based runtime systems, in: PeerJ Computer Science, 2019, vol. 5, e183 p. [ DOI : 10.7717/peerj-cs.183 ]
    https://hal.inria.fr/hal-02070576
  • 11B. Bramas, A. Ketterlin.
    Improving parallel executions by increasing task granularity in task-based runtime systems using acyclic DAG clustering, in: PeerJ Computer Science, January 2020. [ DOI : 10.7717/peerj-cs.247 ]
    https://hal.inria.fr/hal-02436826
  • 12A. Charguéraud, F. Pottier.
    Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits, in: Journal of Automated Reasoning, March 2019, vol. 62, no 3, pp. 331–365. [ DOI : 10.1007/s10817-017-9431-7 ]
    https://hal.inria.fr/hal-01652785

Invited Conferences

  • 13B. Bramas.
    SPETABARU: A Task-based Runtime System with Speculative Execution Capability, in: SIAM CSE 2019 - SIAM Conference on Computational Science and Engineering, Spokane, United States, February 2019.
    https://hal.inria.fr/hal-02050190

International Conferences with Proceedings

  • 14U. A. Acar, V. Aksenov, A. Charguéraud, M. Rainey.
    Provably and Practically Efficient Granularity Control, in: PPoPP 2019 - Principles and Practice of Parallel Programming, Washington DC, United States, February 2019. [ DOI : 10.1145/3293883.3295725 ]
    https://hal.inria.fr/hal-01973285
  • 15A. Charguéraud, J.-C. Filliâtre, C. Lourenço, M. Pereira.
    GOSPEL -Providing OCaml with a Formal Specification Language, in: FM 2019 - 23rd International Symposium on Formal Methods, Porto, Portugal, October 2019.
    https://hal.inria.fr/hal-02157484
  • 16J. Gustedt, M. Mogé.
    Memory access classification for vertical task parallelism, in: PDP 2019 - 27th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, Pavia, Italy, IEEE, February 2019.
    https://hal.inria.fr/hal-02046105
  • 17A. Guéneau, J.-H. Jourdan, A. Charguéraud, F. Pottier.
    Formal Proof and Analysis of an Incremental Cycle Detection Algorithm : (extended version), in: Interactive Theorem Proving, Portland, United States, J. Harrison, J. O'Leary, A. Tolmach (editors), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, September 2019, no 141.
    https://hal.inria.fr/hal-02167236
  • 18M. Schmitt, P. Helluy, C. Bastoul.
    Automatic adaptive approximation for stencil computations, in: CC 2019 - 28th International Conference on Compiler Construction, Washington, United States, ACM Press, February 2019, pp. 170-181. [ DOI : 10.1145/3302516.3307348 ]
    https://hal.inria.fr/hal-02072737

Conferences without Proceedings

  • 19P. Godard.
    Échanges non bloquants de données ordonnées entre producteurs multiples et consommateur unique, in: COMPAS'2019, Anglet, France, June 2019.
    https://hal.archives-ouvertes.fr/hal-02381769
  • 20P. Godard, V. Loechner, C. Bastoul, F. Soulier, G. Muller.
    A Flexible and Distributed Runtime System for High-Throughput Constrained Data Streams Generation, in: IPDPSW 2019 - IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, Rio de Janeiro, Brazil, IEEE, May 2019, pp. 718-728. [ DOI : 10.1109/IPDPSW.2019.00120 ]
    https://hal.archives-ouvertes.fr/hal-02381750
  • 21S. Hariri, S. Weill, J. Gustedt, I. Charpentier.
    Pairing GIS and distributed hydrological models using Matlab 2, in: CAJG - 2nd Conference of the Arabian Journal of Geosiences, Sousse, Tunisia, November 2019.
    https://hal.archives-ouvertes.fr/hal-02333260
  • 22S. Kobeissi, P. Clauss.
    The Polyhedral Model Beyond Loops Recursion Optimization and Parallelization Through Polyhedral Modeling, in: IMPACT 2019 - 9th International Workshop on Polyhedral Compilation Techniques, In conjunction with HiPEAC 2019, Valencia, Spain, January 2019.
    https://hal.inria.fr/hal-02059558
  • 23B. Meister, P. Clauss.
    Uniform Random Sampling in Polyhedra, in: 10th International Workshop on Polyhedral Compilation Techniques, Bologna, Italy, January 2020.
    https://hal.inria.fr/hal-02425752

Scientific Books (or Scientific Book chapters)

Internal Reports

Other Publications

References in notes
  • 51JTC1/SC22/WG14 (editor)
    Programming languages - C, ISO, 2018, no ISO/IEC 9899.
  • 52U. A. Acar, A. Charguéraud, M. Rainey.
    Oracle-Guided Scheduling for Controlling Granularity in Implicitly Parallel Languages, in: Journal of Functional Programming, November 2016, vol. 26. [ DOI : 10.1017/S0956796816000101 ]
    https://hal.inria.fr/hal-01409069
  • 53C. Bastoul.
    Code Generation in the Polyhedral Model Is Easier Than You Think, in: PACT'13 IEEE International Conference on Parallel Architecture and Compilation Techniques, Juan-les-Pins, France, 2004, pp. 7–16.
    https://hal.archives-ouvertes.fr/ccsd-00017260
  • 54B. Bramas, M. Hassan, B. Stamm.
    An Integral Equation Formulation of the N-body Dielectric Spheres Problem. Part II: Complexity Analysis, 2019.
  • 55A. Guéneau, A. Charguéraud, F. Pottier.
    A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification, in: ESOP 2018 - 27th European Symposium on Programming, Thessaloniki, Greece, A. Ahmed (editor), LNCS - Lecture Notes in Computer Science, Springer, April 2018, vol. 10801, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018. [ DOI : 10.1007/978-3-319-89884-1_19 ]
    https://hal.inria.fr/hal-01926485
  • 56M. Hall, D. Padua, K. Pingali.
    Compiler research: the next 50 years, in: Commun. ACM, 2009, vol. 52, no 2, pp. 60–67.
    http://doi.acm.org/10.1145/1461928.1461946
  • 57A. Hobor, A. W. Appel, F. Z. Nardelli.
    Oracle Semantics for Concurrent Separation Logic, in: ESOP, 2008, pp. 353-367.