02/27/2023, 7:48 PMDynamicOutput
2. an op that `map`s the generator result from the op above to a sub-graph describe below.
3. a sub-graph that is composed of a) an op that schedules a k8s job using execute_k8s_job
and then (b) runs an op that updates the DB with the k8s job’s success status (actually, it sets a UUID field, but that’s not important). The priorities of each op are set such that the DB update is prioritized over starting a new k8s job.
The list size for each run and number of concurrent op executions appears to be limited by available memory, with dagster OOPing if the numbers are too high.
Ideally, I’d like to trigger a run and have the entire batch list processed in a memory-efficient manner. Is there a better approach to solving this problem than the above?sandy
02/28/2023, 12:04 AMDaniel Chalef
02/28/2023, 5:29 PMmultiprocess
executor. Now that I’m using this and up’ed the dagster container’s memory, my runs are far more stable.