سند علمی

Efficient Large-Scale Graph Processing on Hybrid CPU and GPU Systems

چکیده

The increasing scale and wealth of inter-connected data, such as those accrued by social network applications, demand the design of new techniques and platforms to efficiently derive actionable knowledge from large-scale graphs. However, large real-world graphs are famously difficult to process efficiently. Not only they have a large memory footprint, but also most graph algorithms entail memory access patterns with poor locality, data-dependent parallelism and a low compute-to-memory access ratio. To complicate matters further, most real-world graphs have a highly heterogeneous node degree distribution, hence partitioning these graphs for parallel processing and simultaneously achieving access locality and load-balancing is difficult if not impossible.

اسناد مشابه

  • A Hybrid CPU-GPU System for Stitching of Large Scale Optical Microscopy Images

    سند علمی۲۰۱۴Timothy Blattner, Walid Keyrouz

    Researchers in various fields are using optical microscopy to acquire very large images, 10 000–200 000 of pixels per side. Optical microscopes acquire these images as grids of overlapping partial images (thousands of pixels per side) that are then stitched together via software.

  • Blocked United Algorithm for the All-Pairs Shortest Paths Problem on Hybrid CPU-GPU Systems

    سند علمی۲۰۱۲IEICE TransactionsKazuya Matsumoto, Naohito Nakasato, Stanislav G. Sedukhin

    This paper presents a blocked united algorithm for the allpairs shortest paths (APSP) problem. This algorithm simultaneously computes both the shortest-path distance matrix and the shortest-path construction matrix for a graph. It is designed for a high-speed APSP solution on hyb

  • A scalable approach to solving dense linear algebra problems on hybrid CPU-GPU systems

    سند علمی۲۰۱۵Concurrency and Computation: Practice and ExperienceFengguang Song, Jack J. Dongarra

    Aiming to fully exploit the computing power of all CPUs and all GPUs on hybrid CPU-GPU systems to solve dense linear algebra problems, we design a class of heterogeneous tile algorithms to maximize the degree of parallelism, to minimize the communication volume, as well as to acc

  • Solving 3D incompressible Navier-Stokes equations on hybrid CPU/GPU systems

    سند علمی۲۰۱۴SpringSimYushan Wang, Marc Baboulin, Karl Rupp, Olivier P. Le Maître

    This paper describes a hybrid multicore/GPU solver for the incompressible Navier-Stokes equations with constant coefficients, discretized by the finite difference method. By applying the prediction-projection method, the Navier-Stokes equations are transformed into a combination

  • A Parallel Method for Impulsive Image Noise Removal on Hybrid CPU/GPU Systems

    سند علمی۲۰۱۳ICCSMaría Guadalupe Sánchez, Vicente Vidal, Jordi Bataller, Josep Arnal

    A parallel algorithm for image noise removal is proposed. The algorithm is based on peer group concept and uses a fuzzy metric. An optimization study on the use of the CUDA platform to remove impulsive noise using this algorithm is presented. Moreover, an implementation of the al

  • Masters Thesis: LudoGraph: a Sampling Capable Cloud-Based System for Large-Scale Graph Processing

    سند علمی۲۰۱۳Marcin Biczak

    Growing data size in recent years pose new challenges in efficient processing of these datasets. Small and medium enterprises can not afford to use currently available large-scale solutions such as: supercomputers and large cluster sites. Graph datasets also grow in size and requ