A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis (2021)
- Authors:
- Autor USP: LEJBMAN, ALFREDO GOLDMAN VEL - IME
- Unidade: IME
- DOI: 10.1002/cpe.6007
- Subjects: ALGORITMOS PARA PROCESSAMENTO; PROGRAMAÇÃO DINÂMICA
- Keywords: biological sequence comparison; dynamic programming; field-programmable gate array; high-level synthesis; longest common subsequence
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher place: New Jersey
- Date published: 2021
- Source:
- Título: Concurrency and Computation: Practice and Experience
- ISSN: 1532-0626
- Volume/Número/Paginação/Ano: v. 33, n. 4, art. e6007, 2021
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
JORGE, Carlos Antônio Campos et al. A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis. Concurrency and Computation: Practice and Experience, v. 33, n. 4, 2021Tradução . . Disponível em: https://doi.org/10.1002/cpe.6007. Acesso em: 03 jan. 2026. -
APA
Jorge, C. A. C., Nery, A. S., Melo, A. C. M. A. de, & Goldman, A. (2021). A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis. Concurrency and Computation: Practice and Experience, 33( 4). doi:10.1002/cpe.6007 -
NLM
Jorge CAC, Nery AS, Melo ACMA de, Goldman A. A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis [Internet]. Concurrency and Computation: Practice and Experience. 2021 ; 33( 4):[citado 2026 jan. 03 ] Available from: https://doi.org/10.1002/cpe.6007 -
Vancouver
Jorge CAC, Nery AS, Melo ACMA de, Goldman A. A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis [Internet]. Concurrency and Computation: Practice and Experience. 2021 ; 33( 4):[citado 2026 jan. 03 ] Available from: https://doi.org/10.1002/cpe.6007 - A model for parallel job schedulling on dynamical computer grids
- Exchanging messages of different sizes
- Combining parallel algorithms solving the same application: what is the best approach?
- Actor scheduling for multicore hierarchical memory platforms
- Scheduling with duplication on m processors with small communication delays
- A MILP approach to schedule parallel independent tasks
- A delay-tolerant network routing algorithm based on column generation
- 1-optimality of static BSP computations: scheduling independent chains as a case study
- Condições de conectividade de algoritmos de exclusão mútua em redes dinâmicas
- Preface: Agile processes in software engineering and extreme programming - Workshop: XP 2024
Informações sobre o DOI: 10.1002/cpe.6007 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3008762.pdf | ||
 |
3008762.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
