First, when memcached gets full, it will start removing items from the cache using the Least Recently Used algorithm. Second, you can have multiple instances of memcached running, adding them gets complicated because it will change the hashing algorithm used to determine which cache the data is in. Think of it this way. If you have one cache with items 1-100 in it and add a second cache, most clients are going to spread the items out between the instances. As this is a very crude example, let's assume that every even numbered item is placed in cache 2 and every odd numbered item in cache 1. When you add a second cache and notify the client that it now has two caches, every request for an even numbered item will fail the first time. Even though the item may exist in Cache 1, the client is looking for it in cache 2.
Does that help? Josef On Wed, Nov 19, 2008 at 4:42 AM, Jitendra <[EMAIL PROTECTED]> wrote: > > Hi, > We are planning to implement memcached as part of our project.As the > data is huge, we are expecting it will go beyond the size of cache. So > how can we know that the cache is full, hence we can start another > instance of memcache. > > Regards > Jitendra -- "If you see a whole thing - it seems that it's always beautiful. Planets, lives... But up close a world's all dirt and rocks. And day to day, life's a hard job, you get tired, you lose the pattern." Ursula K. Le Guin http://www.finsel.com/words,-words,-words.aspx (My blog) - http://www.finsel.com/photo-gallery.aspx (My Photogallery) - http://www.reluctantdba.com/dbas-and-programmers/blog.aspx (My Professional Blog)
