Challenging the "embarrassingly sequential"
Zhijia Zhao, Bo Wu, Xipeng Shen · 2014
Finite-State Machine (FSM) applications are important for many domains. But FSM computation is inherently sequential, making such applications notoriously difficult to parallelize. Most prior methods address the problem through speculations on simple heuristics, offering limited applicability and inconsistent speedups.