Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Row-major order"'
Autor:
Mark Ebersole
This chapter introduces key concepts of the data parallel execution model in CUDA. It first gives an overview of the multidimensional organization of CUDA threads, blocks, and grids. It then elaborates on the use of thread indexes and block indexes t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a60a723113f71ed1c07196ede8b9638
https://doi.org/10.1016/b978-0-12-811986-0.00003-0
https://doi.org/10.1016/b978-0-12-811986-0.00003-0
Autor:
Suman Mahapatra, J. K. Mandal
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9788132225256
In this paper, a Z transformation-based authentication technique has been proposed with higher Region of Convergence (ROC) value. Sequentially, five bits from the authenticating mask in row major order are considered and embedded into composite real
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa41e60a31aaaca091f9f0142a45728c
https://doi.org/10.1007/978-81-322-2526-3_55
https://doi.org/10.1007/978-81-322-2526-3_55
Publikováno v:
Journal of Systems and Software. 78:257-269
A transform-space index indexes spatial objects represented as points in the transform space. An advantage of a transform-space index is that optimization of spatial join algorithms using these indexes can be more formal. The authors earlier proposed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c49d8ee1b39e5ec9052a59185e5c248
https://doi.org/10.1016/j.jss.2004.10.012
https://doi.org/10.1016/j.jss.2004.10.012
Autor:
Youngmin Kim, Jung W. Suh
When we know the tools we use, we can better utilize them and maximize their usage. When programming c-mex , we must have a firm understanding of how data is passed between MATLAB and c-mex functions. Without knowing exactly how this occurs, we most
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40fd674c8d9c01d2d4e58628196546a8
https://doi.org/10.1016/b978-0-12-408080-5.00004-3
https://doi.org/10.1016/b978-0-12-408080-5.00004-3
Autor:
Lata Narayanan, Danny Krizanc
Publikováno v:
SPDP
We consider the problem of sorting an input of size n/sup 2/ with keys restricted to the set {0,1} on a n /spl times/ n mesh-connected computer. We present a deterministic algorithm that runs in 2.25n + o(n) steps, requires small constant size queues
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fc29b517e04cf0633f6888787986d240
https://doi.org/10.1142/s0129626495000138
https://doi.org/10.1142/s0129626495000138
Autor:
Qian-Ping Gu, Jun Gu
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 5:308-315
We give three new parallel sorting algorithms on a mesh-connected computer with wraparound connections (i.e. a torus). These three algorithms, with the minimum queue size of 1, sort n/sup 2/ random input data items into a blocked snakelike row major
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a6195b204bb69c94d6c7a50e00cef60f
https://doi.org/10.1109/71.277787
https://doi.org/10.1109/71.277787
Publikováno v:
2010 The 2nd Conference on Environmental Science and Information Application Technology.
In this paper data bedding and data tiling based on quadtree of Diamonds is used to organize the spherical DEM data. The DEM data is subdivided into different resolution layer according to the quadtree partition of Diamonds in horizontal direction, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c50d3baed30b3625ed1f9452ac4db358
https://doi.org/10.1109/esiat.2010.5568510
https://doi.org/10.1109/esiat.2010.5568510
Autor:
Ekow Otoo, Doron Rotem
Publikováno v:
CLUSTER
Datasets used in scientific and engineering applications are often modeled as dense multi-dimensional arrays. For very large datasets, the corresponding array models are typically stored out-of-core as array files. The array elements are mapped onto
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28bfbd2c39a5998e9925804e85f90e65
https://doi.org/10.1109/clustr.2007.4629214
https://doi.org/10.1109/clustr.2007.4629214
Autor:
Kichun Kim
Publikováno v:
IPPS/SPDP
This paper proposes a new memory system called shuffle memory. The shuffle memory is a generalization of transposition memory that has been widely used in 2-D Discrete Cosine Transform and Discrete Fourier Transform. The shuffle memory is the first m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::550bff239d525ae0b58ac881b7b92192
https://doi.org/10.1109/ipps.1999.760475
https://doi.org/10.1109/ipps.1999.760475