INESC TEC is accepting applications to award 1 Research Grant for Degree holders - Plurianual_25-29 - CRACS (AE2026-0233)

Descrizione

Testo originale dell'annuncio (in inglese)

Portuguese version: https://repositorio.inesctec.pt/editais/pt/AE2026-0233.pdf CALL FOR GRANT APPLICATIONS (AE2026-0233) INESC TEC is now accepting grant applications to award 1 Research Grant (BI) within the scope of the Multiannual Funding of R&D Units 2025-2029, with the reference UID/50014/2025, Funded by national funds through the Portuguese Foundation for Science and Technology (FCT), I.P. 1. GRANT DESCRIPTION Type of grant: Research Grant (BI) General scientific area: COMPUTER SCIENCE Scientific subarea: Programming,Informatics Grant duration: 6 months, starting on 2026-10-01 with the possibility of being renewed for a maximum term of one year, in cases where the grant has been awarded to students who are enrolled in non-award courses, or up to two years, in the cases of students enrolled in a master's degree. Scientific advisor: Ricardo Rocha Workplace: INESC TEC, Porto, Portugal Maintenance stipend: 1090.98, according to the table of monthly maintenance stipend for FCT grants ( https://www.fct.pt/wp-content/uploads/2024/02/Tabela-de-Valores-SMM_atu… ), paid via bank transfer. Grant holders may be awarded potential supplements, according to a quarterly evaluation process (Articles 19, 21 and 22 of the Regulations for Grants of INESC TEC and Annex II), up to a maximum limit of 50 of the monthly maintenance stipend. INESC TEC supports costs with registration, enrolment or tuition fees, during the grant duration, under the terms established in the internal document: "Payment of Tuition fees to grant holders" ( https://www.inesctec.pt/pagamento-propinas-bolseirosEN ) The grant holder will benefit from health insurance, supported by INESC TEC. 2. OBJECTIVES: The main objective of this work is to expand the capabilities of the benchmarking suite, making it more flexible and representative of real-world workloads, by introducing new operation generation patterns and additional features that facilitate the conduct of comprehensive experimental series. Lock-free data structures play a key role in the development of high-performance concurrent applications. Unlike lock-based approaches, lock-free structures ensure system progress even in the presence of contention, reducing problems such as deadlocks, priority inversion, and performance degradation.; However, the development and evaluation of these types of structures are particularly challenging. Their behaviour depends heavily on concurrent access patterns, the mix of operations performed, and the degree of contention between threads. Consequently, a rigorous evaluation requires running a broad set of experimental scenarios to characterise performance under different usage conditions.; There is currently a benchmarking package capable of running parameterised tests, allowing, among other things, the definition of the percentage of insertion and removal operations performed during execution. Although this functionality allows for the exploration of different workloads, the set of supported access patterns is still limited. 3. BRIEF PRESENTATION OF THE WORK PROGRAMME AND TRAINING: To study the main load patterns used in the evaluation of concurrent data structures described in the literature.; Design and implement new workload generators in the existing package.; Add support for non-uniform access distributions, specifically Zipf-type distributions, to model situations in which certain elements are accessed more frequently.; Add new metrics and configuration options that allow for a more detailed characterisation of the behaviour of the tested data structures.; Validate the new features using different lock-free data structures. 4. REQUIRED PROFILE: Admission requirements: Bachelor's Degree in Computer Science. The awarding of the fellowship is dependent on the applicants' enrolment in study cycle or non-award courses of Higher Education Institutions. Preference factors: Knowledge of lock-free data structures, benchmarking, and performance evaluation will be valued. Minimum requ