Efficient Encoding Schedules for XOR-Based Erasure Codes
[KKLP 80] describes graph abstraction as a process in which given a graph a mt of nodes and their internal arcs may be merged to form a compound node. Any edps incident to (or from) the set are made incident to (or from) the compound node. Our goal k to perform a modified type of graph abstraction on a layered dependence graph. We collapse the set of statements contained in a FOR or WHILE loop into a compound node that
Unfortunately, ACM prohibits us from displaying non-influential references for this paper.
To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=800539.