A simple BSP-based model to predict execution time in GPU applications (2016)
- Authors:
- Autor USP: LEJBMAN, ALFREDO GOLDMAN VEL - IME
- Unidade: IME
- DOI: 10.1109/HiPC.2015.34
- Subjects: ARQUITETURAS PARALELAS; CIÊNCIA DA COMPUTAÇÃO
- Keywords: CUDA; BSP model; performance prediction; GPGPU; Kepler srchitecture
- Language: Inglês
- Imprenta:
- Publisher: IEEE
- Publisher place: Los Alamitos
- Date published: 2016
- Source:
- Título do periódico: Proceedings
- Conference titles: IEEE International Conference on High Performance Computing - HiPC
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
-
ABNT
AMARÍS, Marcos et al. A simple BSP-based model to predict execution time in GPU applications. 2016, Anais.. Los Alamitos: IEEE, 2016. Disponível em: https://doi.org/10.1109/HiPC.2015.34. Acesso em: 19 abr. 2024. -
APA
Amarís, M., Cordeiro, D., Goldman, A., & Camargo, R. Y. de. (2016). A simple BSP-based model to predict execution time in GPU applications. In Proceedings. Los Alamitos: IEEE. doi:10.1109/HiPC.2015.34 -
NLM
Amarís M, Cordeiro D, Goldman A, Camargo RY de. A simple BSP-based model to predict execution time in GPU applications [Internet]. Proceedings. 2016 ;[citado 2024 abr. 19 ] Available from: https://doi.org/10.1109/HiPC.2015.34 -
Vancouver
Amarís M, Cordeiro D, Goldman A, Camargo RY de. A simple BSP-based model to predict execution time in GPU applications [Internet]. Proceedings. 2016 ;[citado 2024 abr. 19 ] Available from: https://doi.org/10.1109/HiPC.2015.34 - 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.1109/HiPC.2015.34 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
