CV Lattes
GoogleMyCitations
ORCID
Universidade Estadual Paulista (UNESP). Campus de Rio Claro. Instituto de Geociências e Ciências Exatas (IGCE) (Institutional affiliation for the last research proposal) Birthplace: Brazil
bachelor's at Bacharelado em Ciências da Computação from Universidade Estadual Paulista - Júlio de Mesquita Filho (2002), master's at Computer Science from Universidade Estadual de Campinas (2004) and doctorate at Computer Science from Universidade Estadual de Campinas (2009). Has experience in Computer Science, focusing on Computer Systems Architecture, acting on the following subjects: inteligencia artificial, retargetable tools, platform debugging, agentes inteligentes and filtragem de informacao. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| TITULO |
| Articles published in other media outlets (0 total): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
Multicore machines are ubiquitous nowadays and the tendency is for semiconductor companies to keep adding more and more cores into their new microprocessors. Unfortunately, support for programming these highly parallel machines have not kept pace and we are left with underutilized computer systems. The big challenge facing the industry today is how to ease the life of programmers in writi…
Microarchitectural limitations and high energy dissipation have forced the semiconductor industry to shift from single-core processors to multicores. This new approach allows the transistor growth foresaw by Moore's law to continue but, instead of increasing the clock frequency and exploiting instruction level parallelism, more cores are being integrated into a single die. This shift has …
This scientific initiation project seeks to investigate the available support for developing code in current Persistent Memory systems. The goal is to analyze the abstraction level of the current support for dealing with durable data structures, as well as the respective performance implications. This analysis will further provide hints into new programming abstractions and code optimizat…
This scientific initiation project seeks to characterize the main sources of performanceloss of traditional transactional memory systems when executed on NUMA systems. Theidea for this project is to focus on software implementation of TM (STM) and use a 64-coreAMD machine, which is a large NUMA system, for the study. The goal of the project is to provide information that can be used to de…
This proposal brings five contributions to address code parallelization. First, it proposes a tool to measure the loop-carried probability of each component of a loop and to detect loop-carried patterns in the loop extending the OpenMP check clause. Initial experiments shows that loop-carried probability is an effective metric to decide when to use TLS or BDX to parallelize loops, thus, f…
Assigning threads and memory pages to nodes of a NUMA architecture in a way that matches the demand for remote data transfers with the available communication bandwidths and memory-controller capacity in the machine can have a significant impact in the execution time of programs. Such assignment typically requires dealing with four simultaneous goals: (a) keep threads close to the memory …
Transactional Memory (TM) allows programmers to use the concept of transaction while writing concurrent code. In this context, a transaction may be understood as a block of instructions that is executed atomically and in isolation, that is, each transaction intermediate processing states are not visible to the others. Although initially confined to the academic environment, TM is quickly …
The limited performance gain due to micro-architectural optimizations and the modest increase in clock rate led the microprocessor industry to seek alternatives to single-core processors in order to keep up with the performance demand. The solution found was to build architectures with multiple execution flows (multicore). Nonetheless, the parallel model immediate adoption requires progra…
(Only some records are available in English at this moment)
Recent microprocessors have incorporated transactions into their instruction set architecture (ISA). In this context, a transaction is a block of code that is executed in an all-or-nothing fashion, isolated from other transactions. Using the new ISA, programmers are allowed to delimit the instructions which make a transaction and the hardware is responsible to provide the transactional s…
Assigning threads and memory pages to nodes of a NUMA architecture in a way that matches the demand for remote data transfers with the available communication bandwidths and memory-controller capacity in the machine can have a significant impact in the execution time of programs. Such assignment typically requires dealing with four simultaneous goals: (a) keep threads close to the memory …
| 1 / 1 | Ongoing research grants |
| 2 / 1 | Completed research grants |
| 3 / 3 | Ongoing scholarships in Brazil |
| 9 / 7 | Completed scholarships in Brazil |
| 2 / 2 | Completed scholarships abroad |
| 17 / 14 | All research grants and scholarships |
| Associated processes | |
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
| Publications | 4 |
| Citations | 10 |
| Cit./Article | 2.5 |
| Data from Web of Science | |
BALDASSIN, ALEXANDRO; BORIN, EDSON; ARAUJO, GUIDO. Performance Implications of Dynamic Memory Allocators on Transactional Memory Systems. ACM SIGPLAN NOTICES, v. 50, n. 8, p. 87-96, AUG 2015. Web of Science Citations: 3. (11/19373-6)
NICACIO, DANIEL; BALDASSIN, ALEXANDRO; ARAUJO, GUIDO. Transaction Scheduling Using Dynamic Conflict Avoidance. INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, v. 41, n. 1, p. 89-110, FEB 2013. Web of Science Citations: 5. (11/19373-6)
BALDASSIN, ALEXANDRO; BARRETO, JOAO; CASTRO, DANIEL; ROMANO, PAOLO. Persistent Memory: A Survey of Programming Support and Implementations. ACM COMPUTING SURVEYS, v. 54, n. 7, SEP 2021. Web of Science Citations: 0. (19/10471-7, 18/15519-5)
BALDASSIN, ALEXANDRO; GOLDSTEIN, FELIPE; AZEVEDO, RODOLFO. A transactional runtime system for the Cell/BE architecture. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v. 72, n. 12, p. 1535-1546, DEC 2012. Web of Science Citations: 2. (11/19373-6)
(References retrieved automatically from State of São Paulo Research Institutions)
CARVALHO, João Paulo Labegalini de. PhTM* : uma implementação eficiente de transações em fases. 60 f. Dissertação (Mestrado) - Universidade Estadual Paulista "Júlio de Mesquita Filho" Instituto de Biociências (Campus de Rio Claro). (14/00534-8)
HONORIO, Bruno Chinelato. Melhorando o desempenho de aplicações transacionais através de anotações do programador. 53 f. Dissertação (Mestrado) - Universidade Estadual Paulista "Júlio de Mesquita Filho" Instituto de Biociências, Letras e Ciências Exatas. (16/12103-7)
LEITE, Gustavo. Performance evaluation of code optimizations in FPGA accelerators. 66 f. Dissertação (Mestrado) - Universidade Estadual Paulista "Júlio de Mesquita Filho" Instituto de Biociências, Letras e Ciências Exatas. (17/09065-9)