Zobrazeno 1 - 10
of 97
pro vyhledávání: '"Siang Wun Song"'
Autor:
Luiz C. S. Rozante, Siang Wun Song, David Martins, Raphael Y. de Camargo, Danilo Carastan-Santos
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
The Systems Biology field presents several complex combinatorial problems that can be in part reduced to an instance of the Hitting Set Problem (HSP), which is NP-Hard. These reduced problems often come with a large amount of data that needs to be pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b45e09f91a8d9d9687b829beb5c6c47a
https://doi.org/10.1016/j.future.2016.02.009
https://doi.org/10.1016/j.future.2016.02.009
Autor:
Henrique Mongelli, Jayme Luiz Szwarcfiter, Jucele Franca de Alencar Vasconcellos, Siang Wun Song, Edson Norberto Cáceres, Frank Dehne
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
Computing a spanning tree (ST) and a minimum ST (MST) of a graph are fundamental problems in graph theory and arise as a subproblem in many applications. In this article, we propose parallel algorithms to these problems. One of the steps of previous
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa894226328f7faa0239fcc141a69fde
Autor:
Danilo Carastan-Santos, David Correa Martins-Jr, Raphael Y. de Camargo, Siang Wun Song, Luiz C. S. Rozante
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94794a2c4d46f73f0c498c8568a559de
https://doi.org/10.1002/cpe.5087
https://doi.org/10.1002/cpe.5087
Autor:
Edson Norberto Cáceres, Henrique Mongelli, Siang Wun Song, Jucele Franca de Alencar Vasconcellos
Publikováno v:
SBAC-PAD
In this paper, using the BSP/CGM model, we propose a parallel algorithm and implement it on a GPGPU to obtain a minimum spanning tree of a graph. Previous works for this problem are based on the solution of the list ranking problem which, though effi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28ef3e1bb1982d809c3672657a68e3ad
https://doi.org/10.1109/cahpc.2018.8645917
https://doi.org/10.1109/cahpc.2018.8645917
Autor:
Edson Norberto Cáceres, Jucele Franca de Alencar Vasconcellos, Henrique Mongelli, Siang Wun Song
Publikováno v:
Anais do XVIII Simpósio em Sistemas Computacionais de Alto Desempenho (WSCAD 2017).
Neste trabalho, usando o modelo BSP/CGM, propomos um algoritmo paralelo, com uma implementação em CUDA, para obter uma árvore geradora de um grafo. Trabalhos anteriores para este problema são baseados na solução do problema de list ranking que,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27221bf18ee803081b92cd60fe8de63f
https://doi.org/10.5753/wscad.2017.257
https://doi.org/10.5753/wscad.2017.257
Autor:
Raphael Y. de Camargo, Siang Wun Song, Luiz C. S. Rozante, Danilo Carastan-Santos, David Correa Martins-Jr
Publikováno v:
Anais do XVIII Simpósio em Sistemas Computacionais de Alto Desempenho (WSCAD 2017).
We present a hybrid exact algorithm for the Hitting Set Problem (HSP) for highly heterogeneous CPU-GPU-MIC platforms. With several techniques that permit an efficient exploitation of each architecture, low communication cost and effective load balanc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b81afdca4949eb58576ef580b9e1b6f2
https://doi.org/10.5753/wscad.2017.250
https://doi.org/10.5753/wscad.2017.250
Autor:
Henrique Mongelli, Edson Norberto Cáceres, Siang Wun Song, Jucele Franca de Alencar Vasconcellos
Publikováno v:
SBAC-PAD Workshops
Computing a minimum spanning tree (MST) of a graph is a fundamental problem in Graph Theory and arises as a subproblem in many applications. In this paper, we propose a parallel MST algorithm and implement it on a GPU (Graphics Processing Unit). One
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c27f74d2a75277578766afe356aaf5d
https://doi.org/10.1109/sbac-padw.2017.20
https://doi.org/10.1109/sbac-padw.2017.20
Publikováno v:
ICCS
The Multidimensional Knapsack Problem (MKP) is a generalization of the basic Knapsack Problem, with two or more constraints. It is an important optimization problem with many real-life applications. To solve this NP-hard problem we use a metaheuristi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e242fd13b0ddf3ec3647a84e2ed4e46b