npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

drr-fair-queue

v1.1.2

Published

An fair queue based using Deficit Round-Robin

Downloads

9

Readme

A fair queue based on Deficit Round Robin

Build Status NPM version Dependency Status

With this module, you can queue work from multiple incoming sources and pull work for the queue in a fair order. One source cannot cause starvation of the other sources. This module is an implemenation of the work in Efficient Fair Queuing Using Deficit Round-Robin

A fair queue could be used to schedule incoming requests from users, to make sure that no user reduces the performance of other users on the same server. Or, the queue could be used to balance outgoing requests to a downstream server, making sure that one user does not consume all of the connections in a pool.

Overview

When inserting elements into the queue, three pieces of information are needed.

  1. The source of the item
  2. The item
  3. The weight of the item

A simple example

In this example, source 1 will queue two items of work before source 2 can queue anything. But, when the items are popped, the work from source 2 will be popped first so that source 1 does not starve source 2.

var FairQueue = require('drr-fair-queue');
var queue = new FairQueue();

queue.push('source1', 'item1', 1);
queue.push('source1', 'item2', 1);
queue.push('source2', 'item3', 1);

queue.pop();  // Will pop item 1 from source 1
queue.pop();  // Will pop item 3 from source 2
queue.pop();  // Will pop item 2 from source 1

Reacting to queued work

To know when work is ready to be processed, you can register a hook as an option to the constructor. Here is an example program that watches for work and processes when it's available:

var FairQueue = require('drr-fair-queue');

var freeWorkers = 1;
function processWork() {
    if (freeWorkers === 0) {
        // Skipping work because all workers are busy
        return;
    }

    freeWorkers--;
    var work = queue.pop();
    if (!work) {
        freeWorkers++;
        return;
    } else {
        // Do something with the work
        setImmediate(function () {
            console.log('Processing work', work);
            freeWorkers++;
            processWork();
        });
    }
}

var queue = new FairQueue({onUnidle: processWork});
queue.push('source1', 'item1', 1);
queue.push('source1', 'item2', 1);
queue.push('source2', 'item3', 1);