https://llvm.org/bugs/show_bug.cgi?id=26320
Bug ID: 26320
Summary: [Polly] Make reduction dependency computation work on
schedule trees
Product: Polly
Version: unspecified
Hardware: PC
OS: Linux
Status: NEW
Severity: normal
Priority: P
Component: Optimizer
Assignee: [email protected]
Reporter: [email protected]
CC: [email protected]
Classification: Unclassified
When introducing reductions into Polly we thought it would be a good idea to
model reduction dependences using a "convex_hull" computation. However, this is
both computationally a lot more complex than expected and also conflicts made
it hard to compute reduction dependences on schedule trees. Fortunately, Sven
Verdoolaege suggested (at least parts) of what looks like a good solution.
Instead of first computing precise dependences and _then_ reintroducing
reduction dependences, we could just model reduction statements as may-writes
which will make the dependence analysis automatically introduce the additional
dependences needed when removing the inter-reduction-operation dependences.
This blocks http://reviews.llvm.org/D5190
This is just a brief reminder. Please ping back in case you need more
information.
--
You are receiving this mail because:
You are on the CC list for the bug.
_______________________________________________
llvm-bugs mailing list
[email protected]
http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-bugs
