Transitive closure of infinite graphs and its applications

International Journal of Parallel Programming

Volumn 24, Issue 6, 1996, Pages 579-598

  Kelly, Wayne ^a   Pugh, William ^a   Rosser, Evan ^a   Shpeisman, Tatiana ^a  

^a University of Maryland ^*  (United States)

Author keywords

Dependence relations; Integer tuple relations; Redundant sychronization removal; Transitive closure

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; SYNCHRONIZATION; THEOREM PROVING;

AFFINE CONSTRAINTS; INFINITE GRAPHS; INTEGER TUPLE RELATIONS; INTERPROCESSOR SYNCHRONIZATIONS; TRANSITIVE CLOSURE;

GRAPH THEORY;

EID: 0030381495     PISSN: 08857458     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03356760     Document Type: Article

References (10)

1. Wayne Kelly, and William Pugh, A Framework for Umlymg Reordering Transformations. Technical Report CS-TR-3193, Department of Computer Science, University of Maryland, College Park (April 1993).
2. Wayne Kelly, Vadim Maslov, William Pugh, Evan Rosser, Tatiana Shpeisman, and David Wonnacott, The Omega Library Interface Guide. Technical Report CS-TR-3445, Department of Computer Science, University of Maryland, College Park (March 1995).
3. Wayne Kelly and William Pugh, Finding Legal Reordering Transformations Using Mappings. Sei-enth Int'l. Workshop on Languages and Compilers for Parallel Computing Lecture Notes in Computer Science, Vol. 892 Ithaca, New York Springer-Verlag. (August 1994).
4. V. P. Krothapalli and P. Sadayappan, Removal of Redundant Dependences in DOACROSS Loops with Constant Dependences. Proc. of the Third ACM SIGPLAN Symp. on PPPP, pp. 51-60 (July 1991).
5. Ding-Kai Chen, Compiler Optimizations for Parallel Loops With Fine-Grained Synchronization. Ph.D. Thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, 1994. Also available as CSRD Report 1374.
6. Wayne Kelly and William Pugh, A Unifying Framework for Iteration Reordering Transformations. Proc. of the IEEE First Int'l. Conf. on Algorithms and Architectures for Parallel Processing, Brisbane, Australia (April 1995).
7. S. P. Midkiffand D. A. Padua, Compiler Algorithms for Synchronization. IEEE Trans, on Computers, C-36(12):1485-1495 (1987).
8. S. P. MidkifT and D. A. Padua, A Comparison of Four Synchronization Optimization Techniques. Proc. IEEE Int'l Conf. on Parallel Processing, pp. H-9-II-16 (August 1991).
9. M. Gupta and E. Schonberg, Static Analysis to Reduce Synchronization Costs in DataParallel Programs. Conference Record of POPL '96: The 23RD ACM SIGPLAN-SIGACT Symp. on PPL (January 1996).
10. Chau-Wen Tseng. Compiler Optimizations for Eliminating Barrier Synchronization. Proc. of the Fifth ACM SIGPLAN Symp. on PPPP, pp. 144-155 (July 1995).