2026-04-21T18:52:30Zhttps://uvadoc.uva.es/oai/request

oai:uvadoc.uva.es:10324/710922024-10-30T20:01:42Zcom_10324_1165com_10324_931com_10324_894col_10324_1335

00925njm 22002777a 4500 dc Estébanez, Álvaro author González Escribano, Arturo author Llanos Ferraris, Diego Rafael author 2013 Speculative parallelization is a technique that tries to extract parallelism of loops that can not be parallelized at compile time. The underlying idea is to optimistically execute the code in parallel, while a subsystem checks that sequential semantics have not been violated. There exist many proposals in this field, however, to the best of our knowledge, there are not any solution that allows to effectively parallelize those applications that use pointer arithmetic. In a previous work, the authors of this paper presented a software library that allow the parallelization of this kind of applications. Nevertheless, the software developed had an important limitation: Execution time of the parallelized versions was higher than the sequential one. In this work, this limitation has been addressed, finding and solving the reasons of this lack of efficiency. Experimental results obtained allow us to affirm that these limitations have been overcome. Annals of Multicore and GPU Programming, 1(1), 2013 2341-3158 https://uvadoc.uva.es/handle/10324/71092 10.5281/zenodo.14011631 1 1 10 Annals of Multicore and GPU Programming 1 Informática Improving the performance of a thread-level speculation library