Identifying loops using DJ graphs

Loop identification is a necessary step in loop transformations for high-performance architectures. One classical technique for detecting loops is Tarjan's interval-finding algorithm. The intervals identified by Tarjan's method are single-entry, strongly connected subgraphs that closely re...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	ACM transactions on programming languages and systems 1996-11, Vol.18 (6), p.649-658
Hauptverfasser:	Sreedhar, Vugranam C., Gao, Guang R., Lee, Yong-Fong
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences B-trees Compilers Computer science control theory systems Directory structures Discrete mathematics Exact sciences and technology Graph theory Information storage systems Information systems Mathematics of computing Programming languages Record storage systems Software Software and its engineering Software notations and tools Trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!