<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-06-06T17:41:56Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/7956" metadataPrefix="qdc">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/7956</identifier><datestamp>2026-02-03T12:12:36Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37959</setSpec></header><metadata><qdc:qualifieddc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Adaptive Partition Strategies for Loop Parallelism in Heterogeneous Architectures</dc:title>
   <dc:creator>Vilches Reina, Antonio</dc:creator>
   <dc:creator>Asenjo-Plaza, Rafael</dc:creator>
   <dc:creator>Corbera-Peña, Francisco Javier</dc:creator>
   <dc:creator>González-Navarro, María Ángeles</dc:creator>
   <dc:subject>Computación heterogénea</dc:subject>
   <dc:subject>Procesos en paralelo (Informática)</dc:subject>
   <dcterms:abstract>This paper explores the possibility of efficiently using multicores&#xd;
in conjunction with multiple GPU accelerators under a parallel task&#xd;
programming paradigm. In particular, we address the challenge of&#xd;
extending a parallel_for template to allow its&#xd;
exploitation on heterogeneous systems. The extension is based on a&#xd;
two-stages pipeline engine which is responsible for partitioning and&#xd;
scheduling the chunks into the computational resources. Under this&#xd;
engine, we propose a dynamic scheduling strategy coupled with an&#xd;
adaptive partitioning heuristic that resizes chunks to prevent&#xd;
underutilization and load unbalance of CPUs and GPUs. In this paper&#xd;
we introduce the adaptive&#xd;
partitioning heuristic which is derived from an analytical model that&#xd;
minimizes the load unbalance while maximizes the throughput in the&#xd;
system. Using two benchmarks we evaluate the&#xd;
overhead introduced by our template extensions finding that it is&#xd;
negligible. We also evaluate the efficiency of our adaptive&#xd;
partitioning strategies and compared them with related work.</dcterms:abstract>
   <dcterms:dateAccepted>2014-07-30T10:55:31Z</dcterms:dateAccepted>
   <dcterms:available>2014-07-30T10:55:31Z</dcterms:available>
   <dcterms:created>2014-07-30T10:55:31Z</dcterms:created>
   <dcterms:issued>2014-07-30</dcterms:issued>
   <dc:type>conference output</dc:type>
   <dc:identifier>http://hdl.handle.net/10630/7956</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>Intl. Conf. on High Performance Computing and Simulation</dc:relation>
   <dc:relation>Bolonia, Italia</dc:relation>
   <dc:relation>21/07/2014</dc:relation>
   <dc:rights>open access</dc:rights>
</qdc:qualifieddc>
</metadata></record></GetRecord></OAI-PMH>