A parallel interval arithmetic-based reliable computing method on a GPU
Video cards have now outgrown their purpose of being only a simple tool for graphic display. With their high speed video memories, lots of maths units and parallelism, they can be very powerful accessories for general purpose computing tasks. Our selected platform for testing is the CUDA (Compute Un...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2017
|
| Sorozat: | Acta cybernetica
23 No. 2 |
| Kulcsszavak: | Analízis - matematikai - intervallum, Intervallumanalízis, Számítástechnika - matematikai alapok, Algoritmus - informatika |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.23.2.2017.4 |
| Online Access: | http://acta.bibl.u-szeged.hu/50084 |
| LEADER | 02005nab a2200241 i 4500 | ||
|---|---|---|---|
| 001 | acta50084 | ||
| 005 | 20220620141308.0 | ||
| 008 | 180213s2017 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 024 | 7 | |a 10.14232/actacyb.23.2.2017.4 |2 doi | |
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Bagóczki Zsolt | |
| 245 | 1 | 2 | |a A parallel interval arithmetic-based reliable computing method on a GPU |h [elektronikus dokumentum] / |c Bagóczki Zsolt |
| 260 | |c 2017 | ||
| 300 | |a 491-501 | ||
| 490 | 0 | |a Acta cybernetica |v 23 No. 2 | |
| 520 | 3 | |a Video cards have now outgrown their purpose of being only a simple tool for graphic display. With their high speed video memories, lots of maths units and parallelism, they can be very powerful accessories for general purpose computing tasks. Our selected platform for testing is the CUDA (Compute Unified Device Architecture), which offers us direct access to the virtual instruction set of the video card, and we are able to run our computations on dedicated computing kernels. The CUDA development kit comes with a useful toolbox and a wide range of GPU-based function libraries. In this parallel environment, we implemented a reliable method based on the Branch-and-Bound algorithm. This algorithm will give us the opportunity to use node level (also called low-level or type 1) parallelization, since we do not modify the searching trajectories; nor do we modify the dimensions of the Branch-and-Bound tree [5]. For testing, we chose the circle covering problem. We then scaled the problem up to three dimensions, and ran tests with sphere covering problems as well. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Analízis - matematikai - intervallum, Intervallumanalízis, Számítástechnika - matematikai alapok, Algoritmus - informatika | ||
| 700 | 0 | 1 | |a Bánhelyi Balázs |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/50084/1/actacyb_23_2_2017_4.pdf |z Dokumentum-elérés |