Title :
Memory-efficient and fast enumeration of global states
Author :
Andrzejak, Artur
Author_Institution :
Zuse Inst. Berlin, Germany
Abstract :
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 [A. Andrzejak et al., (2003)].
Keywords :
cache storage; computational complexity; distributed processing; optimisation; tree searching; caching strategy; distributed computation; global state; level-wise enumeration; memory requirement; state enumeration algorithm; Communication channels; Debugging; Distributed computing; Fault tolerance; Hardware; History; Lattices;
Conference_Titel :
Information Visualization, 2003. IV 2003. Proceedings. Seventh International Conference on
Print_ISBN :
0-7695-1988-1
DOI :
10.1109/IV.2003.1217978
