This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh International Conference on Information Visualization (IV'03)
Memory-Efficient and Fast Enumeration of Global States
London, England
July 16-July 18
ISBN: 0-7695-1988-1
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 [1].
Citation:
Artur Andrzejak, "Memory-Efficient and Fast Enumeration of Global States," iv, pp.189, Seventh International Conference on Information Visualization (IV'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.