Abstract
Regular data dependence checking on sparse codes usually results in very conservative estimates of the actual dependences occurring at run-time. Clearly, this is caused by the usage of compact data structures necessary to exploit sparsity in order to reduce storage requirements and computational time. However, if the compiler is presented with dense code and automatically converts it into code operating on sparse data structures, then the dependence information obtained by analysis of the original code can be used to exploit potential concurrency in the generated sparse code. In this paper, we explore synchronization generating and manipulating techniques based on this concept.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
