high_scalability high_scalability-2009 high_scalability-2009-482 knowledge-graph by maker-knowledge-mining
Source: html
Introduction: While working with Memcache the other night, it dawned on me that it’s usage as a distributed caching mechanism was really just one of many ways to use it. That there are in fact many alternative usages that one could find for Memcache if they could just realize what Memcache really is at its core – a simple distributed hash-table – is an important point worthy of further discussion. To be clear, when I say “simple”, by no means am I implying that Memcache’s implementation is simple, just that the ideas behind it are such. Think about that for a minute. What else could we use a simple distributed hash-table for, besides caching? How about using it as an alternative to the traditional shard lookup method we used in our Master Index Lookup scalability strategy, discussed previously here.
sentIndex sentText sentNum sentScore
1 While working with Memcache the other night, it dawned on me that it’s usage as a distributed caching mechanism was really just one of many ways to use it. [sent-1, score-1.139]
2 That there are in fact many alternative usages that one could find for Memcache if they could just realize what Memcache really is at its core – a simple distributed hash-table – is an important point worthy of further discussion. [sent-2, score-1.987]
3 To be clear, when I say “simple”, by no means am I implying that Memcache’s implementation is simple, just that the ideas behind it are such. [sent-3, score-0.607]
4 What else could we use a simple distributed hash-table for, besides caching? [sent-5, score-0.817]
5 How about using it as an alternative to the traditional shard lookup method we used in our Master Index Lookup scalability strategy, discussed previously here. [sent-6, score-1.244]
wordName wordTfidf (topN-words)
[('memcache', 0.47), ('lookup', 0.284), ('dawned', 0.271), ('usages', 0.271), ('alternative', 0.232), ('implying', 0.221), ('simple', 0.217), ('besides', 0.202), ('worthy', 0.202), ('discussed', 0.152), ('night', 0.135), ('previously', 0.133), ('could', 0.13), ('method', 0.129), ('realize', 0.129), ('caching', 0.126), ('distributed', 0.124), ('mechanism', 0.122), ('shard', 0.116), ('index', 0.103), ('master', 0.098), ('else', 0.096), ('fact', 0.095), ('traditional', 0.093), ('really', 0.089), ('ways', 0.088), ('clear', 0.088), ('implementation', 0.088), ('ideas', 0.087), ('usage', 0.085), ('strategy', 0.083), ('behind', 0.079), ('core', 0.073), ('say', 0.07), ('working', 0.069), ('many', 0.069), ('important', 0.065), ('means', 0.062), ('find', 0.058), ('point', 0.055), ('one', 0.048), ('use', 0.048), ('think', 0.048), ('scalability', 0.042), ('used', 0.038), ('using', 0.025)]
simIndex simValue blogId blogTitle
same-blog 1 1.0 482 high scalability-2009-01-04-Alternative Memcache Usage: A Highly Scalable, Highly Available, In-Memory Shard Index
Introduction: While working with Memcache the other night, it dawned on me that it’s usage as a distributed caching mechanism was really just one of many ways to use it. That there are in fact many alternative usages that one could find for Memcache if they could just realize what Memcache really is at its core – a simple distributed hash-table – is an important point worthy of further discussion. To be clear, when I say “simple”, by no means am I implying that Memcache’s implementation is simple, just that the ideas behind it are such. Think about that for a minute. What else could we use a simple distributed hash-table for, besides caching? How about using it as an alternative to the traditional shard lookup method we used in our Master Index Lookup scalability strategy, discussed previously here.
2 0.20816198 927 high scalability-2010-10-26-Marrying memcached and NoSQL
Introduction: Memcached is one of the most common In-Memory cache implementation. It was originally developed by Danga Interactive for LiveJournal , but is now used by many other sites as a side cache to speed up read mostly operations. It gained popularity in the non-Java world, too, especially since it’s a language-neutral side cache for which few alternatives existed. As a side-cache, Memcache clients relies on the database as the system of record, The database is still used for write,update and complex query operations. Since the memcached specification includes no query operations, memcached is not a database alternative, unlike most of the NoSQL offerings. It also exclude memcache from being a real solution for write scalability. As a result of that many of the heavy sites started to move away from Memcache and replace it with other NoSQL alternatives as noted in a recent highscalability post MySQL And Memcached: End Of An Era? The transition away from memcached to NoSQL
3 0.17576584 294 high scalability-2008-04-01-How to update video views count effectively?
Introduction: Hi, I am building a video-sharing site and I'm looking for an efficient way to update video views count. The easiest way would be to perform an SQL update to increase the "views" counter every time a video is viewed, but naturally I want to avoid DB write access as much as possible. I am looking for an efficient temporary storage to which I could connect and say "increment views of video X". Every so often I would save the changes to my main database, and remove the counter from this temporary storage. I am having a hard time finding such temporary storage, however. My first thought was memcache, but it's not ideal as I wouldn't like to lose the data if memcache goes down. Also, memcache's increment command requires that the key is already present - that means that every time a video is viewed, I would have to check if the key already exists in memcache, before I can actually send the increment command. What do people use to solve this kind of issues? Kind regar
4 0.14652771 1126 high scalability-2011-09-27-Use Instance Caches to Save Money: Latency == $$$
Introduction: In the post Using memcache might be free, but it's costing you money with instance pricing! Use instance caches if possible made on the Google App Engine group, Santiago Lema brings up an oldie but a goody of an idea that was once used to improve performance, but now it's used to save money : Santiago's GAE application went from about $9 to about $177 per month. Memcache is slow enough that under higher loads extra instances are created by the scheduler to handle the load. For static or semi-static data, a way around the cost of the extra instances, is to keep a cache in the instance so requests can be served out of local memory rather than going to memcache or the database. A simple hashtable makes a good in-memory cache. This solution made his app affordable again by reducing the number of instances back to 1 (sometimes 2). Where have we seen this before? This is a variant of the old Sticky Session idea where web sessions are stored in RAM in an application ser
5 0.14364046 1135 high scalability-2011-10-31-15 Ways to Make Your Application Feel More Responsive under Google App Engine
Introduction: Small Imrovements , makers of a hosted, lightweight feedback platform, have written an excellent article on Performance issues on GAE, and how we resolved them . They show how they trimmed most of their requests to between 300ms and 800ms, some still take 2 seconds when memcache is stale, and others clock in at 150ms. Not zippy overall, but acceptable, especially if you really like GAE's PaaS promise. What's tricky with PaaS is if your performance is poor, there's often not a lot you can do about it. But the folks at Small Improvements have been clever and diligent, giving many specific details and timings. Though their advice is specifically for GAE, it will apply to a lot of different situations as well. Here are the 15 ways they made small performance improvements: Understand App Engine has bad days . App Engine can have bad days where performance can degrade. Your design needs to take this potential for high latency variability into account. Don't always assume the bes
6 0.14216456 1440 high scalability-2013-04-15-Scaling Pinterest - From 0 to 10s of Billions of Page Views a Month in Two Years
7 0.13316941 577 high scalability-2009-04-22-Gear6 Web cache - the hardware solution for working with Memcache
8 0.12081449 1558 high scalability-2013-12-04-How Can Batching Requests Actually Reduce Latency?
9 0.10009778 828 high scalability-2010-05-17-7 Lessons Learned While Building Reddit to 270 Million Page Views a Month
10 0.0971613 1331 high scalability-2012-10-02-An Epic TripAdvisor Update: Why Not Run on the Cloud? The Grand Experiment.
11 0.091045752 313 high scalability-2008-05-02-Friends for Sale Architecture - A 300 Million Page View-Month Facebook RoR App
12 0.090010636 290 high scalability-2008-03-28-How to Get DNS Names of a Web Server
13 0.088407665 672 high scalability-2009-08-06-An Unorthodox Approach to Database Design : The Coming of the Shard
14 0.085539646 1106 high scalability-2011-08-26-Stuff The Internet Says On Scalability For August 26, 2011
15 0.08507549 152 high scalability-2007-11-13-Flickr Architecture
16 0.084917828 52 high scalability-2007-08-01-Product: Memcached
17 0.084251329 1151 high scalability-2011-12-05-Stuff The Internet Says On Scalability For December 5, 2011
18 0.081555009 840 high scalability-2010-06-10-The Four Meta Secrets of Scaling at Facebook
19 0.081171244 805 high scalability-2010-04-06-Strategy: Make it Really Fast vs Do the Work Up Front
20 0.080647647 367 high scalability-2008-08-17-Strategy: Drop Memcached, Add More MySQL Servers
topicId topicWeight
[(0, 0.102), (1, 0.075), (2, -0.039), (3, -0.03), (4, 0.027), (5, 0.022), (6, -0.022), (7, -0.036), (8, -0.008), (9, -0.008), (10, 0.005), (11, 0.019), (12, -0.033), (13, 0.05), (14, -0.016), (15, -0.017), (16, -0.029), (17, -0.032), (18, 0.04), (19, -0.035), (20, -0.015), (21, 0.022), (22, -0.002), (23, 0.031), (24, -0.053), (25, 0.012), (26, 0.014), (27, 0.004), (28, -0.038), (29, 0.048), (30, -0.007), (31, -0.003), (32, -0.031), (33, 0.003), (34, -0.003), (35, -0.011), (36, 0.018), (37, -0.034), (38, 0.024), (39, -0.038), (40, 0.014), (41, 0.059), (42, -0.015), (43, -0.074), (44, -0.006), (45, -0.008), (46, -0.025), (47, 0.03), (48, 0.049), (49, -0.018)]
simIndex simValue blogId blogTitle
same-blog 1 0.94645441 482 high scalability-2009-01-04-Alternative Memcache Usage: A Highly Scalable, Highly Available, In-Memory Shard Index
Introduction: While working with Memcache the other night, it dawned on me that it’s usage as a distributed caching mechanism was really just one of many ways to use it. That there are in fact many alternative usages that one could find for Memcache if they could just realize what Memcache really is at its core – a simple distributed hash-table – is an important point worthy of further discussion. To be clear, when I say “simple”, by no means am I implying that Memcache’s implementation is simple, just that the ideas behind it are such. Think about that for a minute. What else could we use a simple distributed hash-table for, besides caching? How about using it as an alternative to the traditional shard lookup method we used in our Master Index Lookup scalability strategy, discussed previously here.
2 0.64028537 337 high scalability-2008-05-31-memcached and Storage of Friend list
Introduction: My first post, please be gentle. I know it is long. You are all like doctors - the more info, the better the diagnosis. ----------- What is the best way to store a list of all of your friends in the memcached cache (a simple boolean saying “yes this user is your friend”, or “no”)? Think Robert Scoble (26,000+ “friends”) on Twitter.com. He views a list of ALL existing users, and in this list, his friends are highlighted. I came up with 4 possible methods: --store in memcache as an array, a list of all the "yes" friend ID's --store your friend ID's as individual elements. --store as a hash of arrays based on last 3 digits of friend's ID -- so have up to 1000 arrays for you. --comma-delimited string of ID's as one element I'm using the second one because I think it is faster to update. The single array or hash of arrays feels like too much overhead calculating and updating – and even just loading – to check for existence of a friend. The key is FRIEND[small ID#]_
3 0.63511497 602 high scalability-2009-05-17-Scaling Django Web Apps by Mike Malone
Introduction: Film buffs will recognize Django as a classic 1966 spaghetti western that spawned hundreds of imitators. Web heads will certainly first think of Django as the classic Python based Web framework that has also spawned hundreds of imitators and has become the gold standard framework for the web. Mike Malone, who worked on Pownce, a blogging tool now owned by Six Apart, tells in this very informative EuroDjangoCon presentation how Pownce scaled using Django in the real world. I was surprised to learn how large Pounce was: hundreds of requests/sec, thousands of DB operations/sec, millions of user relationships, millions of notes, and terabytes of static data. Django has a lot of functionality in the box to help you scale, but if you want to scale large it turns out Django has some limitations and Mike tells you what these are and also provides some code to get around them. Mike's talk-although Django specific--will really help anyone creating applications on the web. There's
4 0.63325411 708 high scalability-2009-09-17-Infinispan narrows the gap between open source and commercial data caches
Introduction: Recently I attended a lecture presented by Manik Surtani , JBoss Cache & Infinispan project lead. The goal of the talk was to provide a technical overview of both products and outline Infinispan's road-map. Infinispan is the successor to the open-source JBoss Cache. JBoss Cache was originally targeted at simple web page caching and Infinispan builds on this to take it into the Cloud paradigm. Why did I attend? Well, over the past few years I have worked on projects that have used commercial distributed caching (aka data grid) technologies such as GemFire, GigaSpaces XAP or Oracle Coherence . These projects required more functionality than is currently provided by open-source solutions such as memcached or EHCache. Looking at the road-map for Infinispan, I was struck by its ambition – will it provide the functionality that I need? Read more at: http://bigdatamatters.com/bigdatamatters/2009/09/infinispan-vs-gigaspaces.html
5 0.63024598 673 high scalability-2009-08-07-Strategy: Break Up the Memcache Dog Pile
Introduction: Update: Asynchronous HTTP cache validations . A proposed HTTP caching extension: if your application can afford to show slightly out of date content, then stale-while-revalidate can guarantee that the user will always be served directly from the cache, hence guaranteeing a consistent response-time user-experience. Caching is like aspirin for headaches. Head hurts: pop a 'sprin. Slow site: add caching. Facebook must have a lot of headaches because they popped 805 memcached servers between 10,000 web servers and 1,800 MySQL servers and they reportedly have a 99% cache hit rate. But what's the best way for you to cache for your application? It's a remarkably complex and rich topic. Alexey Kovyrin talks about one common caching problem called the Dog Pile Effect in Dog-pile Effect and How to Avoid it with Ruby on Rails . Glenn Franxman also has a Django solution in MintCache . Data is usually cached because it's too expensive to calculate for every hit. Maybe it's a gnarly S
6 0.61386991 1633 high scalability-2014-04-16-Six Lessons Learned the Hard Way About Scaling a Million User System
7 0.61359596 247 high scalability-2008-02-12-We want to cache a lot :) How do we go about it ?
8 0.61228311 360 high scalability-2008-08-04-A Bunch of Great Strategies for Using Memcached and MySQL Better Together
9 0.61143255 978 high scalability-2011-01-26-Google Pro Tip: Use Back-of-the-envelope-calculations to Choose the Best Design
10 0.61059797 367 high scalability-2008-08-17-Strategy: Drop Memcached, Add More MySQL Servers
11 0.61035848 927 high scalability-2010-10-26-Marrying memcached and NoSQL
12 0.60039449 152 high scalability-2007-11-13-Flickr Architecture
13 0.60029483 1135 high scalability-2011-10-31-15 Ways to Make Your Application Feel More Responsive under Google App Engine
14 0.59530401 345 high scalability-2008-06-11-Pyshards aspires to build sharding toolkit for Python
15 0.59429604 353 high scalability-2008-07-20-Strategy: Front S3 with a Caching Proxy
16 0.59169483 514 high scalability-2009-02-18-Numbers Everyone Should Know
17 0.58970904 359 high scalability-2008-07-29-Ehcache - A Java Distributed Cache
18 0.58225906 149 high scalability-2007-11-12-Scaling Using Cache Farms and Read Pooling
19 0.58198971 1395 high scalability-2013-01-28-DuckDuckGo Architecture - 1 Million Deep Searches a Day and Growing
20 0.58134156 703 high scalability-2009-09-12-How Google Taught Me to Cache and Cash-In
topicId topicWeight
[(1, 0.131), (2, 0.158), (40, 0.427), (61, 0.076), (79, 0.065)]
simIndex simValue blogId blogTitle
1 0.90161377 402 high scalability-2008-10-05-Paper: Scalability Design Patterns
Introduction: I have introduced pattern languages in my earlier post on The Pattern Bible for Distributed Computing . Achieving highest possible scalability is a complex combination of many factors. This PLoP 2007 paper presents a pattern language that can be used to make a system highly scalable. The Scalability Pattern Language introduced by Kanwardeep Singh Ahluwalia includes patterns to: Introduce Scalability Optimize Algorithm Add Hardware Add Parallelism Add Intra-Process Parallelism Add Inter-Porcess Parallelism Add Hybrid Parallelism Optimize Decentralization Control Shared Resources Automate Scalability
2 0.90058881 338 high scalability-2008-06-02-Total Cost of Ownership for different web development frameworks
Introduction: I would like to compile a comparison matrix on the total cost of ownership for .Net, Java, Lamp & Rails. Where should I start? Has anyone seen or know of a recent study on this subject?
3 0.87931371 27 high scalability-2007-07-25-Product: 3 PAR REMOTE COPY
Introduction: 3PAR Remote Copy is a uniquely simple and efficient replication technology that allows customers to protect and share any application data affordably. Built upon 3PAR Thin Copy technology, Remote Copy lowers the total cost of storage by addressing the cost and complexity of remote replication. Common Uses of 3PAR Remote Copy: Affordable Disaster Recovery: Mirror data cost-effectively across town or across the world. Centralized Archive: Replicate data from multiple 3PAR InServs located in multiple data centers to a centralized data archive location. Resilient Pod Architecture: Mutually replicate tier 1 or 2 data to tier 3 capacity between two InServs (application pods). Remote Data Access: Replicate data to a remote location for sharing of data with remote users.
4 0.87324417 1419 high scalability-2013-03-07-It's a VM Wasteland - A Near Optimal Packing of VMs to Machines Reduces TCO by 22%
Introduction: In Algorithm Design for Performance Aware VM Consolidation we learn some shocking facts (gambling in Casablanca?): Average server utilization in many data centers is low, estimated between 5% and 15%. This is wasteful because an idle server often consumes more than 50% of peak power. Surely that's just for old style datacenters? Nope. In Google data centers, workloads that are consolidated use only 50% of the processor cores. Every other processor core is left unused simply to ensure that performance does not degrade. It's a VM wasteland. The goal is to reduce waste by packing VMs onto machines without hurting performance or wasting resources. The idea is to select VMs that interfere the least with each other and places them together on the same server. It's a NP-Complete problem, but this paper describes a practical method that performs provably close to the optimal. Interestingly they can optimize for performance or power efficiency, so you can use different algorithm
5 0.86402446 860 high scalability-2010-07-17-Hot Scalability Links for July 17, 2010
Introduction: And by hot I also mean temperature. Summer has arrived. It's sizzling here in Silicon Valley. Thank you air conditioning! Scale the web by appointing a Crawler Czar? Tom Foremski has the idea that Google should open up their index so sites wouldn't have to endure the constant pounding by ravenous crawler bots. Don MacAskill of SmugMug estimates 50% of our web server CPU resources are spent serving crawlers. What a waste. How this would all work with real-time feeds, paid feeds (Twitter, movies, ...), etc. is unknown, but does it make sense for all that money to be spent on extracting the same data over and over again? Tweets of Gold: jamesurquhart : Key to applications is architecture. Key for infrastructure supporting archs is configurability. Configurability==features . tjake : People who choose their datastore based oh hearsay and not their own evaluation are doomed . b6n : No global lock ever goes unpunished. MichaelSurt
6 0.85064095 1466 high scalability-2013-05-29-Amazon: Creating a Customer Utopia One Culture Hack at a Time
same-blog 7 0.81455809 482 high scalability-2009-01-04-Alternative Memcache Usage: A Highly Scalable, Highly Available, In-Memory Shard Index
8 0.79642683 330 high scalability-2008-05-27-Should Twitter be an All-You-Can-Eat Buffet or a Vending Machine?
9 0.79586923 1471 high scalability-2013-06-06-Paper: Memory Barriers: a Hardware View for Software Hackers
10 0.79550421 778 high scalability-2010-02-15-The Amazing Collective Compute Power of the Ambient Cloud
11 0.77493632 1414 high scalability-2013-03-01-Stuff The Internet Says On Scalability For February 29, 2013
12 0.76727539 848 high scalability-2010-06-25-Hot Scalability Links for June 25, 2010
14 0.75261205 300 high scalability-2008-04-07-Scalr - Open Source Auto-scaling Hosting on Amazon EC2
15 0.72224355 879 high scalability-2010-08-12-Think of Latency as a Pseudo-permanent Network Partition
16 0.70850158 768 high scalability-2010-02-01-What Will Kill the Cloud?
17 0.69695127 757 high scalability-2010-01-04-11 Strategies to Rock Your Startup’s Scalability in 2010
18 0.66645694 1492 high scalability-2013-07-17-How do you create a 100th Monkey software development culture?
19 0.64674556 97 high scalability-2007-09-18-Session management in highly scalable web sites
20 0.62571037 564 high scalability-2009-04-10-counting # of views, calculating most-least viewed