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.1009067NLM
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.1009067Vancouver
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
