String searching within a large corpus of data is an important component of digital forensic (DF) analysis techniques such as file carving. The continuing increase in capacity of consumer storage devices requires corresponding im-provements to the performance of string searching techniques. As string search-ing is a trivially-parallelisable problem, GPGPU approaches are a natural fit – but previous studies have found that local storage presents an insurmountable performance bottleneck. We show that this need not be the case with modern hardware, and demonstrate substantial performance improvements from the use of single and multiple GPUs when searching for strings within a typical forensic disk image.
|Title of host publication||SADFE Proceedings 2016|
|Publisher||Association of Digital Forensics, Security and Law (ADFSL)|
|Number of pages||12|
|Publication status||Published - 22 Sep 2016|
- Digital forensics
- String searching
- Parallel programming