Cloud computing landscape and research challenges regarding trust and reputation

SM Habib, S Ries, M Muhlhauser - 2010 7th International …, 2010 - ieeexplore.ieee.org
Cloud Computing is an emerging computing paradigm. It shares massively scalable, elastic
resources (eg, data, calculations, and services) transparently among the users over a …

Learning to super-resolve blurry face and text images

X Xu, D Sun, J Pan, Y Zhang… - Proceedings of the …, 2017 - openaccess.thecvf.com
We present an algorithm to directly restore a clear high-resolution image from a blurry low-
resolution input. This problem is highly ill-posed and the basic assumptions for existing …

Pannotia: Understanding irregular GPGPU graph applications

S Che, BM Beckmann, SK Reinhardt… - 2013 IEEE …, 2013 - ieeexplore.ieee.org
GPUs have become popular recently to accelerate general-purpose data-parallel
applications. However, most existing work has focused on GPU-friendly applications with …

Gunrock: GPU graph analytics

Y Wang, Y Pan, A Davidson, Y Wu, C Yang… - ACM Transactions on …, 2017 - dl.acm.org
For large-scale graph analytics on the GPU, the irregularity of data access and control flow,
and the complexity of programming GPUs, have presented two significant challenges to …

AmgX: A library for GPU accelerated algebraic multigrid and preconditioned iterative methods

M Naumov, M Arsaev, P Castonguay, J Cohen… - SIAM Journal on …, 2015 - SIAM
The solution of large sparse linear systems arises in many applications, such as
computational fluid dynamics and oil reservoir simulation. In realistic cases the matrices are …

Characterization and analysis of dynamic parallelism in unstructured GPU applications

J Wang, S Yalamanchili - 2014 IEEE International Symposium …, 2014 - ieeexplore.ieee.org
GPUs have been proven very effective for structured applications. However, emerging data
intensive applications are increasingly unstructured-irregular in their memory and control …

High-performance parallel graph coloring with strong guarantees on work, depth, and quality

M Besta, A Carigiet, K Janda… - … Conference for High …, 2020 - ieeexplore.ieee.org
We develop the first parallel graph coloring heuristics with strong theoretical guarantees on
work and depth and coloring quality. The key idea is to design a relaxation of the vertex …

Dynamic thread block launch: A lightweight execution mechanism to support irregular applications on gpus

J Wang, N Rubin, A Sidelnik… - ACM SIGARCH Computer …, 2015 - dl.acm.org
GPUs have been proven effective for structured applications that map well to the rigid 1D-3D
grid of threads in modern bulk synchronous parallel (BSP) programming languages …

Laperm: Locality aware scheduler for dynamic parallelism on gpus

J Wang, N Rubin, A Sidelnik… - ACM SIGARCH Computer …, 2016 - dl.acm.org
Recent developments in GPU execution models and architectures have introduced dynamic
parallelism to facilitate the execution of irregular applications where control flow and …

Increasing the parallelism of graph coloring via shortcutting

G Alabandi, E Powers, M Burtscher - Proceedings of the 25th ACM …, 2020 - dl.acm.org
Graph coloring is an assignment of colors to the vertices of a graph such that no two
adjacent vertices get the same color. It is a key building block in many applications. Finding …