loading...
 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
ASCII Text
x 
 
Artur Andrzejak, "Memory-Efficient and Fast Enumeration of Global States," Information Visualisation, International Conference on, pp. 189, Seventh International Conference on Information Visualization (IV'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/IV.2003.1217978,
author = {Artur Andrzejak},
title = {Memory-Efficient and Fast Enumeration of Global States},
journal ={Information Visualisation, International Conference on},
volume = {0},
year = {2003},
issn = {1093-9547},
pages = {189},
doi = {http://doi.ieeecomputersociety.org/10.1109/IV.2003.1217978},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Information Visualisation, International Conference on
TI - Memory-Efficient and Fast Enumeration of Global States
SN - 1093-9547
SP
EP
A1 - Artur Andrzejak,
PY - 2003
KW - null
VL - 0
JA - Information Visualisation, International Conference on
ER -
 
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.