检索结果-内蒙古大学图书馆

Towards Communication-Efficient out-of-core Graph processing on the GPU

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2025年第5期36卷 961-976页

作者： Wang, Qiange Ai, Xin Yan, Yongze Gong, Shufeng Zhang, Yanfeng Chen, Jing Yu, Ge Northeastern Univ Sch Comp Sci & Engn Shenyang 110819 Peoples R China

The key performance bottleneck of large-scale graph processing on memory-limited GPUs is the host-GPU graph data transfer. Existing GPU-accelerated graph processing frameworks address this issue by managing the active subgraph transfer at runtime. Some frameworks adopt explicit transfer management approaches based on explicit memory copy with filter or compaction. In contrast, others adopt implicit transfer management approaches based on on-demand accesses with the zero-copy mechanism or unified virtual memory. Having made intensive analysis, we find that as the active vertices evolve, the performance of the two approaches varies in different workloads. Due to heavy redundant data transfers, high CPU compaction overhead, or low bandwidth utilization, adopting a single approach often results in suboptimal performance. Moreover, these methods lack effective cache management methods to address the irregular and sparse memory access pattern of graph processing. In this work, we propose a hybrid transfer management approach that takes the merits of both two transfer approaches at runtime. Moreover, we present an efficient vertex-centric graph caching framework that minimizes CPU-GPU communication by caching frequently accessed graph data at runtime. Based on these techniques, we present HytGraph, a GPU-accelerated graph processing framework, which is empowered by a set of effective task-scheduling optimizations to improve performance. Experiments on real-world and synthetic graphs show that HytGraph achieves average speedups of 2.5 x, 5.0 x, and 2.0 x compared to the state-of-the-art GPU-accelerated graph processing systems, Grus, Subway, and EMOGI, respectively.

关键词： Graphics processing units Public transportation Memory management Iterative methods Data transfer Costs Runtime Partitioning algorithms Bandwidth Parallel processing GPU graph processing communication reduction transfer management out-of-core processing

来源：评论

学校读者我要写书评

暂无评论

ISP: An Optimal out-of-core Image-Set processing Streaming Architecture for Parallel Heterogeneous Systems

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2012年第6期18卷 838-851页

作者： Ha, Linh Khanh Krueger, Jens Dihl Comba, Joao Luiz Silva, Claudio T. Joshi, Sarang Univ Utah Sci Imaging & Comp Inst 72 S Cent Campus DrWEBRoom 3692 Salt Lake City UT 84112 USA Univ Saarland D-66123 Saarbrucken Germany Univ Fed Rio Grande do Sul Inst Informat BR-91501970 Porto Alegre RS Brazil NYU Polytech Inst Metrotech Ctr 6 Brooklyn NY 11201 USA

Image population analysis is the class of statistical methods that plays a central role in understanding the development, evolution, and disease of a population. However, these techniques often require excessive computational power and memory that are compounded with a large number of volumetric inputs. Restricted access to supercomputing power limits its influence in general research and practical applications. In this paper we introduce ISP, an Image-Set processing streaming framework that harnesses the processing power of commodity heterogeneous CPU/GPU systems and attempts to solve this computational problem. In ISP, we introduce specially designed streaming algorithms and data structures that provide an optimal solution for out-of-core multiimage processing problems both in terms of memory usage and computational efficiency. ISP makes use of the asynchronous execution mechanism supported by parallel heterogeneous systems to efficiently hide the inherent latency of the processing pipeline of out-of-core approaches. Consequently, with computationally intensive problems, the ISP out-of-core solution can achieve the same performance as the in-core solution. We demonstrate the efficiency of the ISP framework on synthetic and real datasets.

关键词： GPUs out-of-core processing atlas construction diffeomorphism multiimage processing framework

来源：评论

学校读者我要写书评

暂无评论

Interactive Editing of Massive Imagery Made Simple: Turning Atlanta into Atlantis

引用

ACM TRANSACTIONS ON GRAPHICS 2011年第2期30卷 7-1-7-13页

