Browsing by Subject "task scheduling"

Now showing 1 - 6 of 6

Access status: Restricted ,
Analysis of D'Wave2000Q Applicability for Job Scheduling Problems
(Data obrony: 2020-07-16) Tomasiewicz, Dawid
Wydział Informatyki, Elektroniki i Telekomunikacji
Access status: Open Access ,
Dwupoziomowy algorytm dla problemu udostępniania pól eksploatacyjnych
(Wydawnictwa AGH, 2007) Dutkiewicz, Lidia; Kucharska, Edyta
The aim of the paper is to present two-level algorithm based on a heuristic method named substitution task method. Main concept of the algorithm is creation and than realization of so-called intermediate goals. Presented algorithm is applied for NP-hard problem of preparing access to exploitation fields. This is a task scheduling problem where resources depend on process state. An outline of algebraic-logical model for this problem is given in the paper. Some results of experiments are also described.
Access status: Open Access ,
Dynamic tile free scheduling for code with acyclic inter-tile dependence graphs
(Wydawnictwa AGH, 2017) Bielecki, Włodzimierz; Skotnicki, Piotr
Free scheduling is a task ordering technique under which instructions are executed as soon as their operands become available. Coarsening the grain of computations under the free schedule, by means of using groups of loop nest statement instances (tiles) in place of single statement instances, increases the locality of data accesses and reduces the number of synchronization events, and as a consequence improves program performance. The paper presents an approach for code generation that allows for the free schedule for tiles of arbitrarily nested affine loops at run-time. The scope of the applicability of the introduced algorithms is limited to tiled loop nests whose inter-tile dependence graphs are cycle-free. The approach is based on the polyhedral model. Results of experiments with the PolyBench benchmark suite, demonstrating significant tiled code speed-up, are discussed.
Access status: Open Access ,
Metody sztucznej inteligencji w syntezie systemów typu kompleks zasobów i operacji
(Wydawnictwa AGH, 2011) Drabowski, Mieczysław; Wantuch, Edward T.
The goal of this synthesis is to find an optimum solution satisfying the requirements and constraints enforced by the given specification of the system. The partition of the functions between hardware and software is the basic problem of synthesis. Such partition is significant, because every computer system must be realized as result of hardware implementation for its certain tasks. Due to the fact that synthesis problems and their optimizations are NP-complete we suggest meta-heuristic approaches.
Access status: Open Access ,
Model dla problemu szeregowania zadań z zasobami zależnymi od stanu systemu
(Wydawnictwa AGH, 2005) Dutkiewicz, Lidia; Kucharska, Edyta
Celem artykułu jest przedstawienie modelu algebraiczno-logicznego dla specyficznego problemu szeregowania zadań, w którym występuje konieczność transportu maszyn. Charakterystyczną cechą tego problemu jest fakt, że zasoby, niezbędne do realizacji zadań, są zmienne i ich dostępność zależy od aktualnego stanu systemu. Rozpatrywany model uwzględnia możliwość oczekiwania maszyn na udostępnienie zasobu Jest to problem należący do klasy problemów NP-trudnych. Model algebraiczno-logiczny wykorzystywany jest do symulacji procesu połączonej z jego optymalizacją.
Access status: Open Access ,
Szeregowanie rozrzedzonych systemów zadań jednostkowych 1- i 2-procesowych w oknach czasowych
(Wydawnictwa AGH, 2005) Giaro, Krzysztof; Kubale, Marek
In the paper sparse systems of dedicated 1- and 2-processor tasks with unit execution times are considered. Polynomial-time algorithms based on dynamic programming are given. These algorithms allow finding optimal solutions with respect to broad range of criterion functions. The sparsity of a system is measured in terms of the number of edges in the corresponding scheduling graph. More precisely, we are focused on graphs whose cyclomatic number is bounded by a constant. Our algorithms invoke procedures for finding maximal matching in graphs.