baidu / baidu/babylon

对于anyflow,如果QPS有1W,需要创建1W个graph实例?

Open
#20 2 comments 0 reactions 0 assignees View on GitHub
Dominant language
C++
Stars
653
Forks
101
PR merge metrics
No merged PRs in 30d

Description

执行相同的graph,应该只需创建一个图实例即可,只是跑的数据不同而已。图与数据应该解耦合,这样就没必要用池化技术了。

Contributor guide

No contributing guide indexed for this repository

Research direction

The issue does not identify any files, tests, or entry points. Start by locating the anyflow graph creation and execution APIs, then determine whether graph state is coupled to input data and how instances are currently managed. Done should include an agreed design and validation that repeated executions can share a graph without unsafe state or pooling assumptions.

Written by the indexing model from the issue text.

Assessment

Tech stack
cpp
Domain
backend, performance
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.