作者： Summa, Brian Scorzelli, Giorgio Jiang, Ming Bremer, Peer-Timo Pascucci, Valerio Univ Utah Sci Comp & Imaging Inst Salt Lake City UT 84112 USA Lawrence Livermore Natl Lab Livermore CA 94551 USA

This article presents a simple framework for progressive processing of high-resolution images with minimal resources. We demonstrate this framework's effectiveness by implementing an adaptive, multi-resolution solver for gradient-based image processing that, for the first time, is capable of handling gigapixel imagery in real time. With our system, artists can use commodity hardware to interactively edit massive imagery and apply complex operators, such as seamless cloning, panorama stitching, and tone mapping. We introduce a progressive Poisson solver that processes images in a purely coarse-to-fine manner, providing near instantaneous global approxi-mations for interactive display (see Figure 1). We also allow for data-driven adaptive refinements to locally emulate the effects of a global solution. These techniques, combined with a fast, cache-friendly data access mechanism, allow the user to interactively explore and edit massive imagery, with the illusion of having a full solution at hand. In particular, we demonstrate the interactive modification of gigapixel panoramas that previously required extensive offline processing. Even with massive satellite images surpassing a hundred gigapixels in size, we enable repeated interactive editing in a dynamically changing environment. Images at these scales are significantly beyond the purview of previous methods yet are processed interactively using our techniques. Finally our system provides a robust and scalable out-of-core solver that consistently offers high-quality solutions while maintaining strict control over system resources.

关键词： Algorithms Design Performance Poisson equation gradient domain editing gigapixel images out-of-core processing cache-oblivious data layout

来源：评论

学校读者我要写书评

暂无评论

Time and Energy Performance of Parallel Systems with Hierarchical Memory

引用

JOURNAL OF GRID COMPUTING 2016年第1期14卷 153-170页

作者： Marszalkowski, Jedrzej M. Drozdowski, Maciej Marszalkowski, Jakub Poznan Univ Tech Inst Comp Sci Piotrowo 2 PL-60965 Poznan Poland

In this paper we analyze the impact of memory hierarchies on time-energy trade-off in parallel computations. Contemporary computing systems have deep memory hierarchies with significantly different speeds and power consumptions. This results in nonlinear phenomena in the processing time and energy usage emerging when the size of the computation is growing. In this paper the nonlinear dependence of the time and energy on the size of the solved problem is formalized and verified using measurements in practical computer systems. Then it is applied to formulate a problem of minimum time and minimum energy scheduling parallel processing of divisible loads. Divisible load theory is a scheduling and performance model of data-parallel applications. Mathematical programming is exploited to solve the scheduling problem. A trade-off between energy and schedule length is analyzed and again nonlinear relationships between these two criteria are observed. Further performance analysis reveals that energy consumption and schedule length are ruled by a complex interplay between the costs and speeds of on-core and out-of-core computations, communication delays, and activating new machines.

关键词： Time-energy trade-off Divisible loads Parallel computations Hierarchical memory out-of-core processing

来源：评论

学校读者我要写书评

暂无评论

Fast content-aware video length reduction

引用

SIGNAL IMAGE AND VIDEO processing 2014年第7期8卷 1383-1397页

作者： Chang, Hsing-Ching Yang, Chuan-Kai Chungyu Inst Technol Dept Informat Management Keelung Taiwan Natl Taiwan Univ Sci & Technol Dept Informat Management Taipei Taiwan

Video length reduction has become a very important research issue in recent years. Numerous approaches have been developed, but each has its limitations, such as fragmented results, lengthy computation time, and huge memory consumption. The main contribution of this paper is to propose a new approach that addresses all three mentioned limitations in one shot. First, by modifying the dynamic programming approach originally adopted in Avidan et al.'s work, the proposed approach extracts smooth 2D sheets and thus avoids fragmentations. Second, unlike Chen et al.'s graph-cut algorithm, this approach is much simpler and could achieve similar results but with a speed that is about two orders of magnitude faster. Third, the memory consumption is also greatly reduced to be one order of magnitude smaller. Finally and most importantly, an out-of-core scheme is also proposed, which generalizes this approach to be able to cope with videos of any lengths. Results are shown and compared with existing approaches to demonstrate the effectiveness of the proposed approach.

