You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Minimize the data shuffling required to load the dependencies of each target on each persistent worker.
Maybe assign each target to the worker with the most dependency data already loaded. Here, there are tradeoffs with target runtimes when it comes to load balancing.
Maybe implement a mechanism that shares memory across workers. Maybe POSIX threads for local parallelism?
@mschubert, is this different from what you have in mind?
The text was updated successfully, but these errors were encountered:
wlandau
changed the title
Efficient distribution of dependency data shared across persistent workers
Planning phase: efficient distribution of dependency data shared across persistent workers
Jan 13, 2019
wlandau
changed the title
Planning phase: efficient distribution of dependency data shared across persistent workers
Initial planning phase: efficient data management for persistent workers
Jan 20, 2019
Through #800 and related issues, I am reducing the size of the common data sent to the workers. We could also reduce the data sent over with each individual target and use existing worker data to come up with sensible worker affinities. @mschubert, were you thinking about something similar for #561 (comment)?
Following up on #561 (comment). My thoughts so far:
@mschubert, is this different from what you have in mind?
The text was updated successfully, but these errors were encountered: