What is recorded here?
Decoupled slow regional data-placement planning from fast job scheduling, combining GPU/data colocation, resource-aware placement and local scheduling across Meta's geo-distributed datacenters.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
The home-region formulation uses historical usage estimates, soft GPU balancing and hard storage/CPU constraints; home and replica placement are not solved jointly. New jobs may wait for on-demand data movement. External resource assignments, quotas, preemption and freshness policies remain constraints; observed overload reduction is not a universal optimality theorem.
Read the original work
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Arnab Choudhury; Yang Wang; Tuomas Pelkonen; Kutta Srinivasan; Abha Jain; Shenghao Lin; Delia David; Siavash Soleimanifard; Michael Chen; Abhishek Yadav; Ritesh Tijoriwala; Denis Samoylov; Chunqiang Tang
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
MAST: coordinated data placement and global ML job scheduling
Decoupled slow regional data-placement planning from fast job scheduling, combining GPU/data colocation, resource-aware placement and local scheduling across Meta's geo-distributed datacenters.
Scientific scope
The home-region formulation uses historical usage estimates, soft GPU balancing and hard storage/CPU constraints; home and replica placement are not solved jointly. New jobs may wait for on-demand data movement. External resource assignments, quotas, preemption and freshness policies remain constraints; observed overload reduction is not a universal optimality theorem.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Arnab Choudhury; Yang Wang; Tuomas Pelkonen; Kutta Srinivasan; Abha Jain; Shenghao Lin; Delia David; Siavash Soleimanifard; Michael Chen; Abhishek Yadav; Ritesh Tijoriwala; Denis Samoylov; Chunqiang Tang
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.