关键词： Video length reduction Video carving Graph-cut Dynamic programming out-of-core processing

来源：评论

学校读者我要写书评

暂无评论

Masked photo blending: Mapping dense photographic data set on high-resolution sampled 3D models

引用

COMPUTERS & GRAPHICS-UK 2008年第4期32卷 464-473页

作者： Callieri, M. Cignoni, P. Corsini, M. Scopigno, R. CNR ISTI I-56100 Pisa Italy

The technological advance of sensors is producing an exponential size growth of the data coming from 3D scanning and digital photography. The production of digital 3D models consisting of tens or even hundreds of millions of triangles is quite easy nowadays;at the same time, using high-resolution digital cameras it is also straightforward to produce a set of pictures of the same real object totalling more than 50M pixel. The problem is how to manage all this data to produce 3D models that could fit the interactive rendering constraints. A common approach is to go for mesh parametrization and texture synthesis, but finding a parametrization for such large meshes and managing such large textures can be prohibitive. Moreover, digital photo sampling produces highly redundant data;this redundancy should be eliminated while mapping to the 3D model but, at the same time, should also be efficiently used to improve the sampled data coherence and the appearance representation accuracy. In this paper we present an approach where a multivariate blending function weights all the available pixel data with respect to geometric, topological and colorimetric criteria. The blending approach proposed is efficient, since it mostly works independently on each image, and can be easily extended to include other image quality estimators. The resulting weighted pixels are then selectively mapped on the geometry. preferably by adopting a multiresolution per-vertex encoding to make profitable use of all the data available and to avoid the texture size bottleneck. Some practical examples on complex data sets are presented. (C) 2008 Elsevier Ltd. All rights reserved.

关键词： 3D scanned models image inverse projection texture mapping blending function multiresolution encoding interactive rendering out-of-core processing

来源：评论

学校读者我要写书评

暂无评论

On-the-fly simplification of large iso-surfaces with per-cube vertex modifiability detection

引用

JOURNAL OF VISUALIZATION 2016年第4期19卷 715-726页

作者： Hou, Tao Chen, Li Tsinghua Univ Sch Software Beijing Peoples R China VMware Informat Technol China Co Ltd Beijing Peoples R China

Marching Cubes based iso-surface extraction is widely used for data visualization. However, the increasing size of volume sets has made extracted iso-surfaces difficult to manipulate, and applying out-of-core simplification on them is considerably slow. We present an on-the-fly simplification algorithm for out-of-core iso-surfaces generated by Marching Cubes based extraction. Our algorithm shifts between extraction and decimation during the processing of volume sets, and never stores the entire extracted iso-surface in the main memory. The key of our algorithm is that we exploit the extraction pattern of Marching Cubes to determine when the mesh operator can be applied on certain generated vertices. This enables the decimation to be applied after any specified number of triangles are extracted. It also provides a framework for on-the-fly processing of large iso-surfaces. Our algorithm is more efficient than cascading out-of-core extraction and simplification, while providing high simplification quality comparable to in-core algorithms.

关键词： Iso-surface simplification On-the-fly processing out-of-core processing Volumeset visualization

来源：评论

学校读者我要写书评

暂无评论

Enabling the interactive display of large medical volume datasets by multiresolution bricking

引用

JOURNAL OF SUPERCOMPUTING 2010年第1期51卷 3-19页

作者： Agrawal, Anupam Kohout, Josef Clapworthy, Gordon J. McFarlane, Nigel J. B. Dong, Feng Viceconti, Marco Taddei, Fulvia Testi, Debora Univ Bedfordshire Dept Comp Sci & Technol Luton Beds England Ist Ortoped Rizzoli Lab Tecnol Med Bologna Italy SCS BioComp Competence Ctr Casalecchio Di Reno Italy

