xref: /netbsd-src/external/mit/isl/dist/doc/reading.tex (revision 5971e316fdea024efff6be8f03536623db06833e)
1*5971e316Smrg\textcite{Verdoolaege2016tutorial} describes the concepts behind
2*5971e316Smrg\isl in some detail, mainly focusing on Presburger formulas,
3*5971e316Smrgbut also including some information on polyhedral compilation,
4*5971e316Smrgespecially on dependence analysis.
5*5971e316SmrgIndividual aspects of \isl are described in the following publications.
6*5971e316Smrg\begin{itemize}
7*5971e316Smrg\item
8*5971e316Smrg\textcite{Verdoolaege2009equivalence} introduce \isl as a library
9*5971e316Smrgfor manipulating sets of integers defined by linear inequalities and
10*5971e316Smrginteger divisions that is used in their equivalence checker.
11*5971e316Smrg
12*5971e316Smrg\item
13*5971e316Smrg\textcite{Verdoolaege2010isl} provides a more detailed description
14*5971e316Smrgof \isl at the time and still stands as the official reference for
15*5971e316Smrg\isl.  However, many features were only added later on and one or
16*5971e316Smrgmore of the publications below may be more appropriate as
17*5971e316Smrga reference to these features.
18*5971e316Smrg
19*5971e316Smrg\item
20*5971e316Smrg\textcite[Section 5.1]{Verdoolaege2010networks} provides some
21*5971e316Smrgdetails on the dataflow analysis step, but also see
22*5971e316Smrg\textcite[Chapter 6]{Verdoolaege2016tutorial} and
23*5971e316Smrg\textcite{Verdoolaege2016reordering} for a more recent treatment.
24*5971e316Smrg
25*5971e316Smrg\item The concepts of structured and named spaces and the manipulation
26*5971e316Smrgof sets containing elements in different spaces were introduced
27*5971e316Smrgby \textcite{Verdoolaege2011iscc}.
28*5971e316Smrg
29*5971e316Smrg\item The transitive closure operation is described
30*5971e316Smrgby \textcite{Verdoolaege2011closure}.
31*5971e316Smrg
32*5971e316Smrg\item The scheduler is briefly described by
33*5971e316Smrg\textcite[Section 6.2]{Verdoolaege2013PPCG} and
34*5971e316Smrg\textcite[Section 2.4]{Verdoolaege2016reordering}.
35*5971e316Smrg
36*5971e316Smrg\item Schedule trees started out as ``trees of bands''
37*5971e316Smrg\parencite[Section 6.2]{Verdoolaege2013PPCG}, were formally
38*5971e316Smrgintroduced by \textcite{Verdoolaege2014impact}, and were
39*5971e316Smrgslightly refined by \textcite{Grosser2015AST}.
40*5971e316Smrg
41*5971e316Smrg\item The coalescing operation is described by
42*5971e316Smrg\textcite{Verdoolaege2015impact}.
43*5971e316Smrg
44*5971e316Smrg\item The AST generator is described by \textcite{Grosser2015AST}.
45*5971e316Smrg
46*5971e316Smrg\end{itemize}
47