Temat: task scheduling - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: The Tabu Search approach in coherent co-synthesis of multiprocessors systems
Autorzy:: Drabowski, M.
Czajkowski, K.
Powiązania:: https://bibliotekanauki.pl/articles/92834.pdf
Data publikacji:: 2006
Wydawca:: Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:: synthesis of system
coherent
identification resources
task scheduling
NP-complete problem
heuristic algorithm
tabu search algorithm
Opis:: This paper presents the use of Tabu Search algorithm for solving the problems of coherent synthesis of multiprocessor computer systems. The paper includes a coherent solution of both optimization of partition resources and optimization of tasks scheduling. This publication shows results of computational experiments for different instances of system synthesis problems.
Źródło:: Studia Informatica : systems and information technology; 2006, 1(7); 31-45
1731-2264
Pojawia się w:: Studia Informatica : systems and information technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Coherent synthesis of heterogeneous system - an ant colony optimization approach
Autorzy:: Drabowski, M.
Powiązania:: https://bibliotekanauki.pl/articles/93002.pdf
Data publikacji:: 2007
Wydawca:: Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:: synthesis
scheduling
task
selection
resource coherent
ant colony
branch
bound
Opis:: The paper presents an innovative approach to solving the problems of computer system synthesis based on ant colony optimization method. We describe algorithm realizations aimed to optimize resource, selection and task scheduling, as well as the adaptation of those algorithms for coherent synthesis realization. We then present selected analytical experiments proving the correctness of the coherent synthesis concept and indicate its practical motivations.
Źródło:: Studia Informatica : systems and information technology; 2007, 2(9); 9-18
1731-2264
Pojawia się w:: Studia Informatica : systems and information technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Game Theoretical Model Applied to Scheduling in Grid Computing
Autorzy:: Świtalski, P.
Seredyński, F.
Powiązania:: https://bibliotekanauki.pl/articles/93040.pdf
Data publikacji:: 2007
Wydawca:: Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:: scheduling
game theory
prisoner's dilemma
genetic algorithm
grid
task
job
Opis:: We consider a grid computational model which consist of a number of computation nodes and a number of users. Each user generates a computation load (jobs) requesting computational and communication resources. A deadline for each job is also defined. We propose a scheduling algorithm which is based on Iterated Prisoner's Dilemma (IPD) under the Random Pairing game, where nodes (players) of the grid system decide about their behavior: cooperate or defect. In this game players play a game with randomly chosen players and receive payoffs. Each player has strategies which define its decision. Genetic algorithm (GA) is used to evolve strategies to optimize a criterion related to scheduling problem. In this paper we show that GA is able to discover a strategy in the IPD model providing a cooperation between node-players, which permits to solve scheduling problem in grid.
Źródło:: Studia Informatica : systems and information technology; 2007, 2(9); 19-27
1731-2264
Pojawia się w:: Studia Informatica : systems and information technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja