Bibliography
Major publications by the team in recent years
-
1J. C. Beyler, P. Clauss.
Performance driven data cache prefetching in a dynamic software optimization system, in: ICS '07: Proceedings of the 21st annual international conference on Supercomputing, New York, NY, USA, ACM, 2007, pp. 202–209.
http://doi.acm.org/10.1145/1274971.1275000 -
2J. C. Beyler, M. Klemm, P. Clauss, M. Philippsen.
A meta-predictor framework for prefetching in object-based DSMs, in: Concurr. Comput. : Pract. Exper., September 2009, vol. 21, pp. 1789–1803. -
3P. Clauss, F. J. Fernández, D. Garbervetsky, S. Verdoolaege.
Symbolic polynomial maximization over convex sets and its application to memory requirement estimation, in: IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Aug 2009, vol. 17, no 8, pp. 983-996. -
4A. 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 -
5A. Ketterlin, P. Clauss.
Profiling Data-Dependence to Assist Parallelization: Framework, Scope, and Optimization, in: MICRO-45 – Proceedings of the 2012 IEEE/ACM 45th International Symposium on Microarchitecture, Vancouver, Canada, December 2012. -
6B. Pradelle, A. Ketterlin, P. Clauss.
Polyhedral parallelization of binary code, in: ACM Transactions on Architecture and Code Optimization, January 2012, vol. 8, no 4, pp. 39:1–39:21. [ DOI : 10.1145/2086696.2086718 ]
http://hal.inria.fr/hal-00664370 -
7R. Seghir, V. Loechner, B. Meister.
Integer Affine Transformations of Parametric Z-polytopes and Applications to Loop Nest Optimization, in: ACM Transactions on Architecture and Code Optimization, June 2012, vol. 9, no 2, pp. 8.1-8.27. [ DOI : 10.1145/2207222.2207224 ]
http://hal.inria.fr/inria-00582388 -
8S. Verdoolaege, R. Seghir, K. Beyls, V. Loechner, M. Bruynooghe.
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions, in: Algorithmica, 2007, vol. 48, no 1, pp. 37–66.
http://dx.doi.org/10.1007/s00453-006-1231-0
Articles in International Peer-Reviewed Journals
-
9A. Jimborean, P. Clauss, J.-F. Dollinger, V. Loechner, M. Juan Manuel.
Dynamic and Speculative Polyhedral Parallelization Using Compiler-Generated Skeletons, in: International Journal of Parallel Programming, August 2014, vol. 42, no 4, pp. 529-545.
https://hal.inria.fr/hal-01003744 -
10A. Ketterlin, P. Clauss.
Recovering memory access patterns of executable programs, in: Science of Computer Programming, February 2014, vol. 80, pp. 440-456. [ DOI : 10.1016/j.scico.2012.08.002 ]
https://hal.inria.fr/hal-00909961
International Conferences with Proceedings
-
11L. Bagnères, C. Bastoul.
Switchable Scheduling for Runtime Adaptation of Optimization, in: Euro-Par 2014 Parallel Processing, Porto, Portugal, Lecture Notes in Computer Science, Springer International Publishing, August 2014, vol. 8632, pp. 222 - 233. [ DOI : 10.1007/978-3-319-09873-9_19 ]
https://hal.inria.fr/hal-01097200 -
12P. Clauss.
Author Retrospective for Counting Solutions to Linear and Nonlinear Constraints Through Ehrhart Polynomials: Applications to Analyze and Transform Scientific Programs, in: ICS, International Conference on Supercomputing, New York, United States, ACM ICS 25th Anniversary Volume, ACM, 2014. [ DOI : 10.1145/2591635.2591654 ]
https://hal.inria.fr/hal-01100296 -
13P. Clauss.
Counting Solutions to Linear and Nonlinear Constraints Through Ehrhart Polynomials: Applications to Analyze and Transform Scientific Programs, in: ICS, International Conference on Supercomputing, Munich, Germany, ACM ICS 25th Anniversary Volume, 2014. [ DOI : 10.1145/2591635.2667172 ]
https://hal.inria.fr/hal-01100306 -
14P. Clauss.
Mind The Gap! A study of some pitfalls preventing peak performance in polyhedral compilation using a polyhedral antidote, in: IMPACT - Fifth International Workshop on Polyhedral Compilation Techniques, In conjunction with HiPEAC, Amsterdam, Netherlands, January 2015.
https://hal.inria.fr/hal-01099583 -
15P. Clauss, I. Fassi, A. Jimborean.
Software-controlled Processor Stalls for Time and Energy Efficient Data Locality Optimization, in: International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation - SAMOS XIV, Agios Konstantinos, Greece, July 2014.
https://hal.inria.fr/hal-01003228 -
16P. Feautrier, E. Violard, A. Ketterlin.
Improving X10 Program Performances by Clock Removal, in: CC'14 - 23rd International Conference on Compiler Construction, part of ETAPS'14, Grenoble, France, April 2014.
https://hal.inria.fr/hal-00924206 -
17B. Narasimha Swamy, A. Ketterlin, A. Seznec.
Hardware/Software Helper Thread Prefetching On Heterogeneous Many Cores, in: 2014 IEEE 26th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), Paris, France, October 2014. [ DOI : 10.1109/SBAC-PAD.2014.39 ]
https://hal.inria.fr/hal-01087752 -
18E. Riou, E. Rohou, P. Clauss, N. Hallou, A. Ketterlin.
PADRONE: a Platform for Online Profiling, Analysis, and Optimization, in: DCE 2014 - International workshop on Dynamic Compilation Everywhere, Vienne, Austria, January 2014.
https://hal.inria.fr/hal-00917950 -
19S. Stojanovic, J. Narboux, M. Bezem, P. Janicic.
A Vernacular for Coherent Logic, in: CICM 2014 - Conferences on Intelligent Computer Mathematics, Coimbra, Portugal, Lecture Notes in Computer Science, Springer, July 2014, vol. 8543.
https://hal.inria.fr/hal-00983975 -
20A. Sukumaran-Rajam, J. M. Martinez, W. Wolff, A. Jimborean, P. Clauss.
Speculative Program Parallelization with Scalable and Decentralized Runtime Verification, in: Runtime Verification, Toronto, Canada, B. Bonakdarpour, S. A. Smolka (editors), Springer, September 2014, vol. 8734, pp. 124-139. [ DOI : 10.1007/978-3-319-11164-3_11 ]
https://hal.inria.fr/hal-01070610 -
21O. Zinenko, C. Bastoul, S. Huot.
Manipulating Visualization, Not Codes, in: International Workshop on Polyhedral Compilation Techniques (IMPACT), Amsterdam, Netherlands, January 2015, 8 p.
https://hal.inria.fr/hal-01100974 -
22O. Zinenko, S. Huot, C. Bastoul.
Clint: A Direct Manipulation Tool for Parallelizing Compute-Intensive Program Parts, in: IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC), Melbourne, Australia, IEEE, July 2014.
https://hal.inria.fr/hal-01055788
Conferences without Proceedings
-
23P. Boutry, J. Narboux, P. Schreck, G. Braun.
A short note about case distinctions in Tarski's geometry, in: Automated Deduction in Geometry 2014, Coimbra, Portugal, F. Botana, P. Quaresma (editors), Proceedings of ADG 2014, July 2014, pp. 1-15.
https://hal.inria.fr/hal-00989785 -
24P. Boutry, J. Narboux, P. Schreck, G. Braun.
Using small scale automation to improve both accessibility and readability of formal proofs in geometry, in: Automated Deduction in Geometry 2014, Coimbra, Portugal, F. Botana, P. Quaresma (editors), Proceedings of ADG 2014, July 2014, pp. 1-19.
https://hal.inria.fr/hal-00989781 -
25J.-F. Dollinger, V. Loechner.
CPU+GPU Load Balance Guided by Execution Time Prediction, in: Fifth International Workshop on Polyhedral Compilation Techniques (IMPACT 2015), Amsterdam, Netherlands, January 2015.
https://hal.inria.fr/hal-01095890
Internal Reports
-
26A. Ketterlin, M. Kuhn, S. Genaud, P. Clauss.
Loop-based Modeling of Parallel Communication Traces, July 2014, no RR-8562, 10 p.
https://hal.inria.fr/hal-01044636
-
27C. 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 -
28M. 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 -
29A. Hobor, A. W. Appel, F. Z. Nardelli.
Oracle Semantics for Concurrent Separation Logic, in: ESOP, 2008, pp. 353-367. -
30A. Jimborean.
Adapting the polytope model for dynamic and speculative parallelization, Université de Strasbourg, September 2012.
http://tel.archives-ouvertes.fr/tel-00733850