ReP USP - Resultado da busca

Filtros : "PROGRAMAÇÃO CONCORRENTE" "Indexado no SciBase" 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
Source: International Journal of Parallel, Emergent and Distributed Systems. Unidade: ICMC
Subjects: 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
Extracting and predicting the communication behaviour of parallel applications (2009)
Mello, Rodrigo Fernandes de; Dodonov, Evgueni; Bertagna, Ricardo; Senger, Luciano José
Source: International Journal of Parallel, Emergent and Distributed Systems. Unidade: ICMC
Subjects: SISTEMAS DISTRIBUÍDOS, PROGRAMAÇÃO CONCORRENTE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MELLO, Rodrigo Fernandes de et al. Extracting and predicting the communication behaviour of parallel applications. International Journal of Parallel, Emergent and Distributed Systems, v. 24, n. ju 2009, p. 225-242, 2009Tradução . . Disponível em: https://doi.org/10.1080/17445760802387155. Acesso em: 09 nov. 2025.
APA
Mello, R. F. de, Dodonov, E., Bertagna, R., & Senger, L. J. (2009). Extracting and predicting the communication behaviour of parallel applications. International Journal of Parallel, Emergent and Distributed Systems, 24( ju 2009), 225-242. doi:10.1080/17445760802387155
NLM
Mello RF de, Dodonov E, Bertagna R, Senger LJ. Extracting and predicting the communication behaviour of parallel applications [Internet]. International Journal of Parallel, Emergent and Distributed Systems. 2009 ; 24( ju 2009): 225-242.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1080/17445760802387155
Vancouver
Mello RF de, Dodonov E, Bertagna R, Senger LJ. Extracting and predicting the communication behaviour of parallel applications [Internet]. International Journal of Parallel, Emergent and Distributed Systems. 2009 ; 24( ju 2009): 225-242.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1080/17445760802387155

Digital Library of Intellectual Production of Universidade de São Paulo 2012 - 2025