DocumentCode
1810973
Title
Memory-efficient and fast enumeration of global states
Author
Andrzejak, Artur
Author_Institution
Zuse Inst. Berlin, Germany
fYear
2003
fDate
16-18 July 2003
Firstpage
189
Lastpage
193
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Visualization, 2003. IV 2003. Proceedings. Seventh International Conference on
Print_ISBN
0-7695-1988-1
Type
conf
DOI
10.1109/IV.2003.1217978
Filename
1217978
Link To Document