Combining parallel algorithms solving the same application: what is the best approach? (2013)
- Authors:
- Autor USP: LEJBMAN, ALFREDO GOLDMAN VEL - IME
- Unidade: IME
- DOI: 10.1109/IPDPSW.2013.81
- Subjects: ALGORITMOS DE SCHEDULING; COMPUTABILIDADE E COMPLEXIDADE
- Keywords: algorithm portfolio; program synthesis; comparative analysis; cooperative problem solving; poly-algorithms
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: IEEE
- Publisher place: Piscataway
- Date published: 2013
- Source:
- Título do periódico: Proceedings
- Conference titles: International Parallel and Distributed Processing Symposium Workshops and PhD Forum - IPDPSW
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
GOLDMAN, Alfredo; LEPPING, Joachim; NGOKO, Yanik; TRYSTRAM, Denis. Combining parallel algorithms solving the same application: what is the best approach? Anais.. Piscataway: IEEE, 2013.Disponível em: -
APA
Goldman, A., Lepping, J., Ngoko, Y., & Trystram, D. (2013). Combining parallel algorithms solving the same application: what is the best approach? In Proceedings. Piscataway: IEEE. doi:10.1109/IPDPSW.2013.81 -
NLM
Goldman A, Lepping J, Ngoko Y, Trystram D. Combining parallel algorithms solving the same application: what is the best approach? [Internet]. Proceedings. 2013 ;Available from: https://doi.org/10.1109/IPDPSW.2013.81 -
Vancouver
Goldman A, Lepping J, Ngoko Y, Trystram D. Combining parallel algorithms solving the same application: what is the best approach? [Internet]. Proceedings. 2013 ;Available from: https://doi.org/10.1109/IPDPSW.2013.81 - Actor scheduling for multicore hierarchical memory platforms
- A delay-tolerant network routing algorithm based on column generation
- A MILP approach to schedule parallel independent tasks
- Condições de conectividade de algoritmos de exclusão mútua em redes dinâmicas
- Scheduling with duplication on m processors with small communication delays
- A model for parallel job schedulling on dynamical computer grids
- Exchanging messages of different sizes
- 1-optimality of static BSP computations: scheduling independent chains as a case study
- 17o. Wperformance Workshop em desempenho de sistemas computacionais e de comunicação. [Apresentação]
- Algorithms for the message exchange problem
Informações sobre o DOI: 10.1109/IPDPSW.2013.81 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
