@zukhruf/pool 0.6.13 → 0.6.14

package/README.md

@@ -37,14 +37,21 @@ The pool waits for `ready()` with no time limit. Thus, if the warm-up of a worke
 
 ## Choose how many workers run
 
-| Sizing                              | Runs                                                                                                                   |
-| ----------------------------------- | ---------------------------------------------------------------------------------------------------------------------- |
-| `Fixed(n)`                          | n workers                                                                                                              |
-| `Resources({ memoryPerWorker })`    | one for each CPU, while each finds its memory free                                                                     |
-| `HillClimbing({ memoryPerWorker })` | two first, and one more while the last one added at least a tenth more jobs a second (as the .NET thread pool)         |
-| `Gradient({ memoryPerWorker })`     | two first, and one more while a job takes at most half again the time it took with two (as Netflix concurrency-limits) |
+| Sizing                              | Runs                                                                                                                |
+| ----------------------------------- | ------------------------------------------------------------------------------------------------------------------- |
+| `Fixed(n)`                          | n workers                                                                                                           |
+| `Resources({ memoryPerWorker })`    | one for each CPU, while each finds its memory free                                                                  |
+| `HillClimbing({ memoryPerWorker })` | two first, then as many as add at least a tenth more jobs a second each (as the .NET thread pool)                   |
+| `Gradient({ memoryPerWorker })`     | two first, then as many as keep a job at most half again the time it takes with two (as Netflix concurrency-limits) |
 
-The two sizings that learn measure only while jobs wait and every worker is ready, in windows of at least 20 jobs and 2 seconds. They learn once, and never pass what the computer can give. See [ADR 0002](./docs/adr/0002-a-sizing-that-learns-compares-one-more-worker-between-two-windows.md).
+The two sizings that learn take steps for as long as the pool runs. A step measures three windows of at least 20 jobs and 2 seconds: at the size it has, at the size it tries, and at the size it has again. A sizing measures only while jobs wait and every worker is ready.
+
+- A step tries one more worker, or fewer: `HillClimbing` one fewer, `Gradient` two. A step with fewer keeps every worker alive, so it costs no warm-up.
+- The sizing keeps one more worker as soon as one step shows that it pays. It lets a worker go only after two steps in a row show that the worker does not pay.
+- After a step that changes nothing, the sizing pauses: one window first, then twice as long after each such step, up to 16 windows. The length is random, so pools in other processes do not step at the same moments.
+- After each window, the sizing reads the free memory again. When its workers do not fit, it runs fewer at once. It never runs more than the capacity when the pool was built.
+
+See [ADR 0002](./docs/adr/0002-a-sizing-that-learns-compares-one-more-worker-between-two-windows.md) and [ADR 0007](./docs/adr/0007-a-sizing-that-learns-keeps-learning-in-steps-both-ways-and-pauses-between-steps-that-change-nothing.md).
 
 ## Choose when idle workers close
 
@@ -81,6 +88,13 @@ A worker that exited is in no count, and a slot whose worker the pool evicted is
 
 A job that needs the slot of an exited worker starts a new worker. An eager startup also replaces an idle worker that exits. After an early exit (a worker that ran less than 10 minutes), the pool waits first: 1 s, then 2 s, 4 s, and so on up to 60 s for each early exit in a row. A worker that runs 10 minutes ends this back-off. A job does not wait for a back-off: its worker starts now. Kubernetes restarts a container in CrashLoopBackOff with the same rule. The pool does not count an evicted worker as an exit: it does not replace the worker and does not start a back-off. An evicted worker that ran 10 minutes ends the back-off too. See [ADR 0005](./docs/adr/0005-an-eager-pool-backs-off-before-it-replaces-a-worker-that-exited-early.md).
 
+## Recipes
+
+1. [Let the pool find how many workers pay](./docs/recipes/find-how-many-workers-pay.md)
+2. [Warm a model once, then start the other workers](./docs/recipes/warm-a-model-once.md)
+3. [Hold workers only while there is work](./docs/recipes/hold-workers-only-while-there-is-work.md)
+4. [Test a pool on the real path](./docs/recipes/test-a-pool-on-the-real-path.md)
+
 ## Decisions
 
 - [ADR 0001](./docs/adr/0001-startups-and-sizings-are-classes-that-a-caller-chooses.md): startups and sizings are classes that a caller chooses.
@@ -89,3 +103,4 @@ A job that needs the slot of an exited worker starts a new worker. An eager star
 - [ADR 0004](./docs/adr/0004-a-pool-reports-its-stats-as-one-snapshot-of-counts.md): a pool reports its stats as one snapshot of counts.
 - [ADR 0005](./docs/adr/0005-an-eager-pool-backs-off-before-it-replaces-a-worker-that-exited-early.md): an eager pool backs off before it replaces a worker that exited early.
 - [ADR 0006](./docs/adr/0006-the-pool-evicts-an-idle-worker-that-its-eviction-lets-go-and-lends-an-idle-worker-first.md): the pool evicts an idle worker that its eviction lets go, and lends an idle worker first.
+- [ADR 0007](./docs/adr/0007-a-sizing-that-learns-keeps-learning-in-steps-both-ways-and-pauses-between-steps-that-change-nothing.md): a sizing that learns keeps learning in steps both ways, and pauses between steps that change nothing.

package/dist/climbing.d.ts

@@ -14,6 +14,7 @@ export declare abstract class Climbing implements Sizing {
     get kept(): number;
     record({ started, finished, measurable }: Sample): void;
     protected abstract measure(window: Window): number;
-    protected abstract pays(ratio: number): boolean;
+    protected abstract pays(ratio: number, larger: number, smaller: number): boolean;
+    protected fewer(size: number): number;
 }
 //# sourceMappingURL=climbing.d.ts.map

