作者: ALAIN DARTE , FRÉDÉRIC VIVIEN*†
DOI: 10.1080/01495739708941417
关键词:
摘要: We explore the link between dependence abstractions and maximal parallelism extraction in nested loops. Our goal is to find, for each abstraction, minimal transformations needed extraction. The result of this paper that Allen Kennedy's algorithm optimal when dependences are approximated by levels. This means even most sophisticated cannot detect more than found algorithm, as long level only information available. In other words, loop distribution sufficient detecting graphs with