[algogeeks] Distributed System problem
It is a system design problem . Suppose a http request is sent to server . Now Server maintains cache for fast retrieval . if link is present int the cache then it just takes a data from cache and return it to user but if not , then user will fetch that http address and then store it in its cache and return same to the user . Problem is that there are many server and many global cache as expected in distributed system. Now when request is received by a server then how can we maintain global cache such that server can know which cache to query instead of querying each global cache as it will be inefficient. one approach can be.. maintain 26 global cache . Now when request is received by server it check the web link say , www.*a*bc.com ... here server will query cache-1 . Similarly cache-2 will take care of links with starts from b...www.*b*bc.com and so on above method will avoid duplicity in caches but will not be very efficient as a cache may have higher query rate than others... any other approach ?? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
Re: [algogeeks] Distributed System problem
Then the Domain name is altered from abc to bbc .. That indirectly means that the nameserver will change. So in that case the Cache will point to the New NameServer .. Thanks, Somnath Singh On Sun, Dec 14, 2014 at 2:04 PM, atul anand atul.87fri...@gmail.com wrote: It is a system design problem . Suppose a http request is sent to server . Now Server maintains cache for fast retrieval . if link is present int the cache then it just takes a data from cache and return it to user but if not , then user will fetch that http address and then store it in its cache and return same to the user . Problem is that there are many server and many global cache as expected in distributed system. Now when request is received by a server then how can we maintain global cache such that server can know which cache to query instead of querying each global cache as it will be inefficient. one approach can be.. maintain 26 global cache . Now when request is received by server it check the web link say , www.*a*bc.com ... here server will query cache-1 . Similarly cache-2 will take care of links with starts from b...www.*b*bc.com and so on above method will avoid duplicity in caches but will not be very efficient as a cache may have higher query rate than others... any other approach ?? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
Re: [algogeeks] Distributed System problem
approach i have mentioned have flaws . so what other approaches we can try to solve this ? On Sun, Dec 14, 2014 at 2:23 PM, SOMU somnath.nit...@gmail.com wrote: Then the Domain name is altered from abc to bbc .. That indirectly means that the nameserver will change. So in that case the Cache will point to the New NameServer .. Thanks, Somnath Singh On Sun, Dec 14, 2014 at 2:04 PM, atul anand atul.87fri...@gmail.com wrote: It is a system design problem . Suppose a http request is sent to server . Now Server maintains cache for fast retrieval . if link is present int the cache then it just takes a data from cache and return it to user but if not , then user will fetch that http address and then store it in its cache and return same to the user . Problem is that there are many server and many global cache as expected in distributed system. Now when request is received by a server then how can we maintain global cache such that server can know which cache to query instead of querying each global cache as it will be inefficient. one approach can be.. maintain 26 global cache . Now when request is received by server it check the web link say , www.*a*bc.com ... here server will query cache-1 . Similarly cache-2 will take care of links with starts from b...www.*b*bc.com and so on above method will avoid duplicity in caches but will not be very efficient as a cache may have higher query rate than others... any other approach ?? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
Re: [algogeeks] Largest Rectangle
If anyone have answer to this question, please share it. I need the solution for this prolem. On 2 August 2011 at 19:42, payel roy smithpa...@gmail.com wrote: Given a Binary Matrix of 0's and 1's. Print the largest Sub-matrix with all boundary elements 0. Explain your whole algorithm with an example. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
