排序方式: 共有4条查询结果,搜索用时 15 毫秒
1
1.
2.
Ortega-Arranz Alejandro Er Erkan Martínez-Monés Alejandra Bote-Lorenzo Miguel L. Asensio-Pérez Juan I. Muñoz-Cristóbal Juan A. 《Universal Access in the Information Society》2019,18(3):533-549
Universal Access in the Information Society - Despite the advantages of MOOCs, such as the open and free access to education, these courses are criticized for students’ lack of motivation and... 相似文献
3.
4.
Hector Ortega-Arranz Yuri Torres Arturo Gonzalez-Escribano Diego R. Llanos 《The Journal of supercomputing》2014,70(2):786-798
During the last years, GPU manycore devices have demonstrated their usefulness to accelerate computationally intensive problems. Although arriving at a parallelization of a highly parallel algorithm is an affordable task, the optimization of GPU codes is a challenging activity. The main reason for this is the number of parameters, programming choices, and tuning techniques available, many of them related with complex and sometimes hidden architecture details. A useful strategy to systematically attack these optimization problems is to characterize the different kernels of the application, and use this knowledge to select appropriate configuration parameters. The All-Pair Shortest-Path (APSP) problem is a well-known problem in graph theory whose objective is to find the shortest paths between any pairs of nodes in a graph. This problem can be solved by highly parallel and computational intensive tasks, being a good candidate to be exploited by manycore devices. In this paper, we use kernel characterization criteria to optimize an APSP algorithm implementation for NVIDIA GPUs. Our experimental results show that the combined use of proper configuration policies, and the concurrent kernels capability of new CUDA architectures, leads to a performance improvement of up to 62 % with respect to one of the possible configurations recommended by CUDA, considered as baseline. 相似文献
1