Abstract:
Finite state machines (FSMs) are basic computation models that play essential roles in many applications. Enabling efficient parallel FSM execution is critical to the per...Show MoreMetadata
Abstract:
Finite state machines (FSMs) are basic computation models that play essential roles in many applications. Enabling efficient parallel FSM execution is critical to the performance of these applications. However, they are very challenging to parallelize due to their inherent data dependencies that occur at each step of computations.
Published in: 2016 International Conference on Parallel Architecture and Compilation Techniques (PACT)
Date of Conference: 11-15 September 2016
Date Added to IEEE Xplore: 01 December 2016
ISBN Information:
Contents 