Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA (2016)
- Authors:
- Autor USP: SONG, SIANG WUN - IME
- Unidade: IME
- DOI: 10.1186/s13173-016-0045-4
- Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
- Keywords: Parallel algorithms; Multicore; GPGPU; BSP/CGM; Maximum subsequence sum problem
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher place: Heidelberg
- Date published: 2016
- Source:
- Título do periódico: Journal of the Brazilian Computer Society
- ISSN: 0104-6500
- Volume/Número/Paginação/Ano: v. 22, n. 7, p. 1-13, 2016
- Este periódico é de acesso aberto
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: gold
- Licença: cc-by-nc
-
ABNT
LIMA, Anderson C. et al. Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA. Journal of the Brazilian Computer Society, v. 22, n. 7, p. 1-13, 2016Tradução . . Disponível em: https://doi.org/10.1186/s13173-016-0045-4. Acesso em: 09 ago. 2024. -
APA
Lima, A. C., Branco, R. G., Ferraz, S., Cáceres, E. N., Gaioso, R. A., Martins, W. S., & Song, S. W. (2016). Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA. Journal of the Brazilian Computer Society, 22( 7), 1-13. doi:10.1186/s13173-016-0045-4 -
NLM
Lima AC, Branco RG, Ferraz S, Cáceres EN, Gaioso RA, Martins WS, Song SW. Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA [Internet]. Journal of the Brazilian Computer Society. 2016 ; 22( 7): 1-13.[citado 2024 ago. 09 ] Available from: https://doi.org/10.1186/s13173-016-0045-4 -
Vancouver
Lima AC, Branco RG, Ferraz S, Cáceres EN, Gaioso RA, Martins WS, Song SW. Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA [Internet]. Journal of the Brazilian Computer Society. 2016 ; 22( 7): 1-13.[citado 2024 ago. 09 ] Available from: https://doi.org/10.1186/s13173-016-0045-4 - Comprehensive evaluation of a two dimensional configurable array
- Towards a simple construction method for hamiltonian decomposition of the hypercube
- Reconhecimento de linguagens regulares por standard cells
- Paralelizacao de lacos encaixados pela tecnica de encolhimento de ciclos
- Revisiting cycle shrinking
- Randomized parallel list ranking for distributed memory multiprocessors
- A BSP/CGM algorithm for the all-substrings longest common subsequence problem
- A parallel solution to infer genetic network architectures in gene expression analysis
- A range minima parallel algorithm for coarse grained multicomputers
- Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm
Informações sobre o DOI: 10.1186/s13173-016-0045-4 (Fonte: oaDOI API)
Download do texto completo
Tipo | Nome | Link | |
---|---|---|---|
2841196.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas