|
20 | 20 | package org.apache.sysds.hops.fedplanner; |
21 | 21 |
|
22 | 22 | import org.apache.sysds.hops.Hop; |
| 23 | +import org.apache.sysds.hops.OptimizerUtils; |
23 | 24 | import org.apache.commons.lang3.tuple.Pair; |
24 | 25 | import org.apache.commons.lang3.tuple.ImmutablePair; |
25 | 26 | import org.apache.sysds.runtime.instructions.fed.FEDInstruction.FederatedOutput; |
26 | | - |
27 | 27 | import java.util.Comparator; |
28 | 28 | import java.util.HashMap; |
29 | 29 | import java.util.List; |
@@ -139,19 +139,68 @@ private void printFedPlanTreeRecursive(FedPlan plan, Set<FedPlan> visited, int d |
139 | 139 |
|
140 | 140 | visited.add(plan); |
141 | 141 |
|
142 | | - // Create indentation and connectors for tree visualization |
143 | | - String indent = " ".repeat(depth); |
144 | | - String prefix = depth == 0 ? "└──" : |
145 | | - isLast ? "└─" : "├─"; |
146 | | - |
147 | | - // Print plan information |
148 | | - System.out.printf("%s%sHop %d [%s] (Total: %.3f, Self: %.3f, Net: %.3f)%n", |
149 | | - indent, prefix, |
150 | | - plan.getHopRef().getHopID(), |
151 | | - plan.getFedOutType(), |
152 | | - plan.getTotalCost(), |
153 | | - plan.getSelfCost(), |
154 | | - plan.getNetTransferCost()); |
| 142 | + Hop hop = plan.getHopRef(); |
| 143 | + StringBuilder sb = new StringBuilder(); |
| 144 | + |
| 145 | + // Add FedPlan information |
| 146 | + sb.append(String.format("(%d) ", plan.getHopRef().getHopID())) |
| 147 | + .append(plan.getHopRef().getOpString()) |
| 148 | + .append(" [") |
| 149 | + .append(plan.getFedOutType()) |
| 150 | + .append("]"); |
| 151 | + |
| 152 | + StringBuilder childs = new StringBuilder(); |
| 153 | + childs.append(" ("); |
| 154 | + boolean childAdded = false; |
| 155 | + for( Hop input : hop.getInput()){ |
| 156 | + childs.append(childAdded?",":""); |
| 157 | + childs.append(input.getHopID()); |
| 158 | + childAdded = true; |
| 159 | + } |
| 160 | + childs.append(")"); |
| 161 | + if( childAdded ) |
| 162 | + sb.append(childs.toString()); |
| 163 | + |
| 164 | + |
| 165 | + sb.append(String.format(" {Total: %.1f, Self: %.1f, Net: %.1f}", |
| 166 | + plan.getTotalCost(), |
| 167 | + plan.getSelfCost(), |
| 168 | + plan.getNetTransferCost())); |
| 169 | + |
| 170 | + // Add matrix characteristics |
| 171 | + sb.append(" [") |
| 172 | + .append(hop.getDim1()).append(", ") |
| 173 | + .append(hop.getDim2()).append(", ") |
| 174 | + .append(hop.getBlocksize()).append(", ") |
| 175 | + .append(hop.getNnz()); |
| 176 | + |
| 177 | + if (hop.getUpdateType().isInPlace()) { |
| 178 | + sb.append(", ").append(hop.getUpdateType().toString().toLowerCase()); |
| 179 | + } |
| 180 | + sb.append("]"); |
| 181 | + |
| 182 | + // Add memory estimates |
| 183 | + sb.append(" [") |
| 184 | + .append(OptimizerUtils.toMB(hop.getInputMemEstimate())).append(", ") |
| 185 | + .append(OptimizerUtils.toMB(hop.getIntermediateMemEstimate())).append(", ") |
| 186 | + .append(OptimizerUtils.toMB(hop.getOutputMemEstimate())).append(" -> ") |
| 187 | + .append(OptimizerUtils.toMB(hop.getMemEstimate())).append("MB]"); |
| 188 | + |
| 189 | + // Add reblock and checkpoint requirements |
| 190 | + if (hop.requiresReblock() && hop.requiresCheckpoint()) { |
| 191 | + sb.append(" [rblk, chkpt]"); |
| 192 | + } else if (hop.requiresReblock()) { |
| 193 | + sb.append(" [rblk]"); |
| 194 | + } else if (hop.requiresCheckpoint()) { |
| 195 | + sb.append(" [chkpt]"); |
| 196 | + } |
| 197 | + |
| 198 | + // Add execution type |
| 199 | + if (hop.getExecType() != null) { |
| 200 | + sb.append(", ").append(hop.getExecType()); |
| 201 | + } |
| 202 | + |
| 203 | + System.out.println(sb); |
155 | 204 |
|
156 | 205 | // Process child nodes |
157 | 206 | List<Pair<Long, FederatedOutput>> childRefs = plan.getChildFedPlans(); |
|
0 commit comments