Hypergraph partitioning is used in many problem domains including VLSI design, linear algebra, Boolean satisfiability, and data mining. Most versions of this problem are NP …
Y Xia, P Jiang, G Agrawal - Proceedings of the 25th ACM SIGPLAN …, 2020 - dl.acm.org
A finite-state machine (FSM) is a key component for many important applications, such as Huffman decoding, regular expression matching and HTML tokenization. Due to its inherent …
HM Bahig, KA Fathy - The Journal of Supercomputing, 2021 - Springer
The prefix computation strategy is a fundamental technique used to solve many problems in computer science such as sorting, clustering, and computer vision. A large number of …
Y Xia, P Jiang, G Agrawal - … of the 28th International Conference on …, 2019 - dl.acm.org
Much research work has been done to parallelize loops with recurrences over the last several decades. Recently, sampling-and-reconstruction method was proposed to …
A Maximo - Digital Signal Processing, 2021 - Elsevier
This work presents strategies to massively parallelize recursive filters on inputs of one dimension (1D) or three dimensions (3D), complementing and improving on previous state …
W Bielecki, P Błaszyński - Electronics, 2021 - mdpi.com
In this article, we present a technique that allows us to generate parallel tiled code to calculate general linear recursion equations (GLRE). That code deals with multidimensional …
Graphs are a natural model for representing binary relations. However, it is difficult to use graphs to capture non-binary relations such as communities of nodes. For example, graphs …
There has been a significant amount of research works on accelerating irregular applications with GPUs. However, we observed two significant scalability issues with GPU …
In this article, we present a technique that allows us to generate parallel tiled code to calculate general linear recursion equations (GLRE). That code deals with multidimensional …