Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Yi Wen Wong"'
Autor:
Wai Teng Tang, Weiguang Chen, Yi Wen Wong, Stephen John Turner, Wen Jun Tan, Weng-Fai Wong, Rick Siow Mong Goh, Shyh-hao Kuo, Rajarshi Ray
Publikováno v:
SC
The sparse matrix-vector (SpMV) multiplication routine is an important building block used in many iterative algorithms for solving scientific and engineering problems. One of the main challenges of SpMV is its memory-boundedness. Although compressio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::054ca4b7785392cf2f3aefe4364bcbcd
https://doi.org/10.1145/2503210.2503234
https://doi.org/10.1145/2503210.2503234
Autor:
Wai Teng Tang, Rick Siow Mong Goh, Wen Jun Tan, Weng-Fai Wong, Yi Wen Wong, Stephen John Turner, Ratna Krishnamoorthy, Shyh-hao Kuo
Publikováno v:
IPDPS
Stencils represent an important class of computations that are used in many scientific disciplines. Increasingly, many of the stencil computations in scientific applications are being offloaded to GPUs to improve running times. Since a large part of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc407c950a219ae3b1d99643edc6521f
https://doi.org/10.1109/ipdps.2013.79
https://doi.org/10.1109/ipdps.2013.79
Autor:
Wai Teng Tang, Tomasz Dubrownik, Shyh-hao Kuo, Rick Siow Mong Goh, Stephen John Turner, Wen Jun Tan, Weng-Fai Wong, Yi Wen Wong, Rubing Duan
Publikováno v:
Euro-Par 2012 Parallel Processing ISBN: 9783642328190
Euro-Par
Euro-Par
Parallelization of existing code for modern multicore processors is tedious as the person performing these tasks must understand the algorithms, data structures and data dependencies in order to do a good job. Current options available to the program
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4da6e4555f54d2935d43ad2d4f9179b5
https://doi.org/10.1007/978-3-642-32820-6_3
https://doi.org/10.1007/978-3-642-32820-6_3
Publikováno v:
ICPADS
Scheduling parallel applications on heterogeneous processors/architectures with different computational speed is a difficult problem. Here, a tabu search metaheuristic is developed to improve the schedule generated by list scheduling. Three neighbour
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f1e0e4e295fc445f98f212aa75d9972
https://doi.org/10.1109/icpads.2009.127
https://doi.org/10.1109/icpads.2009.127
Publikováno v:
International Journal of Bio-Inspired Computation. 2:85
Job shop scheduling problem (JSSP) is an NP-hard problem that is closely related to scheduling activities in manufacturing industry. This paper presents an improved bee colony optimisation algorithm with Big Valley landscape exploitation (BCBV) as a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0672c912bee258b8f62e1cede3ce5b2
https://doi.org/10.1504/ijbic.2010.032125
https://doi.org/10.1504/ijbic.2010.032125
Publikováno v:
2009 15th International Conference on Parallel & Distributed Systems (ICPADS); 2009, p663-670, 8p