Skip to main content

Scaling Node.JS

Three areas to take care in scaling

  1. Multiple instances
  2. Microservices
  3. Database Partitioning
How to fork?
const { fork } = require('child-process);

const processes = [
  fork('./app', ['3001']),
  fork('./app', ['3002']),
  fork('./app', ['3003'])
]
Check CPUs on machine
const cpus = require('os').cpus;
console.log(cpus);
Run as many instances of node app as many CPUs are available. Write the following to index.js and run in Node
const http = require('http');
const cluster = require('cluster');
const cpus_len = require('os').cpus().length;
if (cluster.isMaster) {
    console.log("FORKING"process.pid);
    for (let i = 0i < cpus_leni++) {
        cluster.fork();
    }
else {
    http.createServer((reqres=> {
        res.end(process.pid.toString());
    }).listen(3000);
}

LoadTest

LoadTest can be used to test multiple processes running.
Installing LoadTest
npm install loadtest
loadtest -n 500 http://localhost:3000

Scaling using PM2

Installing PM2

npm install pm2

Running PM2

pm2 start index.js -i -1

Comments

Popular posts from this blog

Difference between .exec() and .execPopulate() in Mongoose?

Here I answer what is the difference between .exec() and .execPopulate() in Mongoose? .exec() is used with a query while .execPopulate() is used with a document Syntax for .exec() is as follows: Model.query() . populate ( 'field' ) . exec () // returns promise . then ( function ( document ) { console . log ( document ); }); Syntax for .execPopulate() is as follows: fetchedDocument . populate ( 'field' ) . execPopulate () // returns promise . then ( function ( document ) { console . log ( document ); }); When working with individual document use .execPopulate(), for model query use .exec(). Both returns a promise. One can do without .exec() or .execPopulate() but then has to pass a callback in populate.

Python - List - Append, Count, Extend, Index, Insert, Pop, Remove, Reverse, Sort

🐍 Advance List List is widely used and it's functionalities are heavily useful. Append Adds one element at the end of the list. Syntax list1.append(value) Input l1 = [1, 2, 3] l1.append(4) l1 Output [1, 2, 3, 4] append can be used to add any datatype in a list. It can even add list inside list. Caution: Append does not return anything. It just appends the list. Count .count(value) counts the number of occurrences of an element in the list. Syntax list1.count(value) Input l1 = [1, 2, 3, 4, 3] l1.count(3) Output 2 It returns 0 if the value is not found in the list. Extend .count(value) counts the number of occurrences of an element in the list. Syntax list1.extend(list) Input l1 = [1, 2, 3] l1.extend([4, 5]) Output [1, 2, 3, 4, 5] If we use append, entire list will be added to the first list like one element. Extend, i nstead of considering a list as one element, it joins the two lists one after other. Append works in the following way. Input l1 = [1, 2, 3] l1.append([4, 5]) Output...

269. Alien Dictionary

  Solution This article assumes you already have some confidence with  graph algorithms , such as  breadth-first search  and  depth-first searching . If you're familiar with those, but not with  topological sort  (the topic tag for this problem), don't panic, as you should still be able to make sense of it. It is one of the many more advanced algorithms that keen programmers tend to "invent" themselves before realizing it's already a widely known and used algorithm. There are a couple of approaches to topological sort;  Kahn's Algorithm  and DFS. A few things to keep in mind: The letters  within a word  don't tell us anything about the relative order. For example, the presence of the word  kitten  in the list does  not  tell us that the letter  k  is before the letter  i . The input can contain words followed by their prefix, for example,  abcd  and then  ab . These cases will never ...