Comfy-Org/ComfyUI

Create caching option that organizes cache based on loading times of cached values

Open

#8,367 opened on Jun 1, 2025

View on GitHub
 (0 comments) (0 reactions) (0 assignees)Python (13,218 forks)batch import
Featurehelp wanted

Repository metrics

Stars
 (112,952 stars)
PR merge metrics
 (Avg merge 4d 8h) (164 merged PRs in 30d)

Description

Feature Idea

Create a new caching algorithm/class that

  • scores each cached output on the basis of (1) time to load cold and (2) relative size of cached output compared with available system memory
  • arranges cached values in min- or max-heap such that the item being popped from cache is always the highest scored item

The effect is that we are more likely to pop items from the cache that take a small amount of time to load relative to their size.

Then expose that option via command line option, to exist alongside current options (lru, classic, no caching)

Existing Solutions

No response

Other

No response

Contributor guide

Research direction
Study existing caching algorithms in the codebase (LRU, classic) and understand how they are integrated. Then design and implement a new heap based caching algorithm that scores items by load time and size. Expose via CLI option.
Tech stack
python
Domain
backendcli
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Half day
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Fresh
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
Pythoncaching concepts
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
50