Abstract
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 improvements to the performance of string searching techniques. As string searching 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.
| Original language | English |
|---|---|
| Pages | 67-78 |
| Number of pages | 12 |
| Publication status | Published - 20 Sept 2016 |
| Event | 11th International Conference on Systematic Approaches to Digital Forensics Engineering 2016 - Kyoto, Japan Duration: 20 Sept 2016 → 22 Sept 2016 |
Conference
| Conference | 11th International Conference on Systematic Approaches to Digital Forensics Engineering 2016 |
|---|---|
| Abbreviated title | SADFE 2016 |
| Country/Territory | Japan |
| City | Kyoto |
| Period | 20/09/16 → 22/09/16 |
Keywords
- Digital forensics
- String searching
- GPGPU
- GPU
- IGP
- Parallel programming
Fingerprint
Dive into the research topics of 'Using multiple GPUs to accelerate string searching for digital forensic analysis'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver