|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM229088597 |
| 003 |
DE-627 |
| 005 |
20231224081401.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2013 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TVCG.2013.71
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0763.xml
|
| 035 |
|
|
|a (DE-627)NLM229088597
|
| 035 |
|
|
|a (NLM)23846096
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Kim, Duksu
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Scheduling in heterogeneous computing environments for proximity queries
|
| 264 |
|
1 |
|c 2013
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 10.02.2014
|
| 500 |
|
|
|a Date Revised 12.07.2013
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a We present a novel, linear programming (LP)-based scheduling algorithm that exploits heterogeneous multicore architectures such as CPUs and GPUs to accelerate a wide variety of proximity queries. To represent complicated performance relationships between heterogeneous architectures and different computations of proximity queries, we propose a simple, yet accurate model that measures the expected running time of these computations. Based on this model, we formulate an optimization problem that minimizes the largest time spent on computing resources, and propose a novel, iterative LP-based scheduling algorithm. Since our method is general, we are able to apply our method into various proximity queries used in five different applications that have different characteristics. Our method achieves an order of magnitude performance improvement by using four different GPUs and two hexa-core CPUs over using a hexa-core CPU only. Unlike prior scheduling methods, our method continually improves the performance, as we add more computing resources. Also, our method achieves much higher performance improvement compared with prior methods as heterogeneity of computing resources is increased. Moreover, for one of tested applications, our method achieves even higher performance than a prior parallel method optimized manually for the application. We also show that our method provides results that are close (e.g., 75 percent) to the performance provided by a conservative upper bound of the ideal throughput. These results demonstrate the efficiency and robustness of our algorithm that have not been achieved by prior methods. In addition, we integrate one of our contributions with a work stealing method. Our version of the work stealing method achieves 18 percent performance improvement on average over the original work stealing method. This result shows wide applicability of our approach
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Lee, Jinkyu
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Lee, Junghwan
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Shin, Insik
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Kim, John
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Yoon, Sung-Eui
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g 19(2013), 9 vom: 21. Sept., Seite 1513-25
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnns
|
| 773 |
1 |
8 |
|g volume:19
|g year:2013
|g number:9
|g day:21
|g month:09
|g pages:1513-25
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TVCG.2013.71
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 19
|j 2013
|e 9
|b 21
|c 09
|h 1513-25
|