How to Efficiently Parallelize Irregular DOACROSS Loops Using Fine Granularity and OpenMP Tasks: The SPEC mcf Case

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.contributorUniversidade Estadual Paulista (UNESP)-
Autor(es): dc.creatorSalamanca, Juan-
Autor(es): dc.creatorBaldassin, Alexandro-
Data de aceite: dc.date.accessioned2025-08-21T21:57:10Z-
Data de disponibilização: dc.date.available2025-08-21T21:57:10Z-
Data de envio: dc.date.issued2025-04-29-
Data de envio: dc.date.issued2022-12-31-
Fonte completa do material: dc.identifierhttp://dx.doi.org/10.1007/978-3-031-40744-4_6-
Fonte completa do material: dc.identifierhttps://hdl.handle.net/11449/297614-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/11449/297614-
Descrição: dc.descriptionThere are certain loops that are considered hard to parallelize. Examples of this type of loops are those that have loop-carried dependencies (DOACROSS loops) and that are also irregular, that is, the dependencies between iterations vary depending on the context. Many techniques have been studied before to be able to parallelize this type of loops, however in OpenMP standard there is no efficient way to parallelize them. From the literature, it is known that many of these loops can be efficiently parallelized using fine-grained techniques (identifying strongly connected components). On the other hand, the most efficient way to parallelize this type of loops using OpenMP tasks has not been explored. Thus, this paper discusses the various forms of parallelization of this type of loops using SPEC 429.mcf as a case study; particularly, how to parallelize mcf using fine granularity in tasks. For that, this paper proposes new constructs (ste_for and ste) and speculative dependency-types (spec_in, spec_out, and spec_inout). An initial evaluation using different implementations to parallelize the mcf hottest loop shows that it is possible to achieve speed-ups of up to 2.44 × with respect to the task-depend version using Speculative Task Execution.-
Descrição: dc.descriptionDEMAC/IGCE – Sao Paulo State University (Unesp), SP-
Descrição: dc.descriptionDEMAC/IGCE – Sao Paulo State University (Unesp), SP-
Formato: dc.format81-96-
Idioma: dc.languageen-
Relação: dc.relationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)-
???dc.source???: dc.sourceScopus-
Palavras-chave: dc.subjectDOACROSS Parallelization-
Palavras-chave: dc.subjectOpenMP-
Palavras-chave: dc.subjectSpeculative Tasks-
Título: dc.titleHow to Efficiently Parallelize Irregular DOACROSS Loops Using Fine Granularity and OpenMP Tasks: The SPEC mcf Case-
Tipo de arquivo: dc.typeaula digital-
Aparece nas coleções:Repositório Institucional - Unesp

Não existem arquivos associados a este item.