Map
Index
Random
Help
th

Quote: bitvector analysis can ignore the various interleavings of parallel components; parallel-meet over all paths (PMOP) is equivalent to parallel bitvector maximal fixed point

QuoteRef: knooJ5_1995 , p. 265



Topic:
code optimization by flow analysis
Topic:
parallel algorithms

Quotation Skeleton

[Optimal covering of interference] is a consequence of a Kam/Ullman-style [ref} Coincidence Theorem for bitvector analyses stating that the parallel meet over all paths (PMOP) solution, which specifies the desired properties, coincides with our parallel bitvector maximal fixed point IPMFP_BV) solution, which is the basis of our algorithm. This result is rather surprising, as it states that although the various interleavings of the executions of parallel components are semantically different, they need not be considered during bitvector analysis, which is the key observation of this paper.   Google-1   Google-2

Copyright clearance needed for quotation.


Related Topics up

Topic: code optimization by flow analysis (47 items)
Topic: parallel algorithms (15 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.