tag:blogger.com,1999:blog-8898949683610477251.post-33032798411494915122007-12-25T09:37:00.000Z2007-12-25T09:37:00.000ZCool! I'm as we speak creating a distributed caching and searching system which uses JGroups for membership. The biggest problem I faced was this exact thing. What to do on the member-joined/leaved events and for the system to be able to know at all times to which node to send what command :)<BR/><BR/>The caching system is strictly following the Map (and SortedMap) interface and a bunch of implementations have been implemented. LFU, LRU, MRU, Diskbased B+Tree (jdbm), ehcache wrapper, memcached java client wrapper, hibernate support... <BR/>I like the Map interface since it is quite clean..<BR/><BR/>The impl I'm working on now is a cache/persister which uses HDFS as persistance layer. See how that turns out. The line between a cache and a persistence engine is fine.<BR/><BR/>And of course all caches must be searchable = My own indexer/searcher + Lucene free text index/search, ohh and all must be able to work in a distributed environment.. fuck it is a big task.Marcushttp://www.blogger.com/profile/04583770009623026697noreply@blogger.com