9,898 Hits in 3.2 sec

Hybrid Data-Parallel Contour Tree Computation [article]

Hamish Carr, Christopher Sewell, Li-Ta Lo, James Ahrens
2016 Computer Graphics and Visual Computing (CGVC)  
We report the first data-parallel algorithm for computing the fully augmented contour tree, using a quantised computation model.  ...  We then extend this to provide a hybrid data-parallel / distributed algorithm allowing scaling beyond a single GPU or CPU, and provide results for its computation.  ...  Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, under Award Number 14-017566 (XVis).  ... 
doi:10.2312/cgvc.20161299 dblp:conf/tpcg/CarrSLA16 fatcat:lunbxv2udbbptmfrjg4p3cai7q

A hybrid parallel algorithm for computing and tracking level set topology

Senthilnathan Maadasamy, Harish Doraiswamy, Vijay Natarajan
2012 2012 19th International Conference on High Performance Computing  
We describe a work-efficient, output sensitive, and scalable parallel algorithm for computing the contour tree of a scalar field defined on a domain that is represented using either an unstructured mesh  ...  A hybrid implementation of the algorithm using the GPU and multi-core CPU can compute the contour tree of an input containing 16 million vertices in less than ten seconds with a speedup factor of upto  ...  tree computation time for small data sets.  ... 
doi:10.1109/hipc.2012.6507496 dblp:conf/hipc/MaadasamyDN12 fatcat:4amqgeq2pjeqla7ves7eu6cifu

Hybrid Parallel Extraction of Isosurface Components from 3D Rectilinear Volume Data

Bong-Soo SOHN
2011 IEICE transactions on information and systems  
the contour, and (iii) parallel utilization of a many-core GPU for computing the geometries of a contour surface in each active cell using CUDA.  ...  Our work coupled with the Contour Tree framework is useful for quickly segmenting, displaying, and analyzing a feature of interest in 3D rectilinear volume data without being distracted by other features  ...  Conclusion We described a hybrid parallel algorithm that efficiently ex- tracts an isosurface component from 3D rectilinear volume data.  ... 
doi:10.1587/transinf.e94.d.2553 fatcat:2jen6cqvwzahjlmugemmjky6aa

Parallel peak pruning for scalable SMP contour tree computation

