search

nunofaria11 / ugl-uminho-cpd

Automatically exported from code.google.com/p/ugl-uminho-cpd
0 stars 0 forks source link

Undirected caching neighbors graph #7

Open GoogleCodeExporter opened 9 years ago

GoogleCodeExporter commented 9 years ago 
Try to create a graph that for each accessed vertex, a parallel thread reads 
the neighbor edges and "touches" the opposite vertices so that it is already in 
cache in case it needs to be accessed.

Original issue reported on code.google.com by nunofari...@gmail.com on 6 Jan 2011 at 3:22

GoogleCodeExporter commented 9 years ago 
The solution would go through predictive caching mechanisms I think

Original comment by nunofari...@gmail.com on 6 Jan 2011 at 5:03

GoogleCodeExporter commented 9 years ago 
[deleted comment]
GoogleCodeExporter commented 9 years ago 
"Touching" probably will not be enough: a caching mechanism is needed. 

However, I have no idea on how a graph structure would consult this cache, OR 
if it would read the cache at all... study about this

Original comment by nunofari...@gmail.com on 6 Jan 2011 at 6:24