\input zb-basic
\input zb-ioport
\iteman{io-port 05469116}
\itemau{Rapine, Christophe}
\itemti{Iterative linear clusterings. (Une approache it\?erative des regroupements lin\?eaires.)}
\itemso{RAIRO, Tech. Sci. Inf. 17, No. 2, 231-248 (1998).}
\itemab
Summary: We focus on the problem of the static scheduling of parallel programs represented by DAGs. We study more particularly the case of an unbounded number of processors which corresponds to the clustering problem. We propose a new iterative approach of the problem by generalizing the DSC algorithm of the Pyros environment. This method successively builds a series of clusterings whose parallel times can be shown decreasing on coarse grain graphs.
\itemrv{~}
\itemcc{G.2.2 D.2.2 D.3 F.2.2 H.3.3}
\itemut{$Dag(directed acyclic graph)$; scheduling of parallel programs; $Dsc(dominant sequence clustering)$; linear clustering; iterative method}
\itemli{}
\end