Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Nodari Sitchinava"'
Publikováno v:
IEEE Transactions on Computers. 71:1104-1116
We present parallel algorithms to efficiently permute a sorted array into the level-order binary search tree (BST), level-order B-tree (B-tree), and van Emde Boas (vEB) layouts in-place. We analytically determine the complexity of our algorithms and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08a2e08dec5aa4b6e6a5dc09b8a890bc
https://doi.org/10.1109/tc.2021.3075392
https://doi.org/10.1109/tc.2021.3075392
Autor:
Kyle Berney, Nodari Sitchinava
Publikováno v:
IPDPS
Currently, the fastest comparison-based sorting implementation on GPUs is implemented using a parallel pairwise merge sort algorithm (Thrust library). To achieve fast runtimes, the number of threads t to sort the input of N elements is fine-tuned exp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c77aa85c7c9d2515c50164ac98bca0e1
https://doi.org/10.1109/ipdps47924.2020.00119
https://doi.org/10.1109/ipdps47924.2020.00119
Publikováno v:
Euro-Par 2020: Parallel Processing ISBN: 9783030576745
Euro-Par
Euro-Par
When lexicographically sorting strings, it is not always necessary to inspect all symbols. For example, the lexicographical rank of europar amongst the strings eureka, eurasia, and excells only depends on its so called relevant prefix euro. The disti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c846b3df3e83b56d0adf39e8f462acf
https://doi.org/10.1007/978-3-030-57675-2_21
https://doi.org/10.1007/978-3-030-57675-2_21
Autor:
Darren Strash, Nodari Sitchinava
Publikováno v:
Journal of Graph Algorithms and Applications. 22:431-459
Visibility graph reconstruction, which asks us to construct a polygon that has a given visibility graph, is a fundamental problem with unknown complexity (although visibility graph recognition is known to be in PSPACE). We show that two classes of un
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8dde5a7aff0e2499449ae4919e91039
https://doi.org/10.7155/jgaa.00469
https://doi.org/10.7155/jgaa.00469
Autor:
Henri Casanova, Peyman Afshani, Mark de Berg, Constantinos Tsirogiannis, Ben Karsin, Colin Lambrechts, Nodari Sitchinava
Publikováno v:
Journal on Experimental Algorithmics, 23(2):2.3. Association for Computing Machinery, Inc
Afshani, P, De Berg, M, Casanova, H, Karsin, B, Lambrechts, C, Sitchinava, N & Tsirogiannis, C 2018, ' An efficient algorithm for the 1D total visibility-index problem and its parallelization ', ACM Journal of Experimental Algorithmics, vol. 23, 2.3 . https://doi.org/10.1145/3209685
Afshani, P, De Berg, M, Casanova, H, Karsin, B, Lambrechts, C, Sitchinava, N & Tsirogiannis, C 2018, ' An efficient algorithm for the 1D total visibility-index problem and its parallelization ', ACM Journal of Experimental Algorithmics, vol. 23, 2.3 . https://doi.org/10.1145/3209685
Let T be a terrain and P be a set of points on its surface. An important problem in Geographic Information Science (GIS) is computing the visibility index of a point p on P , that is, the number of points in P that are visible from p . The total visi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63b63f6dcd7120c5cf84e46fb2b88fcf
http://www.scopus.com/inward/record.url?scp=85052704780&partnerID=8YFLogxK
http://www.scopus.com/inward/record.url?scp=85052704780&partnerID=8YFLogxK
Publikováno v:
Proceedings-Supercomputing
ICS
ICS
We study the relationship between memory accesses, bank conflicts, thread multiplicity (also known as over-subscription) and instruction-level parallelism in comparison-based sorting algorithms for Graphics Processing Units (GPUs). We experimentally
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::52adbd6d75858eb4864ae187db3f57f8
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/326157
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/326157
Publikováno v:
IPDPS
We present parallel algorithms to efficiently permute a sorted array into the level-order binary search tree (BST), level-order B-tree (B-tree), and van Emde Boas (vEB) layouts in-place. We analytically determine the complexity of our algorithms and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::408d6ca22346bcefb982d4f239ea93db
https://doi.org/10.1109/ipdps.2018.00116
https://doi.org/10.1109/ipdps.2018.00116
Autor:
Darren Strash, Nodari Sitchinava
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319739144
Graph Drawing
Graph Drawing
Visibility graph reconstruction, which asks us to construct a polygon that has a given visibility graph, is a fundamental problem with unknown complexity (although visibility graph recognition is known to be in PSPACE). We show that two classes of un
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e05f241fe19c5593071c1c606083eb0b
https://doi.org/10.1007/978-3-319-73915-1_8
https://doi.org/10.1007/978-3-319-73915-1_8