Comfy-Org/ComfyUI

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

Open

#8,367 创建于 2025年6月1日

在 GitHub 查看
 (0 评论) (0 反应) (0 负责人)Python (13,218 fork)batch import
Featurehelp wanted

仓库指标

Star
 (112,952 star)
PR 合并指标
 (平均合并 4天 8小时) (30 天内合并 164 个 PR)

描述

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

贡献者指南