home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #30 / NN_1992_30.iso / spool / comp / compiler / 2040 < prev    next >
Encoding:
Text File  |  1992-12-15  |  1.0 KB  |  30 lines
  1. Newsgroups: comp.compilers
  2. Path: sparky!uunet!world!iecc!compilers-sender
  3. From: bwilson@shasta.stanford.edu (Bob Wilson)
  4. Subject: Re: question on control dependence
  5. Reply-To: bwilson@shasta.stanford.edu (Bob Wilson)
  6. Organization: Compilers Central
  7. Date: Tue, 15 Dec 1992 19:48:43 GMT
  8. Approved: compilers@iecc.cambridge.ma.us
  9. Message-ID: <92-12-072@comp.compilers>
  10. References: <92-12-056@comp.compilers> <92-12-065@comp.compilers>
  11. Keywords: optimize, design, bibliography
  12. Sender: compilers-sender@iecc.cambridge.ma.us
  13. Lines: 15
  14.  
  15. Carl McConnell writes:
  16. > I've come up with a simple algorithm for computing control dependences, ...
  17.  
  18. This sounds like the algorithm that was used in the PTRAN compiler.
  19. I think it's described in a research report by Vivek Sarkar:
  20.  
  21. "PTRAN - the IBM Parallel Translation System"
  22. IBM Research Division Report RC 16194
  23. 1990
  24.  
  25. Bob Wilson
  26. bwilson@shasta.stanford.edu
  27. -- 
  28. Send compilers articles to compilers@iecc.cambridge.ma.us or
  29. {ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.
  30.