ReP USP - Resultado da busca

Filtros : "International Journal of Parallel, Emergent and Distributed Systems" "Reino Unido" Limpar

Filtros

Artigo de periodico
Min-heap-based scheduling algorithm: an approximation algorithm for homogeneous and heterogeneous distributed systems (2016)
Gabriel, Paulo H. R; Albertini, Marcelo K; Castelo, Antonio ; Mello, Rodrigo Fernandes de
Fonte: International Journal of Parallel, Emergent and Distributed Systems. Unidade: ICMC
Assuntos: SISTEMAS DISTRIBUÍDOS, PROGRAMAÇÃO CONCORRENTE, ANÁLISE DE SÉRIES TEMPORAIS, SISTEMAS DISTRIBUÍDOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GABRIEL, Paulo H. R et al. Min-heap-based scheduling algorithm: an approximation algorithm for homogeneous and heterogeneous distributed systems. International Journal of Parallel, Emergent and Distributed Systems, v. 31, n. 1, p. 64-84, 2016Tradução . . Disponível em: https://doi.org/10.1080/17445760.2015.1009067. Acesso em: 09 nov. 2025.
APA
Gabriel, P. H. R., Albertini, M. K., Castelo, A., & Mello, R. F. de. (2016). Min-heap-based scheduling algorithm: an approximation algorithm for homogeneous and heterogeneous distributed systems. International Journal of Parallel, Emergent and Distributed Systems, 31( 1), 64-84. doi:10.1080/17445760.2015.1009067
NLM
Gabriel PHR, Albertini MK, Castelo A, Mello RF de. Min-heap-based scheduling algorithm: an approximation algorithm for homogeneous and heterogeneous distributed systems [Internet]. International Journal of Parallel, Emergent and Distributed Systems. 2016 ; 31( 1): 64-84.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1080/17445760.2015.1009067
Vancouver
Gabriel PHR, Albertini MK, Castelo A, Mello RF de. Min-heap-based scheduling algorithm: an approximation algorithm for homogeneous and heterogeneous distributed systems [Internet]. International Journal of Parallel, Emergent and Distributed Systems. 2016 ; 31( 1): 64-84.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1080/17445760.2015.1009067
Artigo de periodico
Application execution path analysis for the automatic parallelisation of binary codes in the Intel x86 platform (2016)
Eberle, André M; Mello, Rodrigo Fernandes de
Fonte: International Journal of Parallel, Emergent and Distributed Systems. Unidade: ICMC
Assuntos: SISTEMAS DISTRIBUÍDOS, PROGRAMAÇÃO CONCORRENTE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
EBERLE, André M e MELLO, Rodrigo Fernandes de. Application execution path analysis for the automatic parallelisation of binary codes in the Intel x86 platform. International Journal of Parallel, Emergent and Distributed Systems, v. 31, n. 5, p. 405-419, 2016Tradução . . Disponível em: https://doi.org/10.1080/17445760.2015.1104681. Acesso em: 09 nov. 2025.
APA
Eberle, A. M., & Mello, R. F. de. (2016). Application execution path analysis for the automatic parallelisation of binary codes in the Intel x86 platform. International Journal of Parallel, Emergent and Distributed Systems, 31( 5), 405-419. doi:10.1080/17445760.2015.1104681
NLM
Eberle AM, Mello RF de. Application execution path analysis for the automatic parallelisation of binary codes in the Intel x86 platform [Internet]. International Journal of Parallel, Emergent and Distributed Systems. 2016 ; 31( 5): 405-419.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1080/17445760.2015.1104681
Vancouver
Eberle AM, Mello RF de. Application execution path analysis for the automatic parallelisation of binary codes in the Intel x86 platform [Internet]. International Journal of Parallel, Emergent and Distributed Systems. 2016 ; 31( 5): 405-419.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1080/17445760.2015.1104681

Biblioteca Digital de Produção Intelectual da Universidade de São Paulo 2012 - 2025