Node.js Backend Development Bootcamp · 课时

工作队列、预取与竞争消费者

使用预取限制和竞争消费者模式，在消费者之间公平分配负载。

工作队列、预取与竞争消费者 是 CoddyKit 上的免费 Node.js Backend Development Bootcamp 课时。这是第 4 节课，共 4 节。你可以在下方免费阅读本课时的完整内容 — 然后在浏览器中使用内置代码编辑器和全天候 AI 导师进行实践。这是 Node.js Backend Development Bootcamp 学习路径的一部分，你的进度在网页和 CoddyKit 应用中同步。 Node.js Backend Development Bootcamp 课程共包含 4 节课。

本课时的部分内容尚未翻译，以英文显示。

Why Work Queues?

A work queue (sometimes called a task queue) lets your Node.js backend push time-consuming jobs to a queue instead of running them inside the HTTP request. Think image resizing, sending emails, or generating PDFs.

The producer publishes a small message describing the job.
One or more consumers (worker processes) pull jobs and execute them in the background.
The HTTP response returns immediately, keeping your API fast.

RabbitMQ stores the messages durably until a worker is free to process them.

A Minimal Producer

The producer connects to RabbitMQ, declares a durable queue, and sends a task message. Each message is just a buffer of bytes — here we send a plain string describing the job.

Notice { durable: true } on the queue and { persistent: true } on the message. Together they let tasks survive a broker restart.

const amqp = require('amqplib');

async function send(task) {
  const conn = await amqp.connect('amqp://localhost');
  const ch = await conn.createChannel();
  const queue = 'tasks';

  await ch.assertQueue(queue, { durable: true });
  ch.sendToQueue(queue, Buffer.from(task), { persistent: true });
  console.log('Sent: %s', task);

  await ch.close();
  await conn.close();
}

send('resize-image:42');

A Minimal Consumer

The consumer asserts the same durable queue and registers a callback with ch.consume. Whenever a message arrives, RabbitMQ delivers it to the handler.

Here we simulate work by counting the dots in the message body, then sleeping that many seconds. The queue name is the contract that links producer and consumer.

const amqp = require('amqplib');

async function worker() {
  const conn = await amqp.connect('amqp://localhost');
  const ch = await conn.createChannel();
  const queue = 'tasks';

  await ch.assertQueue(queue, { durable: true });
  console.log('Waiting for tasks...');

  ch.consume(queue, (msg) => {
    const body = msg.content.toString();
    console.log('Received: %s', body);
  });
}

worker();

Acknowledgements Prevent Lost Work

By default, manual acknowledgements protect you from losing jobs if a worker crashes. With { noAck: false }, RabbitMQ keeps a message in an unacknowledged state until the worker calls ch.ack(msg).

If the worker dies before acking, RabbitMQ requeues the message and another worker picks it up.
Always ack after the work succeeds, never before.
Use ch.nack(msg, false, requeue) to reject a poisoned message.

ch.consume(queue, async (msg) => {
  try {
    await doWork(msg.content.toString());
    ch.ack(msg);            // success: remove from queue
  } catch (err) {
    ch.nack(msg, false, false); // failure: drop (or send to DLX)
  }
}, { noAck: false });

Competing Consumers Pattern

The competing consumers pattern simply means: run multiple worker processes that all consume from the same queue. RabbitMQ delivers each message to exactly one of them.

Want more throughput? Start more workers — no code change needed.
The queue acts as a load buffer during traffic spikes.
This is how you scale background processing horizontally in Node.js.

But how RabbitMQ chooses which worker gets the next message matters a lot.

The Problem: Round-Robin Dispatch

Out of the box, RabbitMQ dispatches messages to consumers in a strict round-robin order — it counts messages, not workload.

Imagine two workers. The queue has tasks where odd-numbered ones are heavy and even-numbered ones are light. Round-robin sends every other task to each worker, so one worker may end up with all the heavy jobs while the other sits idle.

RabbitMQ does not look at how busy a consumer already is — unless you tell it to with prefetch.

Prefetch: Limit Unacked Messages

Prefetch (QoS) caps how many unacknowledged messages a single consumer may hold at once. You set it per channel with ch.prefetch(count).

ch.prefetch(1) means: don't give a worker a new task until it has acked the previous one.
This turns dispatch from "round-robin by count" into "give the next task to whoever is free" — fair dispatch.
Higher values (e.g. 10) increase throughput by pipelining, at the cost of fairness.

const amqp = require('amqplib');

async function worker() {
  const conn = await amqp.connect('amqp://localhost');
  const ch = await conn.createChannel();
  const queue = 'tasks';

  await ch.assertQueue(queue, { durable: true });
  await ch.prefetch(1); // fair dispatch: one in-flight task per worker

  ch.consume(queue, async (msg) => {
    await doWork(msg.content.toString());
    ch.ack(msg);
  }, { noAck: false });
}

worker();

Tuning the Prefetch Value

The right prefetch depends on your workload:

