Details
-
New Feature
-
Status: Resolved
-
Major
-
Resolution: Duplicate
-
None
-
None
-
None
Description
This JIRA is about the scheduling of applications with long-running tasks.
It will include adding support to the YARN for a richer set of scheduling constraints (such as affinity, anti-affinity, cardinality and time constraints), and extending the schedulers to take them into account during placement of containers to nodes.
We plan to have both an online version that will accommodate such requests as they arrive, as well as a Long-running Application Planner that will make more global decisions by considering multiple applications at once.
Attachments
Attachments
Issue Links
- depends upon
-
YARN-6592 [Umbrella] Rich placement constraints in YARN
-
- Resolved
-