Hamish A. Carr, Gunther H. Weber, Christopher M. Sewell, James P. Ahrens
2016 2016 IEEE 6th Symposium on Large Data Analysis and Visualization (LDAV)  
While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with  ...  We report the first shared SMP algorithm for fully parallel contour tree computation, with formal guarantees of O(lg n lgt) parallel steps and O(n lg n) work, and implementations with up to 10× parallel  ...  BACKGROUND Since the goal of this work is to use data-parallel computation to construct an algorithm for contour tree computation, we split relevant prior work between data-parallel computation (Section  ... 
doi:10.1109/ldav.2016.7874312 dblp:conf/ldav/CarrWSA16 fatcat:kcdenoqb45bqfedwepn7alweca

Data Parallel Hypersweeps for in Situ Topological Analysis

Petar Hristov, Gunther H. Weber, Hamish A. Carr, Oliver Rubel, James P. Ahrens
2020 2020 IEEE 10th Symposium on Large Data Analysis and Visualization (LDAV)  
Recent work has built efficient contour tree algorithms for shared memory parallel computation, driven by the need to analyze large data sets in situ while the simulation is running.  ...  The contour tree is a tool for understanding the topological structure of a scalar field.  ...  , and in the future in hybrid clusters with heavy on-node data parallelism.  ... 
doi:10.1109/ldav51489.2020.00008 fatcat:au3zyvn5gnf2bn6ewv6yw34cji

Combining in-situ and in-transit processing to enable extreme-scale scientific analysis

Janine C. Bennett, Hasan Abbasi, Peer-Timo Bremer, Ray Grout, Attila Gyulassy, Tong Jin, Scott Klasky, Hemanth Kolla, Manish Parashar, Valerio Pascucci, Philippe Pebay, David Thompson (+3 others)
2012 2012 International Conference for High Performance Computing, Networking, Storage and Analysis  
We demonstrate the efficiency of our lightweight, flexible framework by deploying it on the Jaguar XK6 to analyze data generated by S3D, a massively parallel turbulent combustion code.  ...  With the onset of extreme-scale computing, I/O constraints make it increasingly difficult for scientists to save a sufficient amount of raw simulation data to persistent storage.  ...  In a distributed setting, the computation of a merge tree is inherently not data-parallel due to complex communication costs.  ... 
doi:10.1109/sc.2012.31 dblp:conf/sc/BennettABGGJKKPPPTYZC12 fatcat:f3wyhi5khzgmfphpdpx7skvyoq

Unordered Task-Parallel Augmented Merge Tree Construction

Kilian Werner, Christoph Garth
2021 IEEE Transactions on Visualization and Computer Graphics  
This is achieved by a task-parallel identification of individual merge tree arcs by growing regions around critical points in the data, without any need for ordered progression or global data structures  ...  However, none of these recent approaches computed complete merge trees on distributed systems, leaving this field to traditional divide and conquer approaches.  ...  Contour Tree Computation The abundant efforts in parallel contour tree construction have created a varied landscape of algorithms with different strengths, weaknesses and target hardware architectures.  ... 
doi:10.1109/tvcg.2021.3076875 pmid:33929962 fatcat:uk3uruyfpzch5ameoq2mrmsi2m

Task-based Augmented Contour Trees with Fibonacci Heaps [article]

Charles Gueunet, J Jomier, J Tierny
2019 arXiv   pre-print
In contrast to most existing parallel algorithms our technique computes augmented trees, enabling the full extent of contour tree based applications including data segmentation.  ...  This includes a new computation procedure based on Fibonacci heaps for the join and split trees, two intermediate data structures used to compute the contour tree, whose constructions are efficiently carried  ...  processing time during the parallel contour tree computation (512 3 grid).  ... 
arXiv:1902.04805v1 fatcat:vld6jh7iv5gi3jw7qxgkrm4h4a

Task-based Augmented Contour Trees with Fibonacci Heaps

Charles Gueunet, Pierre Fortin, Julien Tierny, Julien Jomier
2019 IEEE Transactions on Parallel and Distributed Systems  
processing time during the parallel contour tree computation (512 3 grid).  ...  TASK-BASED PARALLEL CONTOUR TREES As described in Sec. I-A, an important use case for the merge tree is the computation of the contour tree.  ... 
doi:10.1109/tpds.2019.2898436 fatcat:acggevv3xfclngp5vdohszxk7a

Task-based augmented merge trees with Fibonacci heaps

Charles Gueunet, Pierre Fortin, Julien Jomier, Julien Tierny
2017 2017 IEEE 7th Symposium on Large Data Analysis and Visualization (LDAV)  
In the context of augmented contour tree computation, we show that a direct usage of our merge tree procedure also results in superior time performance overall, both in sequential and parallel.  ...  In contrast to most existing parallel algorithms, our technique computes augmented trees.  ...  Parallel augmented contour trees: We show how to use our merge tree procedure for the computation of augmented contour trees.  ... 
doi:10.1109/ldav.2017.8231846 dblp:conf/ldav/GueunetFJT17 fatcat:caf6x3vh5ff2xmca4xaftfkqei

Building large urban environments from unstructured point data

Florent Lafarge, Clement Mallet
2011 2011 International Conference on Computer Vision  
We present a robust method for modeling cities from unstructured point data.  ...  Our algorithm provides a more complete description than existing approaches by reconstructing simultaneously buildings, trees and topologically complex grounds.  ...  The parallelization scheme allows us to reach a good approximation of the solution while significantly reducing the computing times on a 8-core computer compared to standard techniques as shown in Tab.  ... 
doi:10.1109/iccv.2011.6126353 dblp:conf/iccv/LafargeM11 fatcat:pnds7hyptzhgfjmpjgo7sgysbm

Computing Contour Trees for 2D Piecewise Polynomial Functions

Girijanandan Nucha, Georges-Pierre Bonneau, Stefanie Hahmann, Vijay Natarajan
2017 Computer graphics forum (Print)  
Contour trees are extensively used in scalar field analysis. The contour tree is a data structure that tracks the evolution of level set topology in a scalar field.  ...  We propose an algorithm to compute the contour tree for such functions.  ...  Our focus is on the computation of contour trees.  ... 
doi:10.1111/cgf.13165 fatcat:x5ipjtn2sneqpbiln3lh4po2fu

Optimization and Augmentation for Data Parallel Contour Trees

Hamish Carr, Oliver Rubel, Gunther H Weber, James Ahrens
2021 IEEE Transactions on Visualization and Computer Graphics  
Contour trees are used for topological data analysis in scientific visualization. While originally computed with serial algorithms, recent work has introduced a vector-parallel algorithm.  ...  We therefore introduce a representation called the hyperstructure that enables efficient searches through the contour tree and use it to construct a fully augmented contour tree in data parallel, with  ...  This research was supported by the Exascale Computing Project We would also like to thank Julien Tierny for his assistance in setting up the TTK runs for comparison.  ... 
doi:10.1109/tvcg.2021.3064385 pmid:33684039 fatcat:vuuzegvi5vbxtmws2mdsshawby

An Adaptive Lightweight Security Framework Suited for IoT [chapter]

Menachem Domb
2018 Internet of Things - Technology, Applications and Standardization  
We collect historic data and analyze it using machine learning techniques to draw a contour, where all streaming values are expected to fall within the contour space.  ...  The second area involves the implementation of the Random Forest algorithm to apply distributed and parallel processing for anomaly discovery.  ...  [24] proposed the execution in parallel on CPU/GPU hybrids, of the Montgomery algorithm, to improve RSA performance and security.  ... 
doi:10.5772/intechopen.73712 fatcat:hzjyv5jeffgj3fctjobrlbakde

Contour Gradient Tree for Automatic Extraction of Salient Object Surfaces from 3D Imaging Data

Bong-Soo SOHN
2015 IEICE transactions on information and systems  
For this purpose, we propose a contour gradient tree (CGT) that contains the information of salient contours and their saliency magnitude.  ...  This paper describes a novel method for automatically extracting salient contours from volume data.  ...  For efficient mesh extraction and gradient computation, we use hybrid parallelization of multi-core CPUs and many-core GPUs [7] .  ... 
doi:10.1587/transinf.2015edl8137 fatcat:lrooz6di4fblhiaacosrfkzrma
« Previous Showing results 1 — 15 out of 9,898 results