Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Omer Anjum"'
Publikováno v:
Information Sciences. 586:326-343
Stencil computation patterns are the backbone of many scientific and engineering simulations. The stencil computation is known to be constrained by its high demand of memory bandwidth, which limits performance on accelerators such as GPUs. Prior GPU-
Autor:
Qiang Wei, Xu Zuo, Omer Anjum, Yan Hu, Ryan Denlinger, Elmer V. Bernstam, Martin J Citardi, Hua Xu
Publikováno v:
2022 IEEE International Conference on Big Data (Big Data).
Autor:
Tanitpong Lawphongpanich, Tianyi Tang, Jinjun Xiong, Shuchen Zhang, Omer Anjum, Sanjay J. Patel, Chak Ho Chan, Wen-mei W. Hwu, Yucheng Liang
Publikováno v:
CSCW Companion
Online communication platforms like Slack and Microsoft teams have become increasingly crucial for a digitized workplace to improve business efficiency and growth. However, these chat platforms can overwhelm the users with unstructured long streams o
Autor:
Mert Hidayetoglu, Wen-mei W. Hwu, Mohammad Almasri, Carl Pearson, I-Hsin Chung, Omer Anjum, Jinjun Xiong
Publikováno v:
IPDPS Workshops
High-performance distributed computing systems increasingly feature nodes that have multiple CPU sockets and multiple GPUs. The communication bandwidth between these components is non-uniform. Furthermore, these systems can expose different communica
Autor:
Mohammad Almasri, Jinjun Xiong, Carl Pearson, Rakesh Nagi, Vikram Sharma Mailthody, Zaid Qureshi, Omer Anjum, Wen-mei W. Hwu
Publikováno v:
HPEC
In this paper, we present an update to our previous submission on k-truss decomposition from Graph Challenge 2018. For single k k-truss implementation, we propose multiple algorithmic optimizations that significantly improve performance by up to 35.2
Autor:
Rakesh Nagi, Jinjun Xiong, Wen-mei W. Hwu, Mohammad Almasri, Zaid Qureshi, Carl Pearson, Omer Anjum, Vikram Sharma Mailthody
Publikováno v:
HPEC
This work presents an update to the triangle-counting portion of the subgraph isomorphism static graph challenge. This work is motivated by a desire to understand the impact of CUDA unified memory on the triangle-counting problem. First, CUDA unified
Publikováno v:
HPCC/SmartCity/DSS
Stencils are a family of widely used computational patterns that play a critical role in various scientific and engineering applications. Stencil computations are known to be memory-bandwidth bound, thus a number of different techniques and algorithm
Publikováno v:
EMNLP/IJCNLP (1)
Finding the right reviewers to assess the quality of conference submissions is a time consuming process for conference organizers. Given the importance of this step, various automated reviewer-paper matching solutions have been proposed to alleviate
We focus on implementing and optimizing a sixth-order finite-difference solver for simulating compressible fluids on a GPU using third-order Runge-Kutta integration. Since graphics processing units perform well in data-parallel tasks, this makes them
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6447febb27a7194df1058f667b5e7ce5
Publikováno v:
Journal of Signal Processing Systems. 78:257-265
This research work presents the design and the physical implementation of a power aware FFT core for OFDM-based, dynamic spectrum access (DSA) enabled cognitive radios. The FFT core is equipped with a pruning engine that allows the run-time removal o