Research indexJournal article
Accelerating the LZ-complexity algorithm
Ratsaby, Timashkov
17 Dec 2023
NobleIDark:/48914/w1/20260525/42AA80C1DOI10.1109/icpads60453.2023.00038
Accelerating the LZ-complexity algorithm
Ratsaby, Timashkov · 2023 · Subscription
NobleIDark:/48914/w1/20260525/42AA80C1DOI10.1109/icpads60453.2023.00038
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
The Lempel Ziv complexity of a string has recently been used in pattern recognition and classification as part of a string distance function. Its main advantage is that it can measure dissimilarity between a pair of strings of different lengths. This is very useful for machine learning on unstructured data since such data is not restricted to a fixed input dimensionality. The standard computation of LZ-complexity is inherently serial and is not suitable for processing large unstructured data. Hence, we propose a parallel algorithm that computes the LZ-complexity of strings whose length is limited only by the amount of memory, typically in the tens of gigabytes. The algorithm is implemented in CUDA on a GPU. Its speed-up factor is approximately n 2/3 for strings of length n, for at least up to n = 2Mb. For instance, on 2Mb strings, the speed-up is 150. We compare the execution times of kernel variants with shared and global memory. The more efficient variant obtains approximately 90% GPU utilization.