- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes SCHEMA for scheduling DAG tasks on multi-machine platforms where communication resources are contended. The method uses a two-level policy: it first selects a ready task and then selects a machine for it. The environment models the interconnect as capacity-limited link tiers; a transfer uses the cheapest tier with available capacity and is escalated to a more expensive tier when that tier is full. The policy input includes the estimated transfer cost under current tier occupancy. The paper compares SCHEMA with classical and learned baselines on four task graphs and reports a 29.4% makespan reduction over the strongest baseline on the largest graph, MATINV, with 16,208 nodes.
Critical strengths
- The paper addresses a practically important problem: communication contention in DAG scheduling on scarce machines. Feeding current link occupancy back into task selection and machine assignment is a clear and reasonable design idea.
- The method framework, feature design, and ablation study are relatively clear. The final schedules of all methods are scored by the same evaluator, so the makespan evaluation protocol is relatively consistent.
- On the largest and most communication-heavy graph, MATINV, SCHEMA's advantage over baselines is substantial, suggesting that incorporating contention into the environment may help in large-scale, machine-scarce settings.
Critical weaknesses
- Novelty and positioning need to be sharper. Communication contention has been explicitly modeled before, and DOPPLER also uses a two-level operation-then-device policy. The clearer contribution of this paper is the combination of a capacity-limited tiered link-occupancy model and its features with joint task/machine learning. However, the experiments do not compare against existing contention-aware schedulers, nor do they discuss recent methods. It is therefore difficult to judge the incremental benefit of this combination.
- The DOPPLER baseline adaptation is unclear. DOPPLER originally learns device placement, with an asynchronous runtime determining execution order; SCHEMA constructs task order and machine assignment step by step. Appendix E does not sufficiently explain how DOPPLER's placement is converted into the schedule required by SCHEMA's evaluator, nor does it clearly state what reward is used in DOPPLER's Stage-II simulated training and whether the same tiered-contention environment is used. If DOPPLER is trained under a static communication model but evaluated under contention, the comparison may be unfair. The use of only a single placement sweep for Placeto also needs justification.
- The communication simulator lacks grounding and parameter justification. The capacities and per-unit costs in Table 6 have no hardware source, measurement method, or units, and the per-link M2M costs are not fully listed. The model lets a transfer occupy a tier until the successor task starts rather than until data transmission completes; data on the same machine may also be moved to GROUP or GLOBAL when LOCAL is full. Because the main gains depend on this simulator, the authors need to explain which actual resources these rules correspond to (link bandwidth, ports, buffers, or reservation mechanisms) and validate or analyze the sensitivity of conclusions to parameter changes.
- Experimental coverage and statistical reporting are insufficient. All four task graphs use a fixed 32-machine configuration; the key ablation is performed only on the non-public MATINV graph; the main results report only the best makespan, without multi-seed means, variance, or confidence intervals; and scheduling generation time and training/inference overhead are missing. The CCR figure shows the difference between HEFT's static estimate and the contention-simulated result for the same schedule, rather than directly showing how SCHEMA's advantage over baselines varies with contention. At minimum, ablation or sensitivity results should be added on the public graphs (ROBOT/SPEC/GEMM).
- RL implementation details are insufficient for reproducibility. Although the paper gives the overall MDP, policy, and PPO formulas, it remains unclear how the value network is organized, how the task policy and machine policy share or separate value estimates, how the joint task–machine action participates in PPO updates, how rollouts and batches are organized, whether a separate model is trained for each graph, and how actions are selected at evaluation (sampling or greedy). In addition, the sum of step rewards equals the final makespan only without discounting, whereas Table 4 uses γ=0.99. The claim that maximizing return is equivalent to minimizing final makespan needs to be corrected or justified as an approximation under discounting.
- Writing and figures need improvement. Figure 1 is information-dense, some fonts are too small, and the correspondence between modules and equations is not clear enough. It should be redrawn as a proper vector figure with consistent fonts, alignment, and arrows.
Questions for authors
- How were the parameters in Table 6 obtained? Please provide units, the complete per-link M2M costs, hardware measurements, or a parameter-sensitivity study.
- Why does a link resource remain occupied until the successor task starts? If data transmission has finished but the task is still waiting for a machine, how is this handled? What is the physical meaning of moving same-machine data to GROUP/GLOBAL when LOCAL is full?
- How is DOPPLER's device placement converted into the task schedule used by your evaluator? Which environment produces its Stage-II reward, and does that environment also use tiered contention? What is the rationale for using only a single placement sweep for Placeto?
- It is suggested to add contention-aware baselines (e.g., RL-TMC or contention-aware list scheduling) and, on the public task graphs, vary the number of machines, CCR, and tier capacities, reporting multi-seed means/variance and runtime overhead.
- Please clarify the value network, how the two-level policies are updated with PPO, how rollouts/batches are organized, whether each graph is trained separately, and how actions are selected during evaluation. Please also explain the relationship between the reward design and the final makespan objective under γ=0.99.
- Please redraw Figure 1 and standardize figure/table placement.
9 comments
Response to Reviewer bqxU (2/6)
Critical Weaknesses: 2. The DOPPLER baseline adaptation is unclear. ...; SCHEMA constructs task order and machine assignment step by step. ... The use of only a single placement sweep for Placeto also needs justification.
Questions For Authors: 3. How is DOPPLER's device placement converted into the task schedule used by your evaluator? ... What is the rationale for using only a single placement sweep for Placeto?
We thank the reviewer for pressing on the DOPPLER adaptation and on train/test consistency — these are the details that make the comparison trustworthy, and Appendix E has been expanded to give all of them.
DOPPLER [1] follows a two-stage simulation-based training procedure. Stage I uses imitation learning to initialize its policies from heuristic decisions, rather than a makespan-based reinforcement learning reward. Stage II performs reinforcement learning using the makespan-based reward computed by our tiered-contention evaluator. The same evaluator is used during testing. Consequently, DOPPLER's Stage-II training and evaluation are performed under identical contention assumptions, avoiding a static-training/contended-testing mismatch.
From placement to schedule: DOPPLER’s SEL and PLC policies select an operation and its device. From the lowest-cost episode we record the device assignments and SEL’s operation-selection sequence: the assignments become the task-to-machine mapping, and SEL’s sequence becomes the explicit scheduling order supplied to our evaluator. DOPPLER’s original asynchronous runtime fixes execution order at run time; since our evaluator consumes an explicit order, we use SEL’s own selection sequence — the ordering produced by DOPPLER’s policy itself — rather than imposing an external heuristic. We map both back to the original workload identifiers, validate the schedule against DAG precedence, and replay it through the common evaluator without reordering.
Stage III: We omit Stage III, which fine-tunes the policy on real GPU execution through the Einsummable engine. This hardware-in-the-loop step is outside the scope of a simulation study, and including it would give DOPPLER feedback that no other method receives.
Placeto [2] formulates placement as iterative node updates, with an episode containing decisions, where is a tunable number of passes. We use to control computational cost on large DAGs. Unlike the grouped-operation representation in the original work, our adaptation operates on individual task nodes. Consequently, one pass on MatInv already involves 16,208 placement decisions, while two passes would require 32,416. We acknowledge that additional passes could improve placement quality and identify this as a limitation of our adaptation.
References:
- Xinyu Yao, Daniel Bourgeois, Abhinav Jain, Yuxin Tang, Jiawen Yao, Zhimin Ding, Arlei Silva, and Chris Jermaine. DOPPLER: Dual-policy learning for device assignment in asynchronous dataflow graphs. In International Conference on Learning Representations, 2026.
- Ravichandra Addanki, Shaileshh Bojja Venkatakrishnan, Shreyan Gupta, Hongzi Mao, and Mohammad Alizadeh. Learning generalizable device placement algorithms for distributed machine learning. In Advances in Neural Information Processing Systems 32, pp. 3983–3993, 2019.
Response to Reviewer bqxU (3/6)
Critical Weaknesses: The communication simulator lacks grounding and parameter justification. ... The model lets a transfer occupy a tier until the successor task starts rather than until data transmission completes; ... and validate or analyze the sensitivity of conclusions to parameter changes.
Questions For Authors: 1. How were the parameters in Table 6 obtained? Please provide units, the complete per-link M2M costs, hardware measurements, or a parameter-sensitivity study.
Questions For Authors: 2. Why does a link resource remain occupied until the successor task starts? If data transmission has finished but the task is still waiting for a machine, how is this handled? What is the physical meaning of moving same-machine data to GROUP/GLOBAL when LOCAL is full?
We thank the reviewer for pressing on what the simulator’s rules represent; it lets us make the model’s grounding explicit, and we have expanded Appendix D to state it. The tiers are memory, not link bandwidth or reservations: LOCAL is a small per‑machine memory, GROUP a shared per‑group memory, and GLOBAL the top‑level memory. This settles the two rules the reviewer flags. A datum occupies its tier from when its producer finishes until its last consumer has read it, because it must reside in memory until it is consumed, not merely until it is transmitted; if it has arrived but the consumer is still waiting for its machine, it stays buffered in the tier, occupying capacity, until read. Same‑machine data moves to GROUP or GLOBAL when LOCAL is full — once LOCAL cannot hold another item, the datum is placed in the larger shared or global memory at higher cost, as data spills from a scratchpad to shared memory in a real hierarchy. The resources these rules correspond to are therefore storage buffers and their access cost.
On grounding, the capacities and costs reflect this hierarchy rather than being tuned. Each capacity is the number of data items a tier’s memory holds; each per‑unit cost is a relative measure of the tier’s access latency and energy, ordered LOCAL - GROUP - GLOBAL, with the M2M cost set per linked pair to capture the Euclidean distance between machines. The costs are relative rather than physical measurements; we have added Table 7 to state this and to list the complete per‑pair M2M costs.
Because the costs are relative, we validate that the conclusions do not depend on their specific values with a sensitivity study — the analysis the reviewer asks for in place of hardware measurement. The policy is trained on the default configuration and evaluated, without retraining, under the capacities and costs scaled across a range, with the heuristics recomputed for each setting as a reference. We will report these results during the discussion period.
Response to Reviewer bqxU (1/6)
We thank the reviewer for pushing on the positioning. Neither communication‑contention modeling nor the two‑level task/device decomposition is individually novel, and we claim neither: the decomposition appears as early as Lera and Guerrero (2024) [1], and our related work already credits earlier contention‑aware scheduling. As the reviewer identifies, our contribution is their combination — (i) a capacity‑limited tier‑occupancy model, (ii) state‑dependent tier‑estimation features that make this occupancy observable to the policy, and (iii) jointly learned task and machine selection. We have rewritten the contribution statement to say this directly, and expanded the related work section to position the recent learning‑based methods.
This combination is what separates SCHEMA from the closest prior work. Doppler [2] uses a two‑level policy, but its observation carries no representation of link occupancy, so the congestion earlier placements create is invisible at both levels. RL‑TMC [3] models contention but learns only task priorities, delegating processor assignment and message scheduling to a fixed heuristic; contention reaches its policy only through the final makespan, not through what it observes. Among the methods we are aware of, SCHEMA is the first to learn both decisions with contention visible at each.
On comparing against contention‑aware schedulers directly, we looked for RL‑TMC [3] but found no public implementation to reproduce faithfully, and its shared‑bus setting makes its published makespans not directly comparable to our capacity‑limited, multi‑tier one. The incremental benefit of the combination — which the reviewer rightly wants isolated — is exactly what our ablations provide, and more cleanly than a cross‑codebase comparison could. SCHEMA‑NoTier keeps the same two‑level architecture and the same contention‑aware environment and removes only the tier‑estimation features; its makespan rises sharply (Table 4), so the two‑level architecture alone cannot explain the result. Removing the congestion modeling (SCHEMA‑Static) and replacing the hierarchy with a flat policy (SCHEMA‑Flat) degrade it further. Each ablation changes one component with everything else held fixed, isolating its effect.
We acknowledge that the ablations do not stand in for a direct comparison with another contention‑aware scheduler, but they offer controlled evidence for the benefit of the combination. Moreover, to give the contention-aware comparison the reviewer requested, we also implement CA-HEFT, a contention-aware list scheduler. It keeps HEFT’s static upward-rank priorities but chooses each machine by the tiered, capacity-limited memory cost instead of a fixed per-edge cost. These are underway; results will be shared during the discussion period as they become available and included in the revised paper.
We thank the reviewer for the opportunity to make this positioning clearer — the sharpened contribution statement and the expanded related work are a direct result of this comment.
References: