RT info:eu-repo/semantics/conferenceObject
T1 New Data Structures to Handle Speculative Parallelization at Runtime
A1 Estébanez, Álvaro
A1 Llanos Ferraris, Diego Rafael
A1 González Escribano, Arturo
K1 Informática
K1 Thread-level speculation
K1 speculative parallelism
K1 memory improvements
K1 1203 Ciencia de Los Ordenadores
K1 3304 Tecnología de Los Ordenadores
AB Software-based, thread-level speculation (TLS) is a software technique that optimistically executes in parallel loops whose fully-parallel semantics can not be guaranteed at compile time. Modern TLS libraries allow to handle arbitrary data structures speculatively. This desired feature comes at the high cost of local store and/or remote recovery times: The easier the local store, the harder the remote recovery. Unfortunately, both times are on the critical path of any TLS system. In this paper we propose a solution that performs local store in constant time, while recover values in a time that is in the order of T , being T the number of threads. As we will see, this solution , together with some additional improvements, makes the difference between slowdowns and noticeable speedups in the speculative parallelization of non-synthetic, pointer-based applications on a real system. Our experimental results show a gain of 3.58× to 28× with respect to the baseline system, and a relative efficiency of up to, on average, 65% with respect to a TLS implementation specifically tailored to the benchmarks used.
YR 2014
FD 2014
LK https://uvadoc.uva.es/handle/10324/70518
UL https://uvadoc.uva.es/handle/10324/70518
LA eng
NO 7th International Symposium on High-Level Parallel Programming and Applications (HLPP 2014) Amsterdam, Netherlands July 3-4, 2014
NO Producción Científica
DS UVaDOC
RD 19-ene-2025