use of org.apache.sysml.hops.codegen.template.CPlanMemoTable.MemoTableEntry in project incubator-systemml by apache.
the class PlanSelectionFuseAll method rSelectPlans.
private void rSelectPlans(CPlanMemoTable memo, Hop current, TemplateType currentType) {
if (isVisited(current.getHopID(), currentType))
return;
//step 1: prune subsumed plans of same type
if (memo.contains(current.getHopID())) {
HashSet<MemoTableEntry> rmSet = new HashSet<MemoTableEntry>();
List<MemoTableEntry> hopP = memo.get(current.getHopID());
for (MemoTableEntry e1 : hopP) for (MemoTableEntry e2 : hopP) if (e1 != e2 && e1.subsumes(e2))
rmSet.add(e2);
memo.remove(current, rmSet);
}
//step 2: select plan for current path
MemoTableEntry best = null;
if (memo.contains(current.getHopID())) {
if (currentType == null) {
best = memo.get(current.getHopID()).stream().filter(p -> isValid(p, current)).min(new BasicPlanComparator()).orElse(null);
} else {
best = memo.get(current.getHopID()).stream().filter(p -> p.type == currentType || p.type == TemplateType.CellTpl).min(Comparator.comparing(p -> 7 - ((p.type == currentType) ? 4 : 0) - p.countPlanRefs())).orElse(null);
}
addBestPlan(current.getHopID(), best);
}
//step 3: recursively process children
for (int i = 0; i < current.getInput().size(); i++) {
TemplateType pref = (best != null && best.isPlanRef(i)) ? best.type : null;
rSelectPlans(memo, current.getInput().get(i), pref);
}
setVisited(current.getHopID(), currentType);
}
use of org.apache.sysml.hops.codegen.template.CPlanMemoTable.MemoTableEntry in project incubator-systemml by apache.
the class PlanSelectionFuseCostBased method rPruneSuboptimalPlans.
private static void rPruneSuboptimalPlans(CPlanMemoTable memo, Hop current, HashSet<Long> visited, HashSet<Long> partition, ArrayList<Long> M, boolean[] plan) {
//memoization (not via hops because in middle of dag)
if (visited.contains(current.getHopID()))
return;
//remove memo table entries if necessary
long hopID = current.getHopID();
if (partition.contains(hopID) && memo.contains(hopID)) {
Iterator<MemoTableEntry> iter = memo.get(hopID).iterator();
while (iter.hasNext()) {
MemoTableEntry me = iter.next();
if (!hasNoRefToMaterialization(me, M, plan) && me.type != TemplateType.OuterProdTpl) {
iter.remove();
if (LOG.isTraceEnabled())
LOG.trace("Removed memo table entry: " + me);
}
}
}
//process children recursively
for (Hop c : current.getInput()) rPruneSuboptimalPlans(memo, c, visited, partition, M, plan);
visited.add(current.getHopID());
}
use of org.apache.sysml.hops.codegen.template.CPlanMemoTable.MemoTableEntry in project incubator-systemml by apache.
the class PlanSelection method rSelectPlansFuseAll.
protected void rSelectPlansFuseAll(CPlanMemoTable memo, Hop current, TemplateType currentType, HashSet<Long> partition) {
if (isVisited(current.getHopID(), currentType) || (partition != null && !partition.contains(current.getHopID())))
return;
// step 1: prune subsumed plans of same type
if (memo.contains(current.getHopID())) {
HashSet<MemoTableEntry> rmSet = new HashSet<>();
List<MemoTableEntry> hopP = memo.get(current.getHopID());
for (MemoTableEntry e1 : hopP) for (MemoTableEntry e2 : hopP) if (e1 != e2 && e1.subsumes(e2))
rmSet.add(e2);
memo.remove(current, rmSet);
}
// step 2: select plan for current path
MemoTableEntry best = null;
if (memo.contains(current.getHopID())) {
if (currentType == null) {
best = memo.get(current.getHopID()).stream().filter(p -> p.isValid()).min(BASE_COMPARE).orElse(null);
} else {
_typedCompare.setType(currentType);
best = memo.get(current.getHopID()).stream().filter(p -> p.type == currentType || p.type == TemplateType.CELL).min(_typedCompare).orElse(null);
}
addBestPlan(current.getHopID(), best);
}
// step 3: recursively process children
for (int i = 0; i < current.getInput().size(); i++) {
TemplateType pref = (best != null && best.isPlanRef(i)) ? best.type : null;
rSelectPlansFuseAll(memo, current.getInput().get(i), pref, partition);
}
setVisited(current.getHopID(), currentType);
}
use of org.apache.sysml.hops.codegen.template.CPlanMemoTable.MemoTableEntry in project incubator-systemml by apache.
the class PlanSelectionFuseCostBased method createAndAddMultiAggPlans.
// across-partition multi-agg templates with shared reads
private void createAndAddMultiAggPlans(CPlanMemoTable memo, ArrayList<Hop> roots) {
// collect full aggregations as initial set of candidates
HashSet<Long> fullAggs = new HashSet<>();
Hop.resetVisitStatus(roots);
for (Hop hop : roots) rCollectFullAggregates(hop, fullAggs);
Hop.resetVisitStatus(roots);
// remove operators with assigned multi-agg plans
fullAggs.removeIf(p -> memo.contains(p, TemplateType.MAGG));
// check applicability for further analysis
if (fullAggs.size() <= 1)
return;
if (LOG.isTraceEnabled()) {
LOG.trace("Found across-partition ua(RC) aggregations: " + Arrays.toString(fullAggs.toArray(new Long[0])));
}
// collect information for all candidates
// (subsumed aggregations, and inputs to fused operators)
List<AggregateInfo> aggInfos = new ArrayList<>();
for (Long hopID : fullAggs) {
Hop aggHop = memo.getHopRefs().get(hopID);
AggregateInfo tmp = new AggregateInfo(aggHop);
for (int i = 0; i < aggHop.getInput().size(); i++) {
Hop c = HopRewriteUtils.isMatrixMultiply(aggHop) && i == 0 ? aggHop.getInput().get(0).getInput().get(0) : aggHop.getInput().get(i);
rExtractAggregateInfo(memo, c, tmp, TemplateType.CELL);
}
if (tmp._fusedInputs.isEmpty()) {
if (HopRewriteUtils.isMatrixMultiply(aggHop)) {
tmp.addFusedInput(aggHop.getInput().get(0).getInput().get(0).getHopID());
tmp.addFusedInput(aggHop.getInput().get(1).getHopID());
} else
tmp.addFusedInput(aggHop.getInput().get(0).getHopID());
}
aggInfos.add(tmp);
}
if (LOG.isTraceEnabled()) {
LOG.trace("Extracted across-partition ua(RC) aggregation info: ");
for (AggregateInfo info : aggInfos) LOG.trace(info);
}
// sort aggregations by num dependencies to simplify merging
// clusters of aggregations with parallel dependencies
aggInfos = aggInfos.stream().sorted(Comparator.comparing(a -> a._inputAggs.size())).collect(Collectors.toList());
// greedy grouping of multi-agg candidates
boolean converged = false;
while (!converged) {
AggregateInfo merged = null;
for (int i = 0; i < aggInfos.size(); i++) {
AggregateInfo current = aggInfos.get(i);
for (int j = i + 1; j < aggInfos.size(); j++) {
AggregateInfo that = aggInfos.get(j);
if (current.isMergable(that)) {
merged = current.merge(that);
aggInfos.remove(j);
j--;
}
}
}
converged = (merged == null);
}
if (LOG.isTraceEnabled()) {
LOG.trace("Merged across-partition ua(RC) aggregation info: ");
for (AggregateInfo info : aggInfos) LOG.trace(info);
}
// construct and add multiagg template plans (w/ max 3 aggregations)
for (AggregateInfo info : aggInfos) {
if (info._aggregates.size() <= 1)
continue;
Long[] aggs = info._aggregates.keySet().toArray(new Long[0]);
MemoTableEntry me = new MemoTableEntry(TemplateType.MAGG, aggs[0], aggs[1], (aggs.length > 2) ? aggs[2] : -1, aggs.length);
for (int i = 0; i < aggs.length; i++) {
memo.add(memo.getHopRefs().get(aggs[i]), me);
addBestPlan(aggs[i], me);
if (LOG.isTraceEnabled())
LOG.trace("Added multiagg* plan: " + aggs[i] + " " + me);
}
}
}
use of org.apache.sysml.hops.codegen.template.CPlanMemoTable.MemoTableEntry in project incubator-systemml by apache.
the class PlanSelectionFuseCostBased method rPruneInvalidPlans.
private static void rPruneInvalidPlans(CPlanMemoTable memo, Hop current, HashSet<Long> visited, HashSet<Long> partition, ArrayList<Long> M, boolean[] plan) {
// memoization (not via hops because in middle of dag)
if (visited.contains(current.getHopID()))
return;
// process children recursively
for (Hop c : current.getInput()) rPruneInvalidPlans(memo, c, visited, partition, M, plan);
// find invalid row aggregate leaf nodes (see TemplateRow.open) w/o matrix inputs,
// i.e., plans that become invalid after the previous pruning step
long hopID = current.getHopID();
if (partition.contains(hopID) && memo.contains(hopID, TemplateType.ROW)) {
for (MemoTableEntry me : memo.get(hopID)) {
if (me.type == TemplateType.ROW) {
// convert leaf node with pure vector inputs
if (!me.hasPlanRef() && !TemplateUtils.hasMatrixInput(current)) {
me.type = TemplateType.CELL;
if (LOG.isTraceEnabled())
LOG.trace("Converted leaf memo table entry from row to cell: " + me);
}
// convert inner node without row template input
if (me.hasPlanRef() && !ROW_TPL.open(current)) {
boolean hasRowInput = false;
for (int i = 0; i < 3; i++) if (me.isPlanRef(i))
hasRowInput |= memo.contains(me.input(i), TemplateType.ROW);
if (!hasRowInput) {
me.type = TemplateType.CELL;
if (LOG.isTraceEnabled())
LOG.trace("Converted inner memo table entry from row to cell: " + me);
}
}
}
}
}
visited.add(current.getHopID());
}
Aggregations