Implementações paralelas para os problemas do fecho transitivo e caminho mínimo APSP na GPU
Autor(a) principal: | |
---|---|
Data de Publicação: | 2014 |
Tipo de documento: | Dissertação |
Idioma: | por |
Título da fonte: | Repositório Institucional da UFG |
Texto Completo: | http://repositorio.bc.ufg.br/tede/handle/tede/3471 |
Resumo: | This paper presents a Graphics Processing Unit (GPU) based parallels implementations for the All Pairs Shortest Paths and Transitive Closure problems in graph. The implementations are based on the main sequential algorithms and takes full advantage of the highly multithreaded architecture of current manycore GPUs. Our solutions reduces the communication between CPU and GPU, improves the Streaming Multiprocessors (SMs) utilization, and makes intensive use of coalesced memory access to optimize graph data access. The advantages of the proposed implementations are demonstrated for several graphs randomly generated using the widely known graph library GTgraph. Graphs containing thousands of vertices and different edges densities, varying from sparse to complete graphs, were generated and used in the experiments. Our results confirm that GPU implementations can be competitive even for graph algorithms whose memory accesses and work distribution are both irregular and data-dependent. Keywords |
id |
UFG-2_8d3da3d7112253c82f806fe788b37700 |
---|---|
oai_identifier_str |
oai:repositorio.bc.ufg.br:tede/3471 |
network_acronym_str |
UFG-2 |
network_name_str |
Repositório Institucional da UFG |
repository_id_str |
|
spelling |
Martins, Wellington Santoshttp://lattes.cnpq.br/3041686206689904Martins, Wellington SantosNascimento, Hugo Alexandre DantasCárceres, Edson Norbertohttp://lattes.cnpq.br/3536210071193629Gaioso, Roussian Di Ramos Alves2014-10-30T14:29:29Z2014-08-08GAIOSO, Roussian Di Ramos Alves. Implementações paralelas para os problemas do fecho transitivo e caminho mínimo APSP na GPU. 2014. 118 f. Dissertação (Mestrado em Ciência da Computação) - Universidade Federal de Goiás, Goiânia, 2014.http://repositorio.bc.ufg.br/tede/handle/tede/3471This paper presents a Graphics Processing Unit (GPU) based parallels implementations for the All Pairs Shortest Paths and Transitive Closure problems in graph. The implementations are based on the main sequential algorithms and takes full advantage of the highly multithreaded architecture of current manycore GPUs. Our solutions reduces the communication between CPU and GPU, improves the Streaming Multiprocessors (SMs) utilization, and makes intensive use of coalesced memory access to optimize graph data access. The advantages of the proposed implementations are demonstrated for several graphs randomly generated using the widely known graph library GTgraph. Graphs containing thousands of vertices and different edges densities, varying from sparse to complete graphs, were generated and used in the experiments. Our results confirm that GPU implementations can be competitive even for graph algorithms whose memory accesses and work distribution are both irregular and data-dependent. KeywordsEste trabalho apresenta implementações paralelas baseadas em Graphics Processing Unit (GPU) para os problemas da identificação dos caminhos mínimos entre todos os pares de vértices e do fecho transitivo em um grafo. As implementações são baseadas nos principais algoritmos sequenciais e tiram o máximo proveito da arquitetura multithreaded das GPUs atuais. Nossa solução reduz a comunicação entre a Central Processing Unit (CPU) e a GPU, melhora a utilização dos Streaming Multiprocessors (SMs) e faz um uso intensivo de acesso aglutinado em memória para otimizar o acesso de dados do grafo. As vantagens dessas implementações propostas são demonstradas por vários grafos gerados aleatoriamente utilizando a ferramenta GTgraph. Grafos contendo milhares de vértices foram gerados e utilizados nos experimentos. Nossos resultados confirmam que implementações baseadas em GPU podem ser viáveis mesmo para algoritmos de grafos cujo acessos à memória e distribuição de trabalho são irregulares e causam dependência de dados.Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2014-10-30T14:24:27Z No. of bitstreams: 2 Dissertação - Roussian Di Ramos Alves Gaioso - 2014.pdf: 6127790 bytes, checksum: 9990f791c0f9abaee7e3e03e4cdc8ee4 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2014-10-30T14:29:29Z (GMT) No. of bitstreams: 2 Dissertação - Roussian Di Ramos Alves Gaioso - 2014.pdf: 6127790 bytes, checksum: 9990f791c0f9abaee7e3e03e4cdc8ee4 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)Made available in DSpace on 2014-10-30T14:29:29Z (GMT). No. of bitstreams: 2 Dissertação - Roussian Di Ramos Alves Gaioso - 2014.pdf: 6127790 bytes, checksum: 9990f791c0f9abaee7e3e03e4cdc8ee4 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2014-08-08Conselho Nacional de Pesquisa e Desenvolvimento Científico e Tecnológico - CNPqapplication/pdfhttp://repositorio.bc.ufg.br/tede/retrieve/11246/Disserta%c3%a7%c3%a3o%20-%20Roussian%20Di%20Ramos%20Alves%20Gaioso%20-%202014.pdf.jpgporUniversidade Federal de GoiásPrograma de Pós-graduação em Ciência da Computação (INF)UFGBrasilInstituto de Informática - INF (RG)http://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/openAccessGPUGPGPUCUDATeoria dos GrafosFecho transitivoAPSPCaminho mínimoBFSWarshallDijkstraFloydWarshallParalelismoGPUGPGPUCUDAGraph TheoryTransitive closureAPSPWarshallBFSWarshallFloydWarshallDijkstraParallelMinimum PathParallelismCIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAOImplementações paralelas para os problemas do fecho transitivo e caminho mínimo APSP na GPUParallel implementations for transitive closure and minimum path APSP problems in GPUinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesis-3303550325223384799600600600600-77122667346336447683671711205811204509-2555911436985713659reponame:Repositório Institucional da UFGinstname:Universidade Federal de Goiás (UFG)instacron:UFGLICENSElicense.txtlicense.txttext/plain; charset=utf-82165http://repositorio.bc.ufg.br/tede/bitstreams/68e88cf9-a3d8-49e8-a484-d3a166a5a928/downloadbd3efa91386c1718a7f26a329fdcb468MD51CC-LICENSElicense_urllicense_urltext/plain; charset=utf-849http://repositorio.bc.ufg.br/tede/bitstreams/f072ba61-5ded-4289-b9fe-890f70542d1e/download4afdbb8c545fd630ea7db775da747b2fMD52license_textlicense_texttext/html; charset=utf-822302http://repositorio.bc.ufg.br/tede/bitstreams/1281632c-5516-4315-95a6-34e4ab18b6e5/download1e0094e9d8adcf16b18effef4ce7ed83MD53license_rdflicense_rdfapplication/rdf+xml; charset=utf-823148http://repositorio.bc.ufg.br/tede/bitstreams/9757f53c-5c66-46f1-8075-3d89342fed73/download9da0b6dfac957114c6a7714714b86306MD54ORIGINALDissertação - Roussian Di Ramos Alves Gaioso - 2014.pdfDissertação - Roussian Di Ramos Alves Gaioso - 2014.pdfapplication/pdf6127790http://repositorio.bc.ufg.br/tede/bitstreams/864a7e01-e3ad-4377-bc3a-eec122e6f09b/download9990f791c0f9abaee7e3e03e4cdc8ee4MD55TEXTDissertação - Roussian Di Ramos Alves Gaioso - 2014.pdf.txtDissertação - Roussian Di Ramos Alves Gaioso - 2014.pdf.txtExtracted Texttext/plain206162http://repositorio.bc.ufg.br/tede/bitstreams/8952a2b4-a8bb-46af-aad6-ce68a8fb90ac/downloade8146fcea2cf860588a03d87db050479MD56THUMBNAILDissertação - Roussian Di Ramos Alves Gaioso - 2014.pdf.jpgDissertação - Roussian Di Ramos Alves Gaioso - 2014.pdf.jpgGenerated Thumbnailimage/jpeg3410http://repositorio.bc.ufg.br/tede/bitstreams/afb6924f-6870-4fcd-a801-e8c9475e7545/downloadf0359a8288c58104e9050e3c794ad3acMD57tede/34712014-10-31 03:02:19.349http://creativecommons.org/licenses/by-nc-nd/4.0/Acesso Abertoopen.accessoai:repositorio.bc.ufg.br:tede/3471http://repositorio.bc.ufg.br/tedeRepositório InstitucionalPUBhttp://repositorio.bc.ufg.br/oai/requesttasesdissertacoes.bc@ufg.bropendoar:2014-10-31T05:02:19Repositório Institucional da UFG - Universidade Federal de Goiás (UFG)falseTk9UQTogQ09MT1FVRSBBUVVJIEEgU1VBIFBSw5NQUklBIExJQ0VOw4dBCkVzdGEgbGljZW7Dp2EgZGUgZXhlbXBsbyDDqSBmb3JuZWNpZGEgYXBlbmFzIHBhcmEgZmlucyBpbmZvcm1hdGl2b3MuCgpMSUNFTsOHQSBERSBESVNUUklCVUnDh8ODTyBOw4NPLUVYQ0xVU0lWQQoKQ29tIGEgYXByZXNlbnRhw6fDo28gZGVzdGEgbGljZW7Dp2EsIHZvY8OqIChvIGF1dG9yIChlcykgb3UgbyB0aXR1bGFyIGRvcyBkaXJlaXRvcyBkZSBhdXRvcikgY29uY2VkZSDDoCBVbml2ZXJzaWRhZGUgClhYWCAoU2lnbGEgZGEgVW5pdmVyc2lkYWRlKSBvIGRpcmVpdG8gbsOjby1leGNsdXNpdm8gZGUgcmVwcm9kdXppciwgIHRyYWR1emlyIChjb25mb3JtZSBkZWZpbmlkbyBhYmFpeG8pLCBlL291IApkaXN0cmlidWlyIGEgc3VhIHRlc2Ugb3UgZGlzc2VydGHDp8OjbyAoaW5jbHVpbmRvIG8gcmVzdW1vKSBwb3IgdG9kbyBvIG11bmRvIG5vIGZvcm1hdG8gaW1wcmVzc28gZSBlbGV0csO0bmljbyBlIAplbSBxdWFscXVlciBtZWlvLCBpbmNsdWluZG8gb3MgZm9ybWF0b3Mgw6F1ZGlvIG91IHbDrWRlby4KClZvY8OqIGNvbmNvcmRhIHF1ZSBhIFNpZ2xhIGRlIFVuaXZlcnNpZGFkZSBwb2RlLCBzZW0gYWx0ZXJhciBvIGNvbnRlw7pkbywgdHJhbnNwb3IgYSBzdWEgdGVzZSBvdSBkaXNzZXJ0YcOnw6NvIApwYXJhIHF1YWxxdWVyIG1laW8gb3UgZm9ybWF0byBwYXJhIGZpbnMgZGUgcHJlc2VydmHDp8Ojby4KClZvY8OqIHRhbWLDqW0gY29uY29yZGEgcXVlIGEgU2lnbGEgZGUgVW5pdmVyc2lkYWRlIHBvZGUgbWFudGVyIG1haXMgZGUgdW1hIGPDs3BpYSBhIHN1YSB0ZXNlIG91IApkaXNzZXJ0YcOnw6NvIHBhcmEgZmlucyBkZSBzZWd1cmFuw6dhLCBiYWNrLXVwIGUgcHJlc2VydmHDp8Ojby4KClZvY8OqIGRlY2xhcmEgcXVlIGEgc3VhIHRlc2Ugb3UgZGlzc2VydGHDp8OjbyDDqSBvcmlnaW5hbCBlIHF1ZSB2b2PDqiB0ZW0gbyBwb2RlciBkZSBjb25jZWRlciBvcyBkaXJlaXRvcyBjb250aWRvcyAKbmVzdGEgbGljZW7Dp2EuIFZvY8OqIHRhbWLDqW0gZGVjbGFyYSBxdWUgbyBkZXDDs3NpdG8gZGEgc3VhIHRlc2Ugb3UgZGlzc2VydGHDp8OjbyBuw6NvLCBxdWUgc2VqYSBkZSBzZXUgCmNvbmhlY2ltZW50bywgaW5mcmluZ2UgZGlyZWl0b3MgYXV0b3JhaXMgZGUgbmluZ3XDqW0uCgpDYXNvIGEgc3VhIHRlc2Ugb3UgZGlzc2VydGHDp8OjbyBjb250ZW5oYSBtYXRlcmlhbCBxdWUgdm9jw6ogbsOjbyBwb3NzdWkgYSB0aXR1bGFyaWRhZGUgZG9zIGRpcmVpdG9zIGF1dG9yYWlzLCB2b2PDqiAKZGVjbGFyYSBxdWUgb2J0ZXZlIGEgcGVybWlzc8OjbyBpcnJlc3RyaXRhIGRvIGRldGVudG9yIGRvcyBkaXJlaXRvcyBhdXRvcmFpcyBwYXJhIGNvbmNlZGVyIMOgIFNpZ2xhIGRlIFVuaXZlcnNpZGFkZSAKb3MgZGlyZWl0b3MgYXByZXNlbnRhZG9zIG5lc3RhIGxpY2Vuw6dhLCBlIHF1ZSBlc3NlIG1hdGVyaWFsIGRlIHByb3ByaWVkYWRlIGRlIHRlcmNlaXJvcyBlc3TDoSBjbGFyYW1lbnRlIAppZGVudGlmaWNhZG8gZSByZWNvbmhlY2lkbyBubyB0ZXh0byBvdSBubyBjb250ZcO6ZG8gZGEgdGVzZSBvdSBkaXNzZXJ0YcOnw6NvIG9yYSBkZXBvc2l0YWRhLgoKQ0FTTyBBIFRFU0UgT1UgRElTU0VSVEHDh8ODTyBPUkEgREVQT1NJVEFEQSBURU5IQSBTSURPIFJFU1VMVEFETyBERSBVTSBQQVRST0PDjU5JTyBPVSAKQVBPSU8gREUgVU1BIEFHw4pOQ0lBIERFIEZPTUVOVE8gT1UgT1VUUk8gT1JHQU5JU01PIFFVRSBOw4NPIFNFSkEgQSBTSUdMQSBERSAKVU5JVkVSU0lEQURFLCBWT0PDiiBERUNMQVJBIFFVRSBSRVNQRUlUT1UgVE9ET1MgRSBRVUFJU1FVRVIgRElSRUlUT1MgREUgUkVWSVPDg08gQ09NTyAKVEFNQsOJTSBBUyBERU1BSVMgT0JSSUdBw4fDlUVTIEVYSUdJREFTIFBPUiBDT05UUkFUTyBPVSBBQ09SRE8uCgpBIFNpZ2xhIGRlIFVuaXZlcnNpZGFkZSBzZSBjb21wcm9tZXRlIGEgaWRlbnRpZmljYXIgY2xhcmFtZW50ZSBvIHNldSBub21lIChzKSBvdSBvKHMpIG5vbWUocykgZG8ocykgCmRldGVudG9yKGVzKSBkb3MgZGlyZWl0b3MgYXV0b3JhaXMgZGEgdGVzZSBvdSBkaXNzZXJ0YcOnw6NvLCBlIG7Do28gZmFyw6EgcXVhbHF1ZXIgYWx0ZXJhw6fDo28sIGFsw6ltIGRhcXVlbGFzIApjb25jZWRpZGFzIHBvciBlc3RhIGxpY2Vuw6dhLgo= |
dc.title.por.fl_str_mv |
Implementações paralelas para os problemas do fecho transitivo e caminho mínimo APSP na GPU |
dc.title.alternative.eng.fl_str_mv |
Parallel implementations for transitive closure and minimum path APSP problems in GPU |
title |
Implementações paralelas para os problemas do fecho transitivo e caminho mínimo APSP na GPU |
spellingShingle |
Implementações paralelas para os problemas do fecho transitivo e caminho mínimo APSP na GPU Gaioso, Roussian Di Ramos Alves GPU GPGPU CUDA Teoria dos Grafos Fecho transitivo APSP Caminho mínimo BFS Warshall Dijkstra FloydWarshall Paralelismo GPU GPGPU CUDA Graph Theory Transitive closure APSP Warshall BFS Warshall FloydWarshall Dijkstra Parallel Minimum Path Parallelism CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
title_short |
Implementações paralelas para os problemas do fecho transitivo e caminho mínimo APSP na GPU |
title_full |
Implementações paralelas para os problemas do fecho transitivo e caminho mínimo APSP na GPU |
title_fullStr |
Implementações paralelas para os problemas do fecho transitivo e caminho mínimo APSP na GPU |
title_full_unstemmed |
Implementações paralelas para os problemas do fecho transitivo e caminho mínimo APSP na GPU |
title_sort |
Implementações paralelas para os problemas do fecho transitivo e caminho mínimo APSP na GPU |
author |
Gaioso, Roussian Di Ramos Alves |
author_facet |
Gaioso, Roussian Di Ramos Alves |
author_role |
author |
dc.contributor.advisor1.fl_str_mv |
Martins, Wellington Santos |
dc.contributor.advisor1Lattes.fl_str_mv |
http://lattes.cnpq.br/3041686206689904 |
dc.contributor.referee1.fl_str_mv |
Martins, Wellington Santos |
dc.contributor.referee2.fl_str_mv |
Nascimento, Hugo Alexandre Dantas |
dc.contributor.referee3.fl_str_mv |
Cárceres, Edson Norberto |
dc.contributor.authorLattes.fl_str_mv |
http://lattes.cnpq.br/3536210071193629 |
dc.contributor.author.fl_str_mv |
Gaioso, Roussian Di Ramos Alves |
contributor_str_mv |
Martins, Wellington Santos Martins, Wellington Santos Nascimento, Hugo Alexandre Dantas Cárceres, Edson Norberto |
dc.subject.por.fl_str_mv |
GPU GPGPU CUDA Teoria dos Grafos Fecho transitivo APSP Caminho mínimo BFS Warshall Dijkstra FloydWarshall Paralelismo |
topic |
GPU GPGPU CUDA Teoria dos Grafos Fecho transitivo APSP Caminho mínimo BFS Warshall Dijkstra FloydWarshall Paralelismo GPU GPGPU CUDA Graph Theory Transitive closure APSP Warshall BFS Warshall FloydWarshall Dijkstra Parallel Minimum Path Parallelism CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
dc.subject.eng.fl_str_mv |
GPU GPGPU CUDA Graph Theory Transitive closure APSP Warshall BFS Warshall FloydWarshall Dijkstra Parallel Minimum Path Parallelism |
dc.subject.cnpq.fl_str_mv |
CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
description |
This paper presents a Graphics Processing Unit (GPU) based parallels implementations for the All Pairs Shortest Paths and Transitive Closure problems in graph. The implementations are based on the main sequential algorithms and takes full advantage of the highly multithreaded architecture of current manycore GPUs. Our solutions reduces the communication between CPU and GPU, improves the Streaming Multiprocessors (SMs) utilization, and makes intensive use of coalesced memory access to optimize graph data access. The advantages of the proposed implementations are demonstrated for several graphs randomly generated using the widely known graph library GTgraph. Graphs containing thousands of vertices and different edges densities, varying from sparse to complete graphs, were generated and used in the experiments. Our results confirm that GPU implementations can be competitive even for graph algorithms whose memory accesses and work distribution are both irregular and data-dependent. Keywords |
publishDate |
2014 |
dc.date.accessioned.fl_str_mv |
2014-10-30T14:29:29Z |
dc.date.issued.fl_str_mv |
2014-08-08 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/masterThesis |
format |
masterThesis |
status_str |
publishedVersion |
dc.identifier.citation.fl_str_mv |
GAIOSO, Roussian Di Ramos Alves. Implementações paralelas para os problemas do fecho transitivo e caminho mínimo APSP na GPU. 2014. 118 f. Dissertação (Mestrado em Ciência da Computação) - Universidade Federal de Goiás, Goiânia, 2014. |
dc.identifier.uri.fl_str_mv |
http://repositorio.bc.ufg.br/tede/handle/tede/3471 |
identifier_str_mv |
GAIOSO, Roussian Di Ramos Alves. Implementações paralelas para os problemas do fecho transitivo e caminho mínimo APSP na GPU. 2014. 118 f. Dissertação (Mestrado em Ciência da Computação) - Universidade Federal de Goiás, Goiânia, 2014. |
url |
http://repositorio.bc.ufg.br/tede/handle/tede/3471 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.relation.program.fl_str_mv |
-3303550325223384799 |
dc.relation.confidence.fl_str_mv |
600 600 600 600 |
dc.relation.department.fl_str_mv |
-7712266734633644768 |
dc.relation.cnpq.fl_str_mv |
3671711205811204509 |
dc.relation.sponsorship.fl_str_mv |
-2555911436985713659 |
dc.rights.driver.fl_str_mv |
http://creativecommons.org/licenses/by-nc-nd/4.0/ info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-nd/4.0/ |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Universidade Federal de Goiás |
dc.publisher.program.fl_str_mv |
Programa de Pós-graduação em Ciência da Computação (INF) |
dc.publisher.initials.fl_str_mv |
UFG |
dc.publisher.country.fl_str_mv |
Brasil |
dc.publisher.department.fl_str_mv |
Instituto de Informática - INF (RG) |
publisher.none.fl_str_mv |
Universidade Federal de Goiás |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFG instname:Universidade Federal de Goiás (UFG) instacron:UFG |
instname_str |
Universidade Federal de Goiás (UFG) |
instacron_str |
UFG |
institution |
UFG |
reponame_str |
Repositório Institucional da UFG |
collection |
Repositório Institucional da UFG |
bitstream.url.fl_str_mv |
http://repositorio.bc.ufg.br/tede/bitstreams/68e88cf9-a3d8-49e8-a484-d3a166a5a928/download http://repositorio.bc.ufg.br/tede/bitstreams/f072ba61-5ded-4289-b9fe-890f70542d1e/download http://repositorio.bc.ufg.br/tede/bitstreams/1281632c-5516-4315-95a6-34e4ab18b6e5/download http://repositorio.bc.ufg.br/tede/bitstreams/9757f53c-5c66-46f1-8075-3d89342fed73/download http://repositorio.bc.ufg.br/tede/bitstreams/864a7e01-e3ad-4377-bc3a-eec122e6f09b/download http://repositorio.bc.ufg.br/tede/bitstreams/8952a2b4-a8bb-46af-aad6-ce68a8fb90ac/download http://repositorio.bc.ufg.br/tede/bitstreams/afb6924f-6870-4fcd-a801-e8c9475e7545/download |
bitstream.checksum.fl_str_mv |
bd3efa91386c1718a7f26a329fdcb468 4afdbb8c545fd630ea7db775da747b2f 1e0094e9d8adcf16b18effef4ce7ed83 9da0b6dfac957114c6a7714714b86306 9990f791c0f9abaee7e3e03e4cdc8ee4 e8146fcea2cf860588a03d87db050479 f0359a8288c58104e9050e3c794ad3ac |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 MD5 MD5 MD5 MD5 |
repository.name.fl_str_mv |
Repositório Institucional da UFG - Universidade Federal de Goiás (UFG) |
repository.mail.fl_str_mv |
tasesdissertacoes.bc@ufg.br |
_version_ |
1798044369742200832 |