A Comparative Study of Large Automata Distributed Processing

Abstract

We enter bigdata domain when we face data that are so much large that they cannot fit in one machine, or the processing cannot fit in one machine RAM, or would last. We focus our study on large NFAs. We describe, implement and compare two solutions of NFA determinization. These novel solutions are based on two different distributed and parallel programing paradigms, namely MapReduce and BSP/Pregel. Running examples are provided with details on execution. This contribution belongs to the first stages of our main target consisting of a language of a high level for big and distributed graph programming.