Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids

100%

Kołodziej J., Xhafa F.

International Journal of Applied Mathematics and Computer Science

2011

tom 21

nr 2

243-257

Tasks scheduling and resource allocation are among crucial issues in any large scale distributed system, including Computational Grids (CGs). These issues are commonly investigated using traditional computational models and resolution methods that yield near-optimal scheduling strategies. One drawback of such approaches is that they cannot effectively tackle the complex nature of CGs. On the one hand, such systems account for many administrative domains with their own access policies, user privileges, etc. On the other, CGs have hierarchical nature and therefore any computational model should be able to effectively express the hierarchical architecture in the optimization model. Recently, researchers have been investigating the use of game theory for modeling user requirements regarding task and resource allocation in grid scheduling problems. In this paper we present two general non-cooperative game approaches, namely, the symmetric non-zero sum game and the asymmetric Stackelberg game for modeling grid user behavior defined as user requirements. In our game-theoretic approaches we are able to cast new requirements arising in allocation problems, such as asymmetric users relations, security and reliability restrictions in CGs. For solving the games, we designed and implemented GA-based hybrid schedulers for approximating the equilibrium points for both games. The proposed hybrid resolution methods are experimentally evaluated through the grid simulator under heterogeneity, and large-scale and dynamics conditions. The relative performance of the schedulers is measured in terms of the makespan and flowtime metrics. The experimental analysis showed high efficiency of meta-heuristics in solving the game-based models, especially in the case of an additional cost of secure task scheduling to be paid by the users.

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Maintaining the feasibility of hard real-time systems with a reduced number of priority levels

71%

Qureshi M., Alrashed S., Min-Allah N., Kołodziej J., Arabas P.

International Journal of Applied Mathematics and Computer Science

2015

tom 25

nr 4

709-722

When there is a mismatch between the cardinality of a periodic task set and the priority levels supported by the underlying hardware systems, multiple tasks are grouped into one class so as to maintain a specific level of confidence in their accuracy. However, such a transformation is achieved at the expense of the loss of schedulability of the original task set. We further investigate the aforementioned problem and report the following contributions: (i) a novel technique for mapping unlimited priority tasks into a reduced number of classes that do not violate the schedulability of the original task set and (ii) an efficient feasibility test that eliminates insufficient points during the feasibility analysis. The theoretical correctness of both contributions is checked through formal verifications. Moreover, the experimental results reveal the superiority of our work over the existing feasibility tests by reducing the number of scheduling points that are needed otherwise.

Ograniczanie wyników

2 International Journal of Applied Mathematics and Computer Science

2 Kołodziej J.

1 Alrashed S.

1 Arabas P.

1 Min-Allah N.

1 Qureshi M.

1 Xhafa F.

1 2015

1 2011

Wyniki wyszukiwania

Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids

Maintaining the feasibility of hard real-time systems with a reduced number of priority levels