Multi-threaded queuing system for pattern matching

A computer-implemented method to process data units in a computer system, comprising:

• determining a remaining capacity of the input data buffer,
• storing the one or more data units in an input data buffer,
• determining, in a fast path, if the input data units include at least a portion of a pattern, which, potentially, matches with at least one of predetermined pattern, and create one or more jobs if there exist a potential match, each of the one or more jobs associated with an input data unit and including at least data, instructions, and state information;
• allocating the one or more jobs for execution, using a job pool arbiter, while providing a job state to be stored in a job pool,
• sending a first request to a bus master to receive instructions to enable processing of the jobs;
• sending a second request to a control block to cause the one or more input data units in the input data buffer that are associated with the jobs to be provided to the job pool;
• processing jobs in a slow path, which includes a plurality of execution units,
• sharing the input data buffer between the fast path and the slow path to avoid copying the input data units for which a potential match exists.