Faculty Candidate Arrangement Checklist

Faculty Candidate Arrangement Checklist

<p>Sample exam questions</p><p>1. Does the following loop have dependences? Indicate the dependences with arrows, and label the arrows with the dependence attributes that you know.</p><p>DO j=lb,ub T = B(j)+D(j) C(j)= T+T2 A(j)=3*A(j)-4*A(j-2) ENDDO</p><p>2. Describe three big open issues in optimizing compilers?</p><p>3. Give an example code in which in would be advantageous for the compiler to transform it with the privatized reduction trnsformation rather than the expanded reduction transformation. Describe why this is so.</p><p>4. Given a cache size of 1MB, what block size would you choose for the following loop:</p><p>DO j0=1,jub,block DO k=1,kub DO j=j0, min(j0+block-1,jub) T = B(j,k)+D(j,k) C(j,k)= T+T2 A(j,k)=3*A(j,k)-4*A(j,k-2) ENDDO ENDDO</p><p> a) give a formula; define all variables in the formula b) plug in reasonable numerical values for all variables c) as a compiler implementor would you always apply the above blocking transformation for this loop? Explain.</p>

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    1 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us