PhD Position F/M Scalable Translation Validation for High-Performance
- France
- 2 100 €/mois
- CDI
- Temps-plein
- Verifying reductions. Many reduction transformation exist (factorization, semantic tiling, reduction parallelization). How to formalize them in unified way? How to support the composition with loop transformations? How that formalization might be produced by the compiler? Finally, how to check it in a scalable way? The polyhedral model provides a formalization of some of these transformations which enables solver-based checking. A reduction-compliant extension could be investigated.
- Verifying data allocation. The same questions arise for compile-time data allocation required by automatic parallelization (array privatisation, array contraction, struct/array permutation, etc) and will be investigated as well. In particular the framework of linear intra-array allocation and affine inter-array allocation could help to find a relevant formulation.
- Scalability. If possible, a first direct solver approach will be proposed for simple cases. Then, the scalability will be addressed to handle real-life HPC programs. How to parallelize the whole process? How to reduce the overall complexity? A trace-based solution could also be investigated.
- Validation. The approach will be validated on HPC benchmarks.
- Verification algorithms and correctness proofs
- Effective implementation in C++
- Successful benchmarking using Iowa State's compiler
- Subsidized meals
- Partial reimbursement of public transport costs
- Leave: 7 weeks of annual leave + 10 extra days off due to RTT (statutory reduction in working hours) + possibility of exceptional leave (sick children, moving home, etc.)
- Possibility of teleworking (90 days / year) and flexible organization of working hours
- Professional equipment available (videoconferencing, loan of computer equipment, etc.)
- Social, cultural and sports events and activities
- Access to vocational training
- Complementary health insurance under conditions
EURAXESS