Midlands State University Library

High-performance quadtree constructions on large-scale geospatial rasters using GPGPU parallel primitives (Record no. 160700)

MARC details
000 -LEADER
fixed length control field 02006nam a22002417a 4500
003 - CONTROL NUMBER IDENTIFIER
control field ZW-GwMSU
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20221201150227.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 221201b |||||||| |||| 00| 0 eng d
040 ## - CATALOGING SOURCE
Original cataloging agency MSU
Transcribing agency MSU
Description conventions rda
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Zhang, Jianting
Relator term author
245 10 - TITLE STATEMENT
Title High-performance quadtree constructions on large-scale geospatial rasters using GPGPU parallel primitives
Statement of responsibility, etc. created by Jianting Zhang &Simin You
264 ## - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture New York:
Name of producer, publisher, distributor, manufacturer Taylor & Francis,
Date of production, publication, distribution, manufacture, or copyright notice 2013.
336 ## - CONTENT TYPE
Source rdacontent
Content type term text
Content type code txt
337 ## - MEDIA TYPE
Source rdamedia
Media type term unmediated
Media type code n
338 ## - CARRIER TYPE
Source rdacarrier
Carrier type term volume
Carrier type code nc
440 ## - SERIES STATEMENT/ADDED ENTRY--TITLE
Volume/sequential designation Volume , number ,
520 ## - SUMMARY, ETC.
Summary, etc. The increasingly available graphics processing units (GPU) hardware and the emerging general purpose computing on GPU (GPGPU) technologies provide an attractive solution to high-performance geospatial computing. In this study, we have proposed a parallel, primitive-based approach to quadtree construction by transforming a multidimensional geospatial computing problem into chaining a set of generic parallel primitives that are designed for one-dimensional (1D) arrays. The proposed approach is largely data-independent and can be efficiently implemented on GPGPUs. Experiments on 4096*4096 and 16384*16384 raster tiles have shown that the implementation can complete the quadtree constructions in 13.33 ms and 250.75 ms, respectively, on average on an NVidia GPU device. Compared with an optimized serial CPU implementation based on the traditional recursive depth-first search (DFS) tree traversal schema that requires 1191.87 ms on 4096*4096 raster tiles, a significant speedup of nearly 90X has been observed. The performance of the GPU-based implementation also suggests that an indexing rate in the order of more than one billion raster cells per second can be achieved on commodity GPU devices.<br/><br/>
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element spatial indexing
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element geographic information systems
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element GPGPU
856 ## - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1080/13658816.2013.828840
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Library of Congress Classification
Koha item type Journal Article
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Shelving location Date acquired Serial Enumeration / chronology Total Checkouts Full call number Date last seen Copy number Price effective from Koha item type Public note
    Library of Congress Classification     Main Library Main Library - Special Collections 14/01/2014 Vol 27 .Nos.11-12 pages 2207-2226   G70.2 INT 01/12/2022 SP17880 01/12/2022 Journal Article For Inhouse use only