A multi-pattern string matching algorithm is a procedure for finding all occurrences of any of a set of text strings in a block of text.
Published in Chapter:
Massively Threaded Digital Forensics Tools
Lodovico Marziale (University of New Orleans, USA), Santhi Movva (Wayne State University, USA), Golden G. Richard III (University of New Orleans, USA), Vassil Roussev (University of New Orleans, USA), and Loren Schwiebert (Wayne State University, USA)
Copyright: © 2010
|Pages: 23
DOI: 10.4018/978-1-60566-836-9.ch010
Abstract
Digital forensics comprises the set of techniques to recover, preserve, and examine digital evidence, and has applications in a number of important areas, including investigation of child exploitation, identity theft, counter-terrorism, and intellectual property disputes. Digital forensics tools must exhaustively examine and interpret data at a low level, because data of evidentiary value may have been deleted, partially overwritten, obfuscated, or corrupted. While forensics investigation is typically seen as an off-line activity, improving case turnaround time is crucial, because in many cases lives or livelihoods may hang in the balance. Furthermore, if more computational resources can be brought to bear, we believe that preventative network security (which must be performed on-line) and digital forensics can be merged into a common research focus. In this chapter we consider recent hardware trends and argue that multicore CPUs and Graphics Processing Units (GPUs) offer one solution to the problem of maximizing available compute resources.