In this paper, we present an approach to interactive out-of-core volume data exploration that has been developed to augment the existing capabilities of the LhpBuilder software, a core component of the European project LHDL ( http://***/biomed_town/lhdl ). The requirements relate to importing, accessing, visualizing and extracting a part of a very large volume dataset by interactive visual exploration. Such datasets contain billions of voxels and, therefore, several gigabytes are required just to store them, which quickly surpass the virtual address limit of current 32-bit PC platforms. We have implemented a hierarchical, bricked, partition-based, out-of-core strategy to balance the usage of main and external memories. A new indexing scheme is introduced, which permits the use of a multiresolution bricked volume layout with minimum overhead and also supports fast data compression. Using the hierarchy constructed in a pre-processing step, we generate a coarse approximation that provides a preview using direct volume visualization for large-scale datasets. A user can interactively explore the dataset by specifying a region of interest (ROI), which further generates a much more accurate data representation inside the ROI. If even more precise accuracy is needed inside the ROI, nested ROIs are used. The software has been constructed using the Multimod Application Framework, a VTK-based system;however, the approach can be adopted for the other systems in a straightforward way. Experimental results show that the user can interactively explore large volume datasets such as the Visible Human Male/Female (with file sizes of 3.15/12.03 GB, respectively) on a commodity graphics platform, with ease.

关键词： Medical visualization Large volume data sets out-of-core processing Multiresolution bricking VTK

来源：评论

学校读者我要写书评

暂无评论

A hardware-assisted scalable solution for interactive volume rendering of time-varying data

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2002年第3期8卷 286-301页

作者： Lum, EB Ma, KL Clyne, J Univ Calif Davis CIPIC Davis CA 95616 USA Univ Calif Davis Dept Comp Sci Davis CA 95616 USA Natl Ctr Atmospher Res Boulder CO 80303 USA

We present a scalable volume rendering technique that exploits lossy compression and low-cost commodity hardware to permit highly interactive exploration of time-varying scalar volume data. A palette-based decoding technique and an adaptive bit allocation scheme are developed to fully utilize the texturing capability of a commodity 3D graphics card. Using a single PC equipped with a modest amount of memory, a texture capable graphics card, and an inexpensive disk array, we are able to render hundreds of time steps of regularly gridded volume data (up to 42 million voxels each time step) at interactive rates. By clustering multiple PCs together, we demonstrate the data-size scalability of our method. The frame rates achieved make possible the interactive exploration of data in the temporal, spatial, and transfer function domains. A comprehensive evaluation of our method based on experimental studies using data sets (up to 134 million voxels per time step) from turbulence flow simulations is also presented.

关键词： compression disk I/O high performance computing out-of-core processing parallel rendering PC scalable algorithms scientific visualization texture hardware time-varying data transform encoding volume rendering

来源：评论

学校读者我要写书评

暂无评论

GO: out-Of-core Partitioning of Large Irregular Graphs 15

GO: Out-Of-Core Partitioning of Large Irregular Graphs

引用

15th IEEE International Conference on Networking, Architecture and Storage (NAS)

作者： Kaur, Gurneet Gupta, Rajiv UC Riverside CSE Dept Riverside CA 92521 USA

ISBN: (纸本)9781728177441

Single-PC, disk-based processing of large irregular graphs has recently gained much popularity. At the core of a disk-based system is a static graph partitioning that must be created before the processing starts. By handling one partition at a time, graphs that do not fit in memory are processed on a single machine. However, the multilevel graph partitioning algorithms used by the most sophisticated partitioners cannot be run on the same machine as their memory requirements far exceed the size of the graph. The popular memory efficient Mt-Metis graph partitioner requires 4.8x to 13.8x the memory needed to hold the entire graph in memory. To overcome this problem, we present the GO out-of-core graph partitioner that can successfully partition large graphs on a single machine. GO performs just two passes over the entire input graph, partition creation pass that creates balanced partitions and partition refinement pass that reduces edgecuts. Both passes function in a memory constrained manner via disk-based processing. GO successfully partitions large graphs for which Mt-Metis runs out of memory. For graphs that can be successfully partitioned by Mt-Metis on a single machine, GO produces balanced 8-way partitions with 11.8x to 76.2x fewer edgecuts using 1.9x to 8.3x less memory in comparable runtime.

关键词： irregular graphs out-of-core processing multilevel graph partitioning

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：