A comparative study on task dependent scheduling algorithms for grid computing (2012)
- Authors:
- USP affiliated authors: LEJBMAN, ALFREDO GOLDMAN VEL - IME ; NGOKO, YANIK MARTIAL - IME
- Unidade: IME
- DOI: 10.1109/WSCAD-SSC.2012.41
- Assunto: SISTEMAS DISTRIBUÍDOS
- Language: Português
- Imprenta:
- Publisher: IEEE
- Publisher place: Piscataway
- Date published: 2012
- Source:
- Título do periódico: Proceedings
- Conference titles: Symposium on Computer Systems - WSCAD-SSC
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
MAMANI ALIAGA, Alvaro Henry e GOLDMAN, Alfredo e NGOKO, Yanik. A comparative study on task dependent scheduling algorithms for grid computing. 2012, Anais.. Piscataway: IEEE, 2012. Disponível em: https://doi.org/10.1109/WSCAD-SSC.2012.41. Acesso em: 18 abr. 2024. -
APA
Mamani Aliaga, A. H., Goldman, A., & Ngoko, Y. (2012). A comparative study on task dependent scheduling algorithms for grid computing. In Proceedings. Piscataway: IEEE. doi:10.1109/WSCAD-SSC.2012.41 -
NLM
Mamani Aliaga AH, Goldman A, Ngoko Y. A comparative study on task dependent scheduling algorithms for grid computing [Internet]. Proceedings. 2012 ;[citado 2024 abr. 18 ] Available from: https://doi.org/10.1109/WSCAD-SSC.2012.41 -
Vancouver
Mamani Aliaga AH, Goldman A, Ngoko Y. A comparative study on task dependent scheduling algorithms for grid computing [Internet]. Proceedings. 2012 ;[citado 2024 abr. 18 ] Available from: https://doi.org/10.1109/WSCAD-SSC.2012.41 - On graph reduction for QoS prediction of very large web service compositions
- An analytical approach for predicting QoS of web services choreographies
- Malleable resource sharing algorithms for cooperative resolution of problems
- 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
Informações sobre o DOI: 10.1109/WSCAD-SSC.2012.41 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
