high_scalability high_scalability-2010 high_scalability-2010-951 knowledge-graph by maker-knowledge-mining
Source: html
Introduction: Ricky Ho in Scalable System Design Patterns has created a great list of scalability patterns along with very well done explanatory graphics. A summary of the patterns are: Load Balancer - a dispatcher determines which worker instance will handle a request based on different policies. Scatter and Gather - a dispatcher multicasts requests to all workers in a pool. Each worker will compute a local result and send it back to the dispatcher, who will consolidate them into a single response and then send back to the client. Result Cache - a dispatcher will first lookup if the request has been made before and try to find the previous result to return, in order to save the actual execution. Shared Space - all workers monitors information from the shared space and contributes partial knowledge back to the blackboard. The information is continuously enriched until a solution is reached. Pipe and Filter - all workers connected by pipes across which data flows. MapReduc
sentIndex sentText sentNum sentScore
1 Ricky Ho in Scalable System Design Patterns has created a great list of scalability patterns along with very well done explanatory graphics. [sent-1, score-0.373]
2 A summary of the patterns are: Load Balancer - a dispatcher determines which worker instance will handle a request based on different policies. [sent-2, score-1.16]
3 Scatter and Gather - a dispatcher multicasts requests to all workers in a pool. [sent-3, score-1.02]
4 Each worker will compute a local result and send it back to the dispatcher, who will consolidate them into a single response and then send back to the client. [sent-4, score-0.862]
5 Result Cache - a dispatcher will first lookup if the request has been made before and try to find the previous result to return, in order to save the actual execution. [sent-5, score-1.005]
6 Shared Space - all workers monitors information from the shared space and contributes partial knowledge back to the blackboard. [sent-6, score-0.966]
7 The information is continuously enriched until a solution is reached. [sent-7, score-0.267]
8 Pipe and Filter - all workers connected by pipes across which data flows. [sent-8, score-0.692]
9 MapReduce - targets batch jobs where disk I/O is the major bottleneck. [sent-9, score-0.188]
10 It use a distributed file system so that disk I/O can be done in parallel. [sent-10, score-0.15]
11 Bulk Synchronous Parallel - a lock-step execution across all workers, coordinated by a master. [sent-11, score-0.238]
12 Execution Orchestrator - an intelligent scheduler / orchestrator schedules ready-to-run tasks (based on a dependency graph) across a clusters of dumb workers. [sent-12, score-0.943]
wordName wordTfidf (topN-words)
[('dispatcher', 0.582), ('workers', 0.438), ('orchestrator', 0.321), ('worker', 0.175), ('enriched', 0.137), ('explanatory', 0.13), ('ricky', 0.118), ('patterns', 0.116), ('pipes', 0.113), ('consolidate', 0.113), ('targets', 0.103), ('contributes', 0.102), ('coordinated', 0.1), ('send', 0.099), ('back', 0.098), ('schedules', 0.094), ('determines', 0.093), ('dumb', 0.092), ('monitors', 0.09), ('request', 0.088), ('result', 0.087), ('dependency', 0.086), ('scheduler', 0.083), ('partial', 0.081), ('intelligent', 0.079), ('synchronous', 0.079), ('across', 0.078), ('lookup', 0.076), ('done', 0.075), ('disk', 0.075), ('continuously', 0.071), ('actual', 0.063), ('previous', 0.063), ('connected', 0.063), ('execution', 0.06), ('information', 0.059), ('return', 0.059), ('batch', 0.059), ('summary', 0.058), ('clusters', 0.055), ('tasks', 0.055), ('knowledge', 0.054), ('jobs', 0.054), ('along', 0.052), ('graph', 0.051), ('based', 0.048), ('compute', 0.047), ('local', 0.046), ('save', 0.046), ('shared', 0.044)]
simIndex simValue blogId blogTitle
same-blog 1 1.0 951 high scalability-2010-12-01-8 Commonly Used Scalable System Design Patterns
Introduction: Ricky Ho in Scalable System Design Patterns has created a great list of scalability patterns along with very well done explanatory graphics. A summary of the patterns are: Load Balancer - a dispatcher determines which worker instance will handle a request based on different policies. Scatter and Gather - a dispatcher multicasts requests to all workers in a pool. Each worker will compute a local result and send it back to the dispatcher, who will consolidate them into a single response and then send back to the client. Result Cache - a dispatcher will first lookup if the request has been made before and try to find the previous result to return, in order to save the actual execution. Shared Space - all workers monitors information from the shared space and contributes partial knowledge back to the blackboard. The information is continuously enriched until a solution is reached. Pipe and Filter - all workers connected by pipes across which data flows. MapReduc
2 0.24242453 738 high scalability-2009-11-06-Product: Resque - GitHub's Distrubuted Job Queue
Introduction: Queuing work for processing in the background is a time tested scalability strategy . Queuing also happens to be one of those much needed tools where it easy enough to forge for your own that we see a lot of different versions made. Resque is GitHub's take on a job queue and they've used it to process million and millions of jobs so far. What is Resque? Redis-backed library for creating background jobs, placing those jobs on multiple queues, and processing them later. Background jobs can be any Ruby class or module that responds to perform . Your existing classes can easily be converted to background jobs or you can create new classes specifically to do work. Or, you can do both. GitHub tried and considered many other systems: SQS, Starling, ActiveMessaging, BackgroundJob, DelayedJob, beanstalkd, AMQP, and Kestrel, but found them all wanting in one way are another. The latency for SQS was too high. Others didn't make full use of Ruby. Others still had a lot of overhe
3 0.11587621 882 high scalability-2010-08-18-Misco: A MapReduce Framework for Mobile Systems - Start of the Ambient Cloud?
Introduction: Misco: A MapReduce Framework for Mobile Systems is a very exciting paper to me because it's really one of the first explorations of some of the ideas in Building Super Scalable Systems: Blade Runner Meets Autonomic Computing in the Ambient Cloud . What they are trying to do is efficiently distribute work across a set cellphones using a now familiar MapReduce interface. Usually we think of MapReduce as working across large data center hosted clusters. Here, the cluster nodes are cellphones not contained in any data center, but compute nodes potentially distributed everywhere. I talked with Adam Dou , one of the paper's authors, and he said they don't see cellphone clusters replacing dedicated computer clusters, primarily because of the power required for both network communication and the map-reduce computations. Large multi-terabyte jobs aren't in the cards...yet. Adam estimates computationally that cellphones are performing similarly to desktops of ten years ago. Instead, they
4 0.092684112 491 high scalability-2009-01-13-Product: Gearman - Open Source Message Queuing System
Introduction: Update: New Gearman Server & Library in C, MySQL UDFs . Gearman is an open source message queuing system that makes it easy to do distributed job processing using multiple languages. With Gearman you: farm out work to other machines, dispatching function calls to machines that are better suited to do work, to do work in parallel, to load balance lots of function calls, to call functions between languages, spread CPU usage around your network . Gearman is used by companies like LiveJournal, Yahoo!, and Digg. Digg, for example, runs 300,000 jobs a day through Gearman without any issues. Most large sites use something similar. Why would anyone ever even need a message queuing system? Message queuing is a handy way to move work off your web servers (like image manipulation), to generate thousands of documents in the background, to run the multiple requests in parallel needed to build a web page, or to perform tasks that can comfortably be run in the background and not part
5 0.088708229 478 high scalability-2008-12-29-Paper: Spamalytics: An Empirical Analysisof Spam Marketing Conversion
Introduction: Under the philosophy that the best method to analyse spam is to become a spammer , this absolutely fascinating paper recounts how a team of UC Berkely researchers went under cover to infiltrate a spam network. Part CSI, part Mission Impossible, and part MacGyver, the team hijacked the botnet so that their code was actually part of the dark network itself. Once inside they figured out the architecture and protocols of the botnet and how many sales they were able to tally. Truly elegant work. Two different spam campaigns were run on a Storm botnet network of 75,800 zombie computers. Storm is a peer-to-peer botnet that uses spam to creep its tentacles through the world wide computer network. One of the campains distributed viruses in order to recruit new bots into the network. This is normally accomplished by enticing people to download email attachments. An astonishing one in ten people downloaded the executable and ran it, which means we won't run out of zombies soon. The downloade
6 0.082273379 906 high scalability-2010-09-22-Applying Scalability Patterns to Infrastructure Architecture
7 0.071822949 594 high scalability-2009-05-08-Eight Best Practices for Building Scalable Systems
8 0.070559636 1266 high scalability-2012-06-18-Google on Latency Tolerant Systems: Making a Predictable Whole Out of Unpredictable Parts
9 0.066256039 1642 high scalability-2014-05-02-Stuff The Internet Says On Scalability For May 2nd, 2014
10 0.065961391 400 high scalability-2008-10-01-The Pattern Bible for Distributed Computing
11 0.065908298 772 high scalability-2010-02-05-High Availability Principle : Concurrency Control
12 0.063819848 1331 high scalability-2012-10-02-An Epic TripAdvisor Update: Why Not Run on the Cloud? The Grand Experiment.
14 0.059270315 954 high scalability-2010-12-06-What the heck are you actually using NoSQL for?
15 0.058930717 1654 high scalability-2014-06-05-Cloud Architecture Revolution
16 0.058784239 1188 high scalability-2012-02-06-The Design of 99designs - A Clean Tens of Millions Pageviews Architecture
17 0.058552146 897 high scalability-2010-09-08-4 General Core Scalability Patterns
18 0.057655931 1424 high scalability-2013-03-15-Stuff The Internet Says On Scalability For March 15, 2013
19 0.056437962 1112 high scalability-2011-09-07-What Google App Engine Price Changes Say About the Future of Web Architecture
20 0.056211539 1652 high scalability-2014-05-21-9 Principles of High Performance Programs
topicId topicWeight
[(0, 0.079), (1, 0.052), (2, -0.012), (3, 0.008), (4, -0.008), (5, 0.026), (6, 0.039), (7, 0.009), (8, -0.036), (9, 0.001), (10, 0.024), (11, 0.014), (12, 0.015), (13, -0.052), (14, 0.0), (15, -0.016), (16, 0.009), (17, 0.028), (18, 0.025), (19, 0.031), (20, -0.002), (21, -0.02), (22, -0.005), (23, 0.003), (24, 0.007), (25, -0.005), (26, -0.003), (27, 0.049), (28, -0.003), (29, -0.018), (30, 0.004), (31, -0.008), (32, 0.006), (33, 0.038), (34, -0.007), (35, -0.027), (36, 0.008), (37, -0.054), (38, -0.021), (39, -0.001), (40, 0.027), (41, -0.039), (42, -0.024), (43, -0.011), (44, 0.011), (45, 0.005), (46, -0.049), (47, -0.019), (48, 0.011), (49, -0.041)]
simIndex simValue blogId blogTitle
same-blog 1 0.93815804 951 high scalability-2010-12-01-8 Commonly Used Scalable System Design Patterns
Introduction: Ricky Ho in Scalable System Design Patterns has created a great list of scalability patterns along with very well done explanatory graphics. A summary of the patterns are: Load Balancer - a dispatcher determines which worker instance will handle a request based on different policies. Scatter and Gather - a dispatcher multicasts requests to all workers in a pool. Each worker will compute a local result and send it back to the dispatcher, who will consolidate them into a single response and then send back to the client. Result Cache - a dispatcher will first lookup if the request has been made before and try to find the previous result to return, in order to save the actual execution. Shared Space - all workers monitors information from the shared space and contributes partial knowledge back to the blackboard. The information is continuously enriched until a solution is reached. Pipe and Filter - all workers connected by pipes across which data flows. MapReduc
2 0.71067595 491 high scalability-2009-01-13-Product: Gearman - Open Source Message Queuing System
Introduction: Update: New Gearman Server & Library in C, MySQL UDFs . Gearman is an open source message queuing system that makes it easy to do distributed job processing using multiple languages. With Gearman you: farm out work to other machines, dispatching function calls to machines that are better suited to do work, to do work in parallel, to load balance lots of function calls, to call functions between languages, spread CPU usage around your network . Gearman is used by companies like LiveJournal, Yahoo!, and Digg. Digg, for example, runs 300,000 jobs a day through Gearman without any issues. Most large sites use something similar. Why would anyone ever even need a message queuing system? Message queuing is a handy way to move work off your web servers (like image manipulation), to generate thousands of documents in the background, to run the multiple requests in parallel needed to build a web page, or to perform tasks that can comfortably be run in the background and not part
3 0.71063578 738 high scalability-2009-11-06-Product: Resque - GitHub's Distrubuted Job Queue
Introduction: Queuing work for processing in the background is a time tested scalability strategy . Queuing also happens to be one of those much needed tools where it easy enough to forge for your own that we see a lot of different versions made. Resque is GitHub's take on a job queue and they've used it to process million and millions of jobs so far. What is Resque? Redis-backed library for creating background jobs, placing those jobs on multiple queues, and processing them later. Background jobs can be any Ruby class or module that responds to perform . Your existing classes can easily be converted to background jobs or you can create new classes specifically to do work. Or, you can do both. GitHub tried and considered many other systems: SQS, Starling, ActiveMessaging, BackgroundJob, DelayedJob, beanstalkd, AMQP, and Kestrel, but found them all wanting in one way are another. The latency for SQS was too high. Others didn't make full use of Ruby. Others still had a lot of overhe
4 0.68635798 326 high scalability-2008-05-25-Product: Condor - Compute Intensive Workload Management
Introduction: From their website: Condor is a specialized workload management system for compute-intensive jobs. Like other full-featured batch systems, Condor provides a job queueing mechanism, scheduling policy, priority scheme, resource monitoring, and resource management. Users submit their serial or parallel jobs to Condor, Condor places them into a queue, chooses when and where to run the jobs based upon a policy, carefully monitors their progress, and ultimately informs the user upon completion. While providing functionality similar to that of a more traditional batch queueing system, Condor's novel architecture allows it to succeed in areas where traditional scheduling systems fail. Condor can be used to manage a cluster of dedicated compute nodes (such as a "Beowulf" cluster). In addition, unique mechanisms enable Condor to effectively harness wasted CPU power from otherwise idle desktop workstations. For instance, Condor can be configured to only use desktop machines where the keyboard
5 0.67033988 1373 high scalability-2012-12-17-11 Uses For the Humble Presents Queue, er, Message Queue
Introduction: It's a little known fact that Santa Clause was an early queue innovator. Faced with the problem of delivering a planet full of presents in one night, Santa, in his hacker's workshop, created a Present Distribution System using thousands of region based priority present queues for continuous delivery by the Rudolphs. Rudolphs? You didn't think there was only one Rudolph did you? Presents are delivered in parallel by a cluster of sleighs, each with redundant reindeer in a master-master configuration. Each Rudolph is a cluster leader and they coordinate work using an early and more magical version of the ZooKeeper protocol. Programmers have followed Santa's lead and you can find a message queue in nearly every major architecture profile on HighScalability . Historically they may have been introduced after a first generation architecture needed to scale up from their two tier system into something a little more capable (asynchronicity, work dispatch, load buffering, database offloadin
6 0.6529063 897 high scalability-2010-09-08-4 General Core Scalability Patterns
7 0.63785583 406 high scalability-2008-10-08-Strategy: Flickr - Do the Essential Work Up-front and Queue the Rest
8 0.62361801 1421 high scalability-2013-03-11-Low Level Scalability Solutions - The Conditioning Collection
9 0.61485344 850 high scalability-2010-06-30-Paper: GraphLab: A New Framework For Parallel Machine Learning
10 0.60731298 484 high scalability-2009-01-05-Lessons Learned at 208K: Towards Debugging Millions of Cores
11 0.60397637 1138 high scalability-2011-11-07-10 Core Architecture Pattern Variations for Achieving Scalability
12 0.59566152 983 high scalability-2011-02-02-Piccolo - Building Distributed Programs that are 11x Faster than Hadoop
13 0.59520501 1266 high scalability-2012-06-18-Google on Latency Tolerant Systems: Making a Predictable Whole Out of Unpredictable Parts
14 0.5894565 882 high scalability-2010-08-18-Misco: A MapReduce Framework for Mobile Systems - Start of the Ambient Cloud?
15 0.58871192 1136 high scalability-2011-11-03-Paper: G2 : A Graph Processing System for Diagnosing Distributed Systems
16 0.58694649 1408 high scalability-2013-02-19-Puppet monitoring: how to monitor the success or failure of Puppet runs
17 0.58597821 1222 high scalability-2012-04-05-Big Data Counting: How to count a billion distinct objects using only 1.5KB of Memory
18 0.58301955 881 high scalability-2010-08-16-Scaling an AWS infrastructure - Tools and Patterns
19 0.58104932 1229 high scalability-2012-04-17-YouTube Strategy: Adding Jitter isn't a Bug
20 0.58102089 1415 high scalability-2013-03-04-7 Life Saving Scalability Defenses Against Load Monster Attacks
topicId topicWeight
[(1, 0.012), (2, 0.164), (10, 0.048), (21, 0.335), (24, 0.013), (61, 0.08), (77, 0.024), (79, 0.12), (85, 0.037), (94, 0.038)]
simIndex simValue blogId blogTitle
1 0.86584324 22 high scalability-2007-07-23-Weblink Template
Introduction: Information Sources Platform What's Inside? The Stats Lessons Learned To discuss this article please visit the forums at
same-blog 2 0.7766068 951 high scalability-2010-12-01-8 Commonly Used Scalable System Design Patterns
Introduction: Ricky Ho in Scalable System Design Patterns has created a great list of scalability patterns along with very well done explanatory graphics. A summary of the patterns are: Load Balancer - a dispatcher determines which worker instance will handle a request based on different policies. Scatter and Gather - a dispatcher multicasts requests to all workers in a pool. Each worker will compute a local result and send it back to the dispatcher, who will consolidate them into a single response and then send back to the client. Result Cache - a dispatcher will first lookup if the request has been made before and try to find the previous result to return, in order to save the actual execution. Shared Space - all workers monitors information from the shared space and contributes partial knowledge back to the blackboard. The information is continuously enriched until a solution is reached. Pipe and Filter - all workers connected by pipes across which data flows. MapReduc
3 0.73107004 1268 high scalability-2012-06-20-Ask HighScalability: How do I organize millions of images?
Introduction: Does anyone have any advice or suggestions on how to store millions of images? Currently images are stored in a MS SQL database which performance wise isn't ideal. We'd like to migrate the images over to a file system structure but I'd assume we don't just want to dump millions of images into a single directory. Besides having to contend with naming collisions, the windows filesystem might not perform optimally with that many files. I'm assuming one approach may be to assign each user a unique CSLID, create a folder based on the CSLID and then place one users files in that particular folder. Even so, this could result in hundreds of thousands of folders. Whats the best organizational scheme/heirachy for doing this?
4 0.68133444 1556 high scalability-2013-11-29-One Story of Life as Told Through Queues
Introduction: Love this little example of the human condition from John Kellden  via Ilya Grigorik . This happens so often to me shopping at Costco or making lane changes on the highway or picking stocks. Sometimes it's just never the right line and trying to make it better only makes it worse. Stick and stay. Buy and hold. Live to queue another day.
5 0.66119778 277 high scalability-2008-03-16-Do you have any questions for the Elastra CEO?
Introduction: It looks like in the near future I'll have a chance to interview the Elastra CEO. Elastra provides standard databases--MySQL, EnterpriseDB and PostgreSQL-- on top of EC2 and S3. They are selling aggressive pricing, expandable and contactable database resource usage in response to demand, and a simple management and operations interface to well known databases deployed in a cloud. Elastra could be an important option for developers looking for a more traditional cloudy database. I was wondering if you guys had any suggestions for questions you would like answered? What would you like to know about their service? What are you looking for in a cloudy database? What would stop you from adopting it or what would make you decide to adopt it? Any ideas you have would help a lot and will probably be better than anything I have.
6 0.64323711 238 high scalability-2008-02-04-IPS-IDS for heavy content site
7 0.62882084 307 high scalability-2008-04-21-Using Google AppEngine for a Little Micro-Scalability
8 0.62830657 1535 high scalability-2013-10-21-Google's Sanjay Ghemawat on What Made Google Google and Great Big Data Career Advice
9 0.60890555 1252 high scalability-2012-05-25-Stuff The Internet Says On Scalability For May 25, 2012
10 0.5904209 1542 high scalability-2013-11-04-ESPN's Architecture at Scale - Operating at 100,000 Duh Nuh Nuhs Per Second
11 0.57767165 1362 high scalability-2012-11-26-BigData using Erlang, C and Lisp to Fight the Tsunami of Mobile Data
12 0.55176228 716 high scalability-2009-10-06-Building a Unique Data Warehouse
13 0.5446046 526 high scalability-2009-03-05-Strategy: In Cloud Computing Systematically Drive Load to the CPU
14 0.53972179 780 high scalability-2010-02-19-Twitter’s Plan to Analyze 100 Billion Tweets
15 0.53686756 306 high scalability-2008-04-21-The Search for the Source of Data - How SimpleDB Differs from a RDBMS
16 0.53603601 862 high scalability-2010-07-20-Strategy: Consider When a Service Starts Billing in Your Algorithm Cost
17 0.53364736 1018 high scalability-2011-04-07-Paper: A Co-Relational Model of Data for Large Shared Data Banks
18 0.53298831 1183 high scalability-2012-01-30-37signals Still Happily Scaling on Moore RAM and SSDs
19 0.53273165 1439 high scalability-2013-04-12-Stuff The Internet Says On Scalability For April 12, 2013
20 0.53238314 1112 high scalability-2011-09-07-What Google App Engine Price Changes Say About the Future of Web Architecture