Browsing by Subject "static scheduling"
Now showing 1 - 1 of 1
- Results Per Page
- Sort Options
Item type:Article, Access status: Open Access , Porównanie algorytmów konstrukcyjnych statycznego harmonogramowania dla wybranych architektur wieloprocesorowych(Wydawnictwa AGH, 2009) Banul, Artur; Wala, KonradA formal model of static scheduling problem of dependent computational tasks in homogeneous multiprocessor system is presented. The dependent computational tasks are modeled by acyclic weighted task precedence degraph $G=(V,E)$, where $K$ is a task set, $E$ describes the precede relation in set $V$ and functions $p: V \to R^{+}$, $a: E \to R^{+}$ define the mean task execution and message transmission time, respectively. We give a description of six constructive scheduling algorithms for schedule calculation before application software execution by means of the algorithms of APN (Arbitrary Processors Network) class. Taking into account a number of important efficiency criterions, we picture the results of computational investigations of performance comparison of the scheduling algorithms for selected multiprocessor architectures. The computational results are discussed at the end of the paper.