package/dist/climbing.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"climbing.d.ts","sourceRoot":"","sources":["../src/climbing.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAQlD,MAAM,WAAW,MAAM;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAUD,8BAAsB,QAAS,YAAW,MAAM;;IAC9C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;gBASb,OAAO,EAAE;QAAE,eAAe,EAAE,MAAM,CAAA;KAAE;IAMhD,IAAI,OAAO,IAAI,MAAM,CAEpB;IAID,IAAI,IAAI,IAAI,MAAM,CAIjB;IAED,MAAM,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,MAAM,GAAG,IAAI;IAkCvD,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAIlD,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;CAChD"}
+{"version":3,"file":"climbing.d.ts","sourceRoot":"","sources":["../src/climbing.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAalD,MAAM,WAAW,MAAM;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAkBD,8BAAsB,QAAS,YAAW,MAAM;;IAC9C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;gBAkBb,OAAO,EAAE;QAAE,eAAe,EAAE,MAAM,CAAA;KAAE;IAQhD,IAAI,OAAO,IAAI,MAAM,CAGpB;IAID,IAAI,IAAI,IAAI,MAAM,CAKjB;IAED,MAAM,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,MAAM,GAAG,IAAI;IAgFvD,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAIlD,SAAS,CAAC,QAAQ,CAAC,IAAI,CACrB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,GACd,OAAO;IAGV,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;CAGtC"}

package/dist/climbing.js

@@ -3,41 +3,71 @@ import { capacity } from "./capacity.js";
 // decide alone.
 const jobs = 20;
 const span = 2_000;
-// Finds how many workers pay by trying one more. Work that changes while it
-// is measured, as when files arrive grouped by kind, would decide a plain
-// before and after, so each step measures in the order A, B, A: a window at
-// the size that pays so far, one at a size larger, and one back at the first
-// size. The larger size pays when its window compared to the mean of both
-// first windows passes the variant's test. Pools start with two workers,
-// learn once, and never pass the Mac's capacity. Variants say what a window
-// measures and what passes.
+// A pause between two steps that changed nothing doubles from one window up
+// to this many, as .NET's hill climbing waits up to ten times longer when
+// more threads hurt: each step with one more warms up a worker for nothing.
+const longestPause = 16;
+// Finds how many workers pay by trying more or fewer, step after step, for as
+// long as the pool runs. Work that changes while it is measured, as when files
+// arrive grouped by kind, would decide a plain before and after, so each step
+// measures in the order A, B, A: a window at the size that pays so far, one at
+// the size it tries, and one back at the first size. The larger of the two
+// sizes pays when its window compared to the other passes the variant's test.
+// One more worker that pays is kept at once; the pool lets its last worker go
+// only after that worker failed to pay in two steps in a row, because a worker
+// that closes too early must warm up again. A step with fewer workers keeps
+// every worker alive. A step that changes the size leads to another step in
+// the same direction at once; any other step turns around after a pause. The
+// pause has a random length, so pools in other processes do not measure each
+// other's steps (.NET; AWS's exponential backoff and jitter). Pools start with
+// two workers and never pass what the Mac affords, which they read again after
+// each window. Variants say what a window measures, what passes, and how many
+// workers a step with fewer tries.
 export class Climbing {
     ceiling;
+    #memoryPerWorker;
+    // The workers the Mac affords now; other processes take and free memory.
+    #room;
     #size;
+    #direction = 'more';
     #step;
+    // Steps in a row in which fewer workers did as well.
+    #unpaid = 0;
+    // Steps in a row that changed nothing, and when the pause after them ends.
+    #calm = 0;
+    #resume = 0;
     #before = 0;
-    #more = 0;
+    #tried = 0;
     #first = 0;
     #count = 0;
     #busy = 0;
     constructor(options) {
+        this.#memoryPerWorker = options.memoryPerWorker;
         this.ceiling = capacity(options.memoryPerWorker);
+        this.#room = this.ceiling;
         this.#size = Math.min(2, this.ceiling);
-        this.#step = this.#size < this.ceiling ? 'before' : 'settled';
+        this.#step = this.ceiling > 1 ? 'before' : 'settled';
     }
     get current() {
-        return this.#step === 'more' ? this.#size + 1 : this.#size;
+        if (this.#step !== 'tried')
+            return this.#size;
+        return this.#direction === 'more' ? this.#size + 1 : this.fewer(this.#size);
     }
-    // The worker the step tries stays alive while the step measures the size
-    // before it again.
+    // The worker a step tries stays alive while the step measures the size
+    // before it again, and a step with fewer workers keeps every worker.
     get kept() {
-        return this.#step === 'more' || this.#step === 'after'
+        return this.#direction === 'more' &&
+            (this.#step === 'tried' || this.#step === 'after')
             ? this.#size + 1
             : this.#size;
     }
     record({ started, finished, measurable }) {
         if (this.#step === 'settled')
             return;
+        if (this.#step === 'pause' && finished >= this.#resume) {
+            this.#step = 'before';
+            this.#restart();
+        }
         if (!measurable) {
             this.#restart();
             return;
@@ -54,24 +84,74 @@ export class Climbing {
             busy: this.#busy,
         });
         this.#restart();
+        this.#room = Math.min(this.ceiling, capacity(this.#memoryPerWorker));
+        if (this.kept > this.#room) {
+            // Memory that other processes took does not wait for two steps.
+            this.#size = Math.min(this.#size, this.#room);
+            this.#unpaid = 0;
+            this.#direction = 'fewer';
+            this.#step = 'before';
+            return;
+        }
+        if (this.#step === 'pause')
+            return;
         if (this.#step === 'before') {
+            // With no step that fits, the sizing measures again.
+            if (!this.#aim())
+                return;
             this.#before = value;
-            this.#step = 'more';
+            this.#step = 'tried';
         }
-        else if (this.#step === 'more') {
-            this.#more = value;
+        else if (this.#step === 'tried') {
+            this.#tried = value;
             this.#step = 'after';
         }
-        else if (this.pays(this.#more / ((this.#before + value) / 2))) {
-            this.#size++;
-            this.#step = this.#size < this.ceiling ? 'before' : 'settled';
-        }
         else
-            this.#step = 'settled';
+            this.#decide((this.#before + value) / 2, finished);
+    }
+    #decide(base, finished) {
+        const size = this.#size;
+        let changed = false;
+        if (this.#direction === 'more') {
+            changed = this.pays(this.#tried / base, size + 1, size);
+            if (changed)
+                this.#size++;
+        }
+        else if (this.pays(base / this.#tried, size, this.fewer(size)))
+            this.#unpaid = 0;
+        else if (++this.#unpaid === 2) {
+            this.#unpaid = 0;
+            this.#size--;
+            changed = true;
+        }
+        this.#step = 'before';
+        if (changed)
+            this.#calm = 0;
+        else if (this.#unpaid === 0) {
+            this.#direction = this.#direction === 'more' ? 'fewer' : 'more';
+            const windows = Math.min(2 ** this.#calm++, longestPause);
+            this.#resume = finished + span * windows * (0.5 + Math.random());
+            this.#step = 'pause';
+        }
+    }
+    // Turns the next step to a direction that fits, and tells whether one does.
+    #aim() {
+        const fewer = this.fewer(this.#size);
+        const more = this.#size < this.#room;
+        const less = fewer >= 1 && fewer < this.#size;
+        if (!more)
+            this.#direction = 'fewer';
+        if (!less)
+            this.#direction = 'more';
+        return more || less;
     }
     #restart() {
         this.#count = 0;
         this.#busy = 0;
     }
+    // How many workers a step with fewer tries when `size` run.
+    fewer(size) {
+        return size - 1;
+    }
 }
 //# sourceMappingURL=climbing.js.map

package/dist/climbing.js.map

@@ -1 +1 @@
-{"version":3,"file":"climbing.js","sourceRoot":"","sources":["../src/climbing.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAGzC,6EAA6E;AAC7E,gBAAgB;AAChB,MAAM,IAAI,GAAG,EAAE,CAAC;AAChB,MAAM,IAAI,GAAG,KAAK,CAAC;AAWnB,4EAA4E;AAC5E,0EAA0E;AAC1E,4EAA4E;AAC5E,6EAA6E;AAC7E,0EAA0E;AAC1E,yEAAyE;AACzE,4EAA4E;AAC5E,4BAA4B;AAC5B,MAAM,OAAgB,QAAQ;IACnB,OAAO,CAAS;IACzB,KAAK,CAAS;IACd,KAAK,CAA0C;IAC/C,OAAO,GAAG,CAAC,CAAC;IACZ,KAAK,GAAG,CAAC,CAAC;IACV,MAAM,GAAG,CAAC,CAAC;IACX,MAAM,GAAG,CAAC,CAAC;IACX,KAAK,GAAG,CAAC,CAAC;IAEV,YAAY,OAAoC;QAC9C,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;IAChE,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;IAC7D,CAAC;IAED,yEAAyE;IACzE,mBAAmB;IACnB,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,KAAK,MAAM,IAAI,IAAI,CAAC,KAAK,KAAK,OAAO;YACpD,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC;YAChB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;IACjB,CAAC;IAED,MAAM,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAU;QAC9C,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAAE,OAAO;QACrC,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,OAAO;QACT,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;QAC9C,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,IAAI,CAAC,KAAK,IAAI,QAAQ,GAAG,OAAO,CAAC;QACjC,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI;YAAE,OAAO;QAChE,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC;YACzB,IAAI,EAAE,IAAI,CAAC,MAAM;YACjB,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC,MAAM;YAC5B,IAAI,EAAE,IAAI,CAAC,KAAK;SACjB,CAAC,CAAC;QACH,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,IAAI,IAAI,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;YACrB,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC;QACtB,CAAC;aAAM,IAAI,IAAI,CAAC,KAAK,KAAK,MAAM,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QACvB,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAChE,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;QAChE,CAAC;;YAAM,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;IAChC,CAAC;IAED,QAAQ;QACN,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;CAQF"}
+{"version":3,"file":"climbing.js","sourceRoot":"","sources":["../src/climbing.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAGzC,6EAA6E;AAC7E,gBAAgB;AAChB,MAAM,IAAI,GAAG,EAAE,CAAC;AAChB,MAAM,IAAI,GAAG,KAAK,CAAC;AAEnB,4EAA4E;AAC5E,0EAA0E;AAC1E,4EAA4E;AAC5E,MAAM,YAAY,GAAG,EAAE,CAAC;AAWxB,8EAA8E;AAC9E,+EAA+E;AAC/E,8EAA8E;AAC9E,+EAA+E;AAC/E,2EAA2E;AAC3E,8EAA8E;AAC9E,8EAA8E;AAC9E,+EAA+E;AAC/E,4EAA4E;AAC5E,4EAA4E;AAC5E,6EAA6E;AAC7E,6EAA6E;AAC7E,+EAA+E;AAC/E,+EAA+E;AAC/E,8EAA8E;AAC9E,mCAAmC;AACnC,MAAM,OAAgB,QAAQ;IACnB,OAAO,CAAS;IAChB,gBAAgB,CAAS;IAClC,yEAAyE;IACzE,KAAK,CAAS;IACd,KAAK,CAAS;IACd,UAAU,GAAqB,MAAM,CAAC;IACtC,KAAK,CAAqD;IAC1D,qDAAqD;IACrD,OAAO,GAAG,CAAC,CAAC;IACZ,2EAA2E;IAC3E,KAAK,GAAG,CAAC,CAAC;IACV,OAAO,GAAG,CAAC,CAAC;IACZ,OAAO,GAAG,CAAC,CAAC;IACZ,MAAM,GAAG,CAAC,CAAC;IACX,MAAM,GAAG,CAAC,CAAC;IACX,MAAM,GAAG,CAAC,CAAC;IACX,KAAK,GAAG,CAAC,CAAC;IAEV,YAAY,OAAoC;QAC9C,IAAI,CAAC,gBAAgB,GAAG,OAAO,CAAC,eAAe,CAAC;QAChD,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;IACvD,CAAC;IAED,IAAI,OAAO;QACT,IAAI,IAAI,CAAC,KAAK,KAAK,OAAO;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC;QAC9C,OAAO,IAAI,CAAC,UAAU,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9E,CAAC;IAED,uEAAuE;IACvE,qEAAqE;IACrE,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,UAAU,KAAK,MAAM;YAC/B,CAAC,IAAI,CAAC,KAAK,KAAK,OAAO,IAAI,IAAI,CAAC,KAAK,KAAK,OAAO,CAAC;YAClD,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC;YAChB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;IACjB,CAAC;IAED,MAAM,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAU;QAC9C,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAAE,OAAO;QACrC,IAAI,IAAI,CAAC,KAAK,KAAK,OAAO,IAAI,QAAQ,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACvD,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;YACtB,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,CAAC;QACD,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,OAAO;QACT,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;QAC9C,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,IAAI,CAAC,KAAK,IAAI,QAAQ,GAAG,OAAO,CAAC;QACjC,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI;YAAE,OAAO;QAChE,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC;YACzB,IAAI,EAAE,IAAI,CAAC,MAAM;YACjB,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC,MAAM;YAC5B,IAAI,EAAE,IAAI,CAAC,KAAK;SACjB,CAAC,CAAC;QACH,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;QACrE,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,gEAAgE;YAChE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YAC9C,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;YACjB,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC;YAC1B,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;YACtB,OAAO;QACT,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,KAAK,OAAO;YAAE,OAAO;QACnC,IAAI,IAAI,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC5B,qDAAqD;YACrD,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBAAE,OAAO;YACzB,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;YACrB,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QACvB,CAAC;aAAM,IAAI,IAAI,CAAC,KAAK,KAAK,OAAO,EAAE,CAAC;YAClC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;YACpB,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QACvB,CAAC;;YAAM,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;IAC5D,CAAC;IAED,OAAO,CAAC,IAAY,EAAE,QAAgB;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,IAAI,CAAC,UAAU,KAAK,MAAM,EAAE,CAAC;YAC/B,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;YACxD,IAAI,OAAO;gBAAE,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC9D,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;aACd,IAAI,EAAE,IAAI,CAAC,OAAO,KAAK,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;YACjB,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;QACtB,IAAI,OAAO;YAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;aACvB,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;YAChE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,EAAE,YAAY,CAAC,CAAC;YAC1D,IAAI,CAAC,OAAO,GAAG,QAAQ,GAAG,IAAI,GAAG,OAAO,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;YACjE,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QACvB,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,IAAI;QACF,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACrC,MAAM,IAAI,GAAG,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAC9C,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC;QACrC,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC;QACpC,OAAO,IAAI,IAAI,IAAI,CAAC;IACtB,CAAC;IAED,QAAQ;QACN,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAaD,4DAA4D;IAClD,KAAK,CAAC,IAAY;QAC1B,OAAO,IAAI,GAAG,CAAC,CAAC;IAClB,CAAC;CACF"}

package/dist/gradient.d.ts

@@ -2,6 +2,7 @@ import { Climbing, type Window } from './climbing.ts';
 export declare class Gradient extends Climbing {
     #private;
     protected measure({ jobs, busy }: Window): number;
-    protected pays(ratio: number): boolean;
+    protected pays(ratio: number, larger: number, smaller: number): boolean;
+    protected fewer(): number;
 }
 //# sourceMappingURL=gradient.d.ts.map

package/dist/gradient.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"gradient.d.ts","sourceRoot":"","sources":["../src/gradient.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,KAAK,MAAM,EAAE,MAAM,eAAe,CAAC;AAMtD,qBAAa,QAAS,SAAQ,QAAQ;;IAGpC,SAAS,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,MAAM,GAAG,MAAM;IAIjD,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;CAKvC"}
+{"version":3,"file":"gradient.d.ts","sourceRoot":"","sources":["../src/gradient.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,KAAK,MAAM,EAAE,MAAM,eAAe,CAAC;AAQtD,qBAAa,QAAS,SAAQ,QAAQ;;IAKpC,SAAS,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,MAAM,GAAG,MAAM;IAIjD,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO;cAQpD,KAAK,IAAI,MAAM;CAGnC"}

package/dist/gradient.js

@@ -2,17 +2,25 @@ import { Climbing } from "./climbing.js";
 // Finds how many workers pay by the time a job takes, as Netflix's
 // concurrency-limits Gradient does: one more worker pays while a job takes at
 // most half again the time it took with two. Past that, the workers queue for
-// something they share.
+// something they share. Work changes, so a step with fewer runs two workers
+// again, as Netflix's GradientLimit and Envoy measure their base time again
+// at their least concurrency: the time with two is then as fresh as the step.
 export class Gradient extends Climbing {
-    #slowdown = 1;
+    // For each size: a job's time with that many workers, divided by its time
+    // with two, as last measured.
+    #slowdown = new Map();
     measure({ jobs, busy }) {
         return busy / jobs;
     }
-    pays(ratio) {
-        if (this.#slowdown * ratio > 1.5)
-            return false;
-        this.#slowdown *= ratio;
-        return true;
+    pays(ratio, larger, smaller) {
+        if (larger <= 2)
+            return true;
+        const slowdown = (smaller <= 2 ? 1 : (this.#slowdown.get(smaller) ?? 1)) * ratio;
+        this.#slowdown.set(larger, slowdown);
+        return slowdown <= 1.5;
+    }
+    fewer() {
+        return 2;
     }
 }
 //# sourceMappingURL=gradient.js.map

package/dist/gradient.js.map

@@ -1 +1 @@
-{"version":3,"file":"gradient.js","sourceRoot":"","sources":["../src/gradient.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,MAAM,eAAe,CAAC;AAEtD,mEAAmE;AACnE,8EAA8E;AAC9E,8EAA8E;AAC9E,wBAAwB;AACxB,MAAM,OAAO,QAAS,SAAQ,QAAQ;IACpC,SAAS,GAAG,CAAC,CAAC;IAEJ,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,EAAU;QACtC,OAAO,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC;IAES,IAAI,CAAC,KAAa;QAC1B,IAAI,IAAI,CAAC,SAAS,GAAG,KAAK,GAAG,GAAG;YAAE,OAAO,KAAK,CAAC;QAC/C,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}
+{"version":3,"file":"gradient.js","sourceRoot":"","sources":["../src/gradient.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAe,MAAM,eAAe,CAAC;AAEtD,mEAAmE;AACnE,8EAA8E;AAC9E,8EAA8E;AAC9E,4EAA4E;AAC5E,4EAA4E;AAC5E,8EAA8E;AAC9E,MAAM,OAAO,QAAS,SAAQ,QAAQ;IACpC,0EAA0E;IAC1E,8BAA8B;IACrB,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAErC,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,EAAU;QACtC,OAAO,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC;IAES,IAAI,CAAC,KAAa,EAAE,MAAc,EAAE,OAAe;QAC3D,IAAI,MAAM,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAC7B,MAAM,QAAQ,GACZ,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QAClE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACrC,OAAO,QAAQ,IAAI,GAAG,CAAC;IACzB,CAAC;IAEkB,KAAK;QACtB,OAAO,CAAC,CAAC;IACX,CAAC;CACF"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@zukhruf/pool",
-  "version": "0.6.13",
+  "version": "0.6.14",
   "description": "Lend long-lived workers, such as native helper processes, to one job at a time: startups that decide when workers start, sizings that decide how many run, evictions that decide when an idle worker closes, and replacement of a worker that exits.",
   "license": "MIT",
   "repository": {
@@ -41,10 +41,10 @@
     "access": "public"
   },
   "dependencies": {
-    "@zukhruf/async": "^0.6.13",
+    "@zukhruf/async": "^0.6.14",
     "p-queue": "10.0.0"
   },
   "devDependencies": {
-    "@zukhruf/testing": "^0.6.13"
+    "@zukhruf/testing": "^0.6.14"
   }
 }