Abstract

A method for partitioning a large computation task (direct, variable resolution bathymetric grid construction from raw observations) into thread-parallel code is described. Based on the data density estimated for the first pass of the chrt algorithm, this algorithm statically partitions the estimation task into spatially distinct blocks of approximately equal total data observation count so that each can be executed in parallel and be expected to complete approximately concurrently. No communication between blocks or further load balancing is therefore required. A branch-and-bound algorithm is used to control the complexity of the partitioning task, but the computation time increases significantly as more partitions are required, leading to a degree of diminishing returns for allocating further computational resources and suggesting alternative approaches for high thread-count systems. Speed-up of the algorithm over a pair of test datasets (using real-world hydrographic survey data) shows that the performance consistently improves with the number of computational tasks assigned, initially (super-) linearly, although ultimately sub-linearly as other resource sharing limitations take over. An overall speedup of 4.1 times is demonstrated with a quad-core single-processor workstation.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.