prefetch(1) — best for long, uneven, CPU-heavy tasks. Maximum fairness, slight latency between ack and next delivery.
prefetch(10–50) — best for short, uniform tasks (e.g. tiny webhook fan-out) where round-trip latency would otherwise dominate.

Rule of thumb: short tasks + low latency network → larger prefetch. Long tasks or unpredictable durations → small prefetch. Measure, then tune.

Simulating Fair Dispatch Locally

You don't need RabbitMQ to understand fair dispatch. This standalone program models a single shared queue and two workers under a prefetch=1 policy: each worker only takes a new job when it is free.

Heavy jobs take longer, so the free worker keeps grabbing the next task — the load self-balances instead of being split blindly by count.

const tasks = [5, 1, 5, 1, 5, 1]; // seconds of "work"
let clock = 0;
const workers = [
  { name: 'W1', freeAt: 0 },
  { name: 'W2', freeAt: 0 },
];

for (const cost of tasks) {
  // prefetch=1: assign to whichever worker is free soonest
  const w = workers.reduce((a, b) => (a.freeAt <= b.freeAt ? a : b));
  const start = Math.max(clock, w.freeAt);
  w.freeAt = start + cost;
  console.log(`${w.name} runs ${cost}s at t=${start}`);
}

const finish = Math.max(...workers.map((w) => w.freeAt));
console.log('All done at t=' + finish);

Prefetch Is Per-Channel, Per-Consumer

A common gotcha: ch.prefetch(count) applies to each consumer on that channel by default. If you run one worker process per queue, this is exactly what you want.

The limit counts only unacked messages, so forgetting to ack will stall the worker once it hits the cap.
A second optional argument, ch.prefetch(count, true), makes the limit apply across the whole channel (global), which is rarely needed.
One channel per worker process is the simplest, safest setup.

Putting It Together

A production-ready consumer combines all the pieces: a durable queue, fair-dispatch prefetch, manual acks on success, and nack on failure.

Run several copies of this exact file as separate processes and you have competing consumers that share load fairly. Scale up by launching more workers; scale down by stopping some — the queue absorbs the difference.

const amqp = require('amqplib');

async function start() {
  const conn = await amqp.connect('amqp://localhost');
  const ch = await conn.createChannel();
  const queue = 'tasks';

  await ch.assertQueue(queue, { durable: true });
  await ch.prefetch(1);

  ch.consume(queue, async (msg) => {
    try {
      await handle(JSON.parse(msg.content.toString()));
      ch.ack(msg);
    } catch (err) {
      ch.nack(msg, false, false); // drop / route to dead-letter exchange
    }
  }, { noAck: false });
}

start().catch(console.error);

Quick Check

You run 3 worker processes consuming the same queue. Task durations vary wildly — some take 200ms, some take 30s. You notice one worker is always busy while others go idle, so jobs pile up. What is the most direct fix?

Recap

You learned how to distribute background work fairly across Node.js workers with RabbitMQ:

Work queues offload slow jobs from the request path into a durable queue.
Competing consumers means multiple workers consume the same queue; each message goes to exactly one worker, and you scale by adding processes.
Default dispatch is round-robin by count, which can overload one worker with heavy tasks.
Prefetch (ch.prefetch(n)) caps unacked messages per consumer; prefetch(1) gives fair dispatch, higher values pipeline short tasks.
Always use manual acks (ch.ack on success, ch.nack on failure) so crashed workers don't lose jobs.

常见问题解答

「工作队列、预取与竞争消费者」课时是免费的吗？

是的 — 「工作队列、预取与竞争消费者」的完整文本可在网页上免费阅读。要进行交互式练习（内置代码编辑器和全天候 AI 导师）并解锁 Node.js Backend Development Bootcamp 课程的其余内容，请升级到 CoddyKit PRO。 Node.js Backend Development Bootcamp 课程共包含 4 节课。

「工作队列、预取与竞争消费者」这节课中我会学到什么？

使用预取限制和竞争消费者模式，在消费者之间公平分配负载。你通过在浏览器中直接运行的动手代码来练习 Node.js Backend Development Bootcamp，全天候 AI 导师会在你学习这节课的过程中回答你的问题。

学习 Node.js Backend Development Bootcamp 需要有经验吗？

无需任何先前经验。CoddyKit 上的 Node.js Backend Development Bootcamp 课程适合初学者到高级学习者，你可以从这里开始或从头开始，按照自己的节奏学习。这是第 4 节课，共 4 节。

「工作队列、预取与竞争消费者」课时需要多长时间？

大多数 CoddyKit 课程大约需要 5–10 分钟。每节课都很精短且互动，所以你能稳步进步，并在网页和应用中从离开的地方继续。

我能在这节 Node.js Backend Development Bootcamp 课中编写并运行代码吗？

能。每节 Node.js Backend Development Bootcamp 课都包含内置代码编辑器，你可以在浏览器中直接编写并运行真实代码，并获得即时 AI 反馈 — 无需本地设置。

此课程中的所有课时

← 返回 Node.js Backend Development Bootcamp