Graph reduction for QoS prediction of cloud–service compositions (2014)
- Authors:
- Autor USP: LEJBMAN, ALFREDO GOLDMAN VEL - IME
- Unidade: IME
- DOI: 10.1504/IJBPIM.2014.063514
- Subjects: COMPUTAÇÃO EM NUVEM; HEURÍSTICA; TEORIA DOS GRAFOS
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: International Journal of Business Process Integration and Management
- ISSN: 1741-8771
- Volume/Número/Paginação/Ano: v. 7, n. 2, p. 89-102, 2014
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
NGOKO, Yanik e CERIN, Christophe e GOLDMAN, Alfredo. Graph reduction for QoS prediction of cloud–service compositions. International Journal of Business Process Integration and Management, v. 7, n. 2, p. 89-102, 2014Tradução . . Disponível em: https://doi.org/10.1504/IJBPIM.2014.063514. Acesso em: 19 abr. 2024. -
APA
Ngoko, Y., Cerin, C., & Goldman, A. (2014). Graph reduction for QoS prediction of cloud–service compositions. International Journal of Business Process Integration and Management, 7( 2), 89-102. doi:10.1504/IJBPIM.2014.063514 -
NLM
Ngoko Y, Cerin C, Goldman A. Graph reduction for QoS prediction of cloud–service compositions [Internet]. International Journal of Business Process Integration and Management. 2014 ; 7( 2): 89-102.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1504/IJBPIM.2014.063514 -
Vancouver
Ngoko Y, Cerin C, Goldman A. Graph reduction for QoS prediction of cloud–service compositions [Internet]. International Journal of Business Process Integration and Management. 2014 ; 7( 2): 89-102.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1504/IJBPIM.2014.063514 - 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
- A model for parallel job scheduling on dynamic computer grids
- 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
Informações sobre o DOI: 10.1504/IJBPIM.2014.063514 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
