Logotipo del repositorio
  • English
  • Español
  • Français
  • Português
  • Iniciar sesión
    ¿Has olvidado tu contraseña?
Logotipo del repositorio
  • Comunidades
  • Listar por
  • English
  • Español
  • Français
  • Português
  • Iniciar sesión
    ¿Has olvidado tu contraseña?
  1. Inicio
  2. Buscar por autor

Examinando por Autor "Trefftz C."

Mostrando 1 - 3 de 3
Resultados por página
Opciones de ordenación
  • No hay miniatura disponible
    Ítem
    Exhaustive community enumeration on a cluster
    (Institute of Electrical and Electronics Engineers Inc., 2018-01-01) Trefftz C.; McGuire H.; Kurmas Z.; Scripps J.; Pineda J.D.; Universidad EAFIT. Departamento de Ingeniería de Sistemas; I+D+I en Tecnologías de la Información y las Comunicaciones
    A parallelization based on MPI and OpenMP of an algorithm that evaluates and counts all the possible communities of a graph is presented. Performance results of the parallelization of the algorithm obtained on a cluster of workstations are reported. Load balancing was used to improve the speedups obtained on the cluster. Two different kinds of load balancing approaches were used: One that involved only MPI and a second one in which MPI and OpenMP were combined. The reason for the load imbalance is described. © 2018 IEEE.
  • No hay miniatura disponible
    Ítem
    Solving large systems of linear equations on GPUs
    (Springer Verlag, 2018-01-01) Llano-Ríos T.F.; Ocampo-García J.D.; Yepes-Ríos J.S.; Correa-Zabala F.J.; Trefftz C.; Universidad EAFIT. Departamento de Ingeniería de Sistemas; I+D+I en Tecnologías de la Información y las Comunicaciones
    Graphical Processing Units (GPUs) have become more accessible peripheral devices with great computing capacity. Moreover, GPUs can be used not only to accelerate the graphics produced by a computer but also for general purpose computing. Many researchers use this technique on their personal workstations to accelerate the execution of their programs and have often encountered that the amount of memory available on GPU cards is typically smaller than the amount of memory available on the host computer. We are interested in exploring approaches to solve problems with this restriction. Our main contribution is to devise ways in which portions of the problem can be moved to the memory of the GPU to be solved using its multiprocessing capabilities. We implemented on a GPU the Jacobi iterative method to solve systems of linear equations and report the details from the results obtained, analyzing its performance and accuracy. Our code solves a system of linear equations large enough to exceed the card’s memory, but not the host memory. Significant speedups were observed, as the execution time taken to solve each system is faster than those obtained with Intel® MKL and Eigen, libraries designed to work on CPUs. © Springer Nature Switzerland AG 2018.
  • No hay miniatura disponible
    Ítem
    Solving large systems of linear equations on GPUs
    (Springer Verlag, 2018-01-01) Llano-Ríos T.F.; Ocampo-García J.D.; Yepes-Ríos J.S.; Correa-Zabala F.J.; Trefftz C.; Llano-Ríos T.F.; Ocampo-García J.D.; Yepes-Ríos J.S.; Correa-Zabala F.J.; Trefftz C.; Universidad EAFIT. Departamento de Ciencias; Lógica y Computación
    Graphical Processing Units (GPUs) have become more accessible peripheral devices with great computing capacity. Moreover, GPUs can be used not only to accelerate the graphics produced by a computer but also for general purpose computing. Many researchers use this technique on their personal workstations to accelerate the execution of their programs and have often encountered that the amount of memory available on GPU cards is typically smaller than the amount of memory available on the host computer. We are interested in exploring approaches to solve problems with this restriction. Our main contribution is to devise ways in which portions of the problem can be moved to the memory of the GPU to be solved using its multiprocessing capabilities. We implemented on a GPU the Jacobi iterative method to solve systems of linear equations and report the details from the results obtained, analyzing its performance and accuracy. Our code solves a system of linear equations large enough to exceed the card’s memory, but not the host memory. Significant speedups were observed, as the execution time taken to solve each system is faster than those obtained with Intel® MKL and Eigen, libraries designed to work on CPUs. © Springer Nature Switzerland AG 2018.

Vigilada Mineducación

Universidad con Acreditación Institucional hasta 2026 - Resolución MEN 2158 de 2018

Software DSpace copyright © 2002-2025 LYRASIS

  • Configuración de cookies
  • Enviar Sugerencias