July 16, 2003 to July 18, 2003
Artur Andrzejak , Zuse Institute Berlin (ZIB)
We describe a simple algorithm for level-wise enumeration of the global states of a distributed computation. In addition to fast execution, it requires working memory for only two global states plus a variable amount of memory which permits the trading of higher speed for storage. Furthermore, we present a new caching strategy that speeds up the state enumeration algorithm described in .
Artur Andrzejak, "Memory-Efficient and Fast Enumeration of Global States", IV, 2003, 2013 17th International Conference on Information Visualisation, 2013 17th International Conference on Information Visualisation 2003, pp. 189, doi:10.1109/IV.